Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
We study the subset of the communicating sequential processes formalism in which processes are described in terms of recursive equations that use only constant processes, deterministic choice, parallel composition, and sequential composition. Even with this limited version, the formalism is powerful enough to model a Turing machine, so that a number of important problems such as boundedness, deadlock, and reachability are undecidable. © 1990 IEEE
Eric Price, David P. Woodruff
FOCS 2011
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Raymond Wu, Jie Lu
ITA Conference 2007
Reena Elangovan, Shubham Jain, et al.
ACM TODAES