CSMA algorithms are known to achieve the optimal wireless system capacity with low complexity. However, they have been observed to incur exponentially large delay. In this talk, we present a new CSMA-like algorithm, called Virtual-Multi-Channel (VMC-) CSMA. VMC-CSMA can dramatically reduce delay without sacrificing the high throughput and low complexity of CSMA. The key idea of VMC-CSMA is to use multiple virtual channels that emulate a multi-channel system. Under a single-hop utility-maximization setting, we show that VMC-CSMA can approach arbitrarily close to the optimal total system utility, with the computation complexity increasing logarithmically with the network size. Further, both the packet delay and the head-of-line (HOL) waiting time at each link can be tightly bounded.