The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Symposium on Theoretical Aspects of Computer Science (STACS) (stacs)
2000 (conf/stacs/2000)

  1. Mohammad Amin Shokrollahi
    Codes and Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:1-12 [Conf]
  2. Thomas A. Henzinger, Rupak Majumdar
    A Classification of Symbolic Transition Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:13-34 [Conf]
  3. Pascal Koiran
    Circuits versus Trees in Algebraic Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:35-52 [Conf]
  4. Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
    On the Many Faces of Block Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:53-64 [Conf]
  5. Edward A. Hirsch
    A New Algorithm for MAX-2-SAT. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:65-73 [Conf]
  6. Jack H. Lutz, Martin Strauss
    Bias Invariance of Small Upper Spans. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:74-86 [Conf]
  7. Eric Allender, Meena Mahajan
    The Complexity of Planarity Testing. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:87-98 [Conf]
  8. Gwénaël Richomme, Francis Wlazinski
    About Cube-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:99-109 [Conf]
  9. Jarkko Kari
    Linear Cellular Automata with Multiple State Variables. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:110-121 [Conf]
  10. Lucian Ilie, Wojciech Plandowski
    Two-Variable Word Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:122-132 [Conf]
  11. Andris Ambainis, Ronald de Wolf
    Average-Case Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:133-144 [Conf]
  12. Juraj Hromkovic, Martin Sauerhoff
    Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:145-156 [Conf]
  13. Sven Kosub, Klaus W. Wagner
    The Boolean Hierarchy of NP-Partitions. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:157-168 [Conf]
  14. Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
    Binary Exponential Backoff Is Stable for High Arrival Rates. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:169-180 [Conf]
  15. Nicolas Schabanel
    The Data Broadcast Problem with Preemption. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:181-192 [Conf]
  16. Jessica H. Fong, Martin Strauss
    An Approximate Lp-Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:193-204 [Conf]
  17. Paolo Penna
    Succinct Representations of Model Based Belief Revision. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:205-216 [Conf]
  18. Leonid Libkin
    Logics Capturing Local Properties. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:217-229 [Conf]
  19. Edith Hemaspaandra
    The Complexity of Poor Man's Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:230-242 [Conf]
  20. Yijie Han
    Fast Integer Sorting in Linear Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:242-253 [Conf]
  21. Stefan Edelkamp, Ingo Wegener
    On the Performance of WEAK-HEAPSORT. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:254-266 [Conf]
  22. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
    On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:267-278 [Conf]
  23. Catalin Dima
    Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:279-289 [Conf]
  24. Marcin Jurdzinski
    Small Progress Measures for Solving Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:290-301 [Conf]
  25. Frédéric Magniez
    Multi-linearity Self-Testing with Relative Error. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:302-313 [Conf]
  26. Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
    Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:314-323 [Conf]
  27. Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
    Hard Instances of Hard Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:324-333 [Conf]
  28. Petr Jancar, Antonín Kucera, Faron Moller
    Simulation and Bisimulation over One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:334-345 [Conf]
  29. Alain Finkel, Grégoire Sutre
    Decidability of Reachability Problems for Classes of Two Counters Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:346-357 [Conf]
  30. Marcin Jurdzinski, Mogens Nielsen
    Hereditary History Preserving Bisimilarity Is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:358-369 [Conf]
  31. Michael Elkin, David Peleg
    The Hardness of Approximating Spanner Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:370-381 [Conf]
  32. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  33. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
    lambda-Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:395-406 [Conf]
  34. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
    Optimal Proof Systems and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:407-418 [Conf]
  35. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
    Almost Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:419-430 [Conf]
  36. Vikraman Arvind, Johannes Köbler
    Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:431-442 [Conf]
  37. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:443-454 [Conf]
  38. Klaus Jansen, Maxim Sviridenko
    Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:455-465 [Conf]
  39. Ulf Lorenz
    Controlled Conspiracy-2 Search. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:466-478 [Conf]
  40. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
    The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:479-490 [Conf]
  41. Julien Cervelle, Bruno Durand
    Tilings: Recursivity and Regularity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:491-502 [Conf]
  42. Vincent Bouchitté, Ioan Todinca
    Listing All Potential Maximal Cliques of a Graph. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:503-515 [Conf]
  43. Michal Katz, Nir A. Katz, David Peleg
    Distance Labeling Schemes for Well-Separated Graph Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:516-528 [Conf]
  44. Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry
    Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:529-541 [Conf]
  45. Joost Engelfriet, Sebastian Maneth
    Characterizing and Deciding MSO-Definability of Macro Tree Transductions. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:542-554 [Conf]
  46. Christian Glaßer, Heinz Schmitz
    Languages of Dot-Depth 3/2. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:555-566 [Conf]
  47. Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
    Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:567-580 [Conf]
  48. Elias Koutsoupias, David Scot Taylor
    The CNN Problem and Other k-Server Variants. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:581-592 [Conf]
  49. Marek Chrobak, Jiri Sgall
    The Weighted 2-Server Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:593-604 [Conf]
  50. Yair Bartal, Elias Koutsoupias
    On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:605-613 [Conf]
  51. Mikael Goldmann, Alexander Russell
    Spectral Bounds on General Hard Core Predicates. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:614-625 [Conf]
  52. Annalisa De Bonis, Alfredo De Santis
    Randomness in Visual Cryptography. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:626-638 [Conf]
  53. Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau
    Online Dial-a-Ride Problems: Minimizing the Completion Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:639-650 [Conf]
  54. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
    The Power Range Assignment Problem in Radio Networks on the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:651-660 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002