FCT
15 years 2 months ago
2005 Springer  108
click to vote
FCT
15 years 2 months ago
2005 Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
76
Voted
FCT
15 years 2 months ago
2005 Springer 
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
FCT
15 years 2 months ago
2005 Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
FCT
15 years 2 months ago
2005 Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
|
Applied Computing