Facet browsing currently unavailable
Page 1 of 335 results
Sort by: relevance publication year
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths BOOK CHAPTER published 2002 in Automata, Languages and Programming |
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds BOOK CHAPTER published 2014 in Automata, Languages, and Programming |
Lower bounds for dynamic range query problems that permit subtraction (extended abstract) BOOK CHAPTER published 1986 in Automata, Languages and Programming |
Measuring the expressive power of dynamic logics: An application of abstract model theory BOOK CHAPTER published 1980 in Automata, Languages and Programming |
Lower bounds by kolmogorov-complexity BOOK CHAPTER published in Automata, Languages and Programming |
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds BOOK CHAPTER published 2011 in Automata, Languages and Programming |
Lower bounds for solving undirected graph problems on VLSI BOOK CHAPTER published in Automata, Languages and Programming |
Tighter Fourier Transform Lower Bounds BOOK CHAPTER published 2015 in Automata, Languages, and Programming |
Exponential Lower Bounds for Policy Iteration BOOK CHAPTER published 2010 in Automata, Languages and Programming |
On size bounds for deterministic parsers BOOK CHAPTER published 1981 in Automata, Languages and Programming |
Lower bounds for sorting of sums BOOK CHAPTER published 1987 in Automata, Languages and Programming |
Lower bounds by recursion theoretic arguments BOOK CHAPTER published 1986 in Automata, Languages and Programming |
Upper Bounds for a Theory of Queues BOOK CHAPTER published 2003 in Automata, Languages and Programming |
On the Power of Ambainis’s Lower Bounds BOOK CHAPTER published 2004 in Automata, Languages and Programming |
Compositionality through an operational semantics of contexts BOOK CHAPTER published in Automata, Languages and Programming |
Lower bounds for constant depth circuits for prefix problems BOOK CHAPTER published in Automata, Languages and Programming |
Proving lower bounds for linear decision trees BOOK CHAPTER published 1981 in Automata, Languages and Programming |
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem BOOK CHAPTER published 2011 in Automata, Languages and Programming |
Improved Bounds for Flow Shop Scheduling BOOK CHAPTER published 2009 in Automata, Languages and Programming |
Lower Bounds in the Quantum Cell Probe Model BOOK CHAPTER published 2001 in Automata, Languages and Programming |