Searching for "STACS 2001" – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Spectral techniques applied to sparse random graphs. Random Structures and Algorithms
- … of k-SAT formulas that are refuted by the algorithm of Goerdt and Krivelevich from STACS 2001. 1…
- Cited by 19 (4 self) – Add To MetaCart
-
Optimal Preemptive on-Line Scheduling on Uniform Processors With Non-Decreasing Speed Ratios
- … Annual Symposium on Theoretical Aspects of Computer Science (STACS'2001), pages 230-237. y School…
- Cited by 2 (1 self) – Add To MetaCart
-
The Complexity of Minimal Satisfiability Problems
- … on Theoretical Aspects of Computer Science - STACS 2001, volume 2010 of LNCS, pages 407-418, Springer 2001. y…
- Cited by 12 (2 self) – Add To MetaCart
-
The Complexity of Copy Constant Detection in Parallel Programs
- …. Reichel (Eds.): STACS 2001, LNCS 2010, pp. 490--501, 2001. c # Springer-Verlag Berlin Heidelberg 2001…
- Cited by 3 (3 self) – Add To MetaCart
-
Presburger Liveness Verification of Discrete Timed Automata
- … International Symposium on Theoretical Aspects of Computer Science (STACS 2001), Lecture Notes in Computer…
- Cited by 6 (3 self) – Add To MetaCart
-
An Ehrenfeucht-Fraïssé approach to collapse results for first-order queries over embedded databases
- … Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), in the Springer Lecture Notes…
- Add To MetaCart
Showing 1 through 6.
