The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Philippe Flajolet
    The Ubiquitous Digital Tree. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:1-22 [Conf]
  2. Gene Itkis, Leonid A. Levin
    Flat Holonomies on Automata Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:23-49 [Conf]
  3. Markus Müller-Olm, Michael Petter, Helmut Seidl
    Interprocedurally Analyzing Polynomial Identities. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:50-67 [Conf]
  4. Rolf Fagerberg, Anna Pagh, Rasmus Pagh
    External String Sorting: Faster and Cache-Oblivious. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:68-79 [Conf]
  5. Iwona Bialynicka-Birula, Roberto Grossi
    Amortized Rigidness in Dynamic Cartesian Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:80-91 [Conf]
  6. Ahmed A. Belal, Amr Elmasry
    Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:92-103 [Conf]
  7. Dalia Krieger
    On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:104-114 [Conf]
  8. Manindra Agrawal, Nitin Saxena
    Equivalence of F-Algebras and Cubic Forms. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:115-126 [Conf]
  9. Marie-Pierre Béal, Dominique Perrin
    Complete Codes in a Sofic Shift. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:127-136 [Conf]
  10. Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
    Kolmogorov Complexity with Error. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:137-148 [Conf]
  11. Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
    Kolmogorov Complexity and the Recursion Theorem. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:149-161 [Conf]
  12. Stephanie Wehner
    Entanglement in Interactive Proof Systems with Binary Answers. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:162-171 [Conf]
  13. Andris Ambainis, Robert Spalek
    Quantum Algorithms for Matching and Network Flows. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:172-183 [Conf]
  14. Wojciech Rytter
    The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:184-195 [Conf]
  15. Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
    Estimating Entropy and Entropy Norm on Data Streams. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:196-205 [Conf]
  16. Daniel Golovin, Vineet Goyal, R. Ravi
    Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:206-217 [Conf]
  17. Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
    Exact Price of Anarchy for Polynomial Congestion Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:218-229 [Conf]
  18. Venkatesan T. Chakaravarthy, Sambuddha Roy
    Oblivious Symmetric Alternation. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:230-241 [Conf]
  19. Tzur Sayag, Shai Fine, Yishay Mansour
    Combining Multiple Heuristics. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:242-253 [Conf]
  20. Khaled M. Elbassioni, Nabil H. Mustafa
    Conflict-Free Colorings of Rectangles Ranges. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:254-263 [Conf]
  21. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Grid Vertex-Unfolding Orthogonal Polyhedra. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:264-276 [Conf]
  22. Bin Fu
    Theory and Application of Width Bounded Geometric Separator. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:277-288 [Conf]
  23. Vince Bárány
    Invariants of Automatic Presentations and Semi-synchronous Transductions. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:289-300 [Conf]
  24. Olivier Finkel
    On the Accepting Power of 2-Tape Büchi Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:301-312 [Conf]
  25. Ina Mäurer
    Weighted Picture Automata and Weighted Logics. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:313-324 [Conf]
  26. Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
    Markov Decision Processes with Multiple Objectives. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:325-336 [Conf]
  27. Paolo Penna, Carmine Ventre
    The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:337-348 [Conf]
  28. George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
    Convergence and Approximation in Potential Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:349-360 [Conf]
  29. Josep Díaz, Dimitrios M. Thilikos
    Fast FPT-Algorithms for Cleaning Grids. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:361-371 [Conf]
  30. Chinmoy Dutta, Jaikumar Radhakrishnan
    Tradeoffs in Depth-Two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:372-383 [Conf]
  31. Vikraman Arvind, Johannes Köbler
    On Hypergraph and Graph Isomorphism with Bounded Color Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:384-395 [Conf]
  32. Andrey Yu. Rumyantsev, M. A. Ushakov
    Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:396-407 [Conf]
  33. John M. Hitchcock
    Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:408-419 [Conf]
  34. Vince Bárány, Christof Löding, Olivier Serre
    Regularity Problems for Visibly Pushdown Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:420-431 [Conf]
  35. Georg Schnitger
    Regular Expressions and NFAs Without epsilon-Transitions. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:432-443 [Conf]
  36. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Redundancy in Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:444-454 [Conf]
  37. Harry Buhrman, Leen Torenvliet, Falk Unger
    Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:455-468 [Conf]
  38. Lance Fortnow, Adam R. Klivans
    Linear Advice for Randomized Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:469-476 [Conf]
  39. Joost Engelfriet, Hendrik Jan Hoogeboom
    Nested Pebbles and Transitive Closure. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:477-488 [Conf]
  40. Amitabha Roy, Howard Straubing
    Definability of Languages by Generalized First-Order Formulas over (N, +). [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:489-499 [Conf]
  41. Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
    Generalized Modal Satisfiability. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:500-511 [Conf]
  42. Krishnendu Chatterjee, Thomas A. Henzinger
    Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:512-523 [Conf]
  43. Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
    DAG-Width and Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:524-536 [Conf]
  44. Andrei E. Romashchenko
    Reliable Computations Based on Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:537-548 [Conf]
  45. Reuven Cohen, David Peleg
    Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:549-560 [Conf]
  46. Daniel Mölle, Stefan Richter, Peter Rossmanith
    A Faster Algorithm for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:561-570 [Conf]
  47. Benjamin Doerr
    Generating Randomized Roundings with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:571-583 [Conf]
  48. Rohit Khandekar, Vinayaka Pandit
    Online Sorting Buffers on Line. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:584-595 [Conf]
  49. Yossi Azar, Yoel Chaiutin
    Optimal Node Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:596-607 [Conf]
  50. Dimitris Fotakis
    Memoryless Facility Location in One Pass. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:608-620 [Conf]
  51. Susanne Albers, Hiroshi Fujiwara
    Energy-Efficient Algorithms for Flow Time Minimization. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:621-633 [Conf]
  52. Kousha Etessami, Mihalis Yannakakis
    Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:634-645 [Conf]
  53. Manuel Bodirsky, Víctor Dalmau
    Datalog and Constraint Satisfaction with Infinite Templates. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:646-659 [Conf]
  54. Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma
    Evaluating Monotone Circuits on Cylinders, Planes and Tori. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:660-671 [Conf]
  55. Alexander Healy, Emanuele Viola
    Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:672-683 [Conf]
  56. Dietrich Kuske
    Weighted Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:684-695 [Conf]
  57. Darin Goldstein, Kojiro Kobayashi
    On the Complexity of the "Most General" Firing Squad Synchronization Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:696-711 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002