Conferences in DBLP
Julien Cassaigne Recurrence in Infinite Words. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:1-11 [Conf ] Martin Grohe Generalized Model-Checking Problems for First-Order Logic. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:12-26 [Conf ] Dexter Kozen Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:27-38 [Conf ] Luca Aceto , Wan Fokkink , Anna Ingólfsdóttir 2-Nested Simulation Is Not Finitely Equationally Axiomatizable. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:39-50 [Conf ] Shin Aida , Rainer Schuler , Tatsuie Tsukiji , Osamu Watanabe On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:51-62 [Conf ] Helmut Alt , Christian Knauer , Carola Wenk Matching Polygonal Curves with Respect to the Fréchet Distance. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:63-74 [Conf ] Andris Ambainis , Arnolds Kikusts , Maris Valdats On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:75-86 [Conf ] Martin Beaudry , François Lemieux , Denis Thérien Star-Free Open Languages and Aperiodic Loops. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:87-98 [Conf ] Markus Bläser A (5/2)n^{2} -Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:99-109 [Conf ] Amit Chakrabarti , Subhash Khot , Yaoyun Shi Evasiveness of Subgraph Containment and Related Properties. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:110-120 [Conf ] Andrea E. F. Clementi , Pierluigi Crescenzi , Paolo Penna , Gianluca Rossi , Paola Vocca On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:121-131 [Conf ] Zhe Dang , Pierluigi San Pietro , Richard A. Kemmerer On Presburger Liveness of Discrete Timed Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:132-143 [Conf ] François Denis , Aurélien Lemay , Alain Terlutte Residual Finite State Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:144-157 [Conf ] Anders Dessmark , Andrzej Pelc Deterministic Radio Broadcasting at Low Cost. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:158-169 [Conf ] Volker Diekert , Claudio Gutiérrez , Christian Hagenah The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:170-182 [Conf ] Benjamin Doerr , Anand Srivastav Recursive Randomized Coloring Beats Fair Dice Random Colorings. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:183-194 [Conf ] Rodney G. Downey , Denis R. Hirschfeldt , André Nies Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:195-205 [Conf ] Pavol Duris , Juraj Hromkovic , Stasys Jukna , Martin Sauerhoff , Georg Schnitger On Multipartition Communication Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:206-217 [Conf ] Robert Elsässer , Rastislav Kralovic , Burkhard Monien Scalable Sparse Topologies with Small Spectrum. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:218-229 [Conf ] Leah Epstein Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:230-237 [Conf ] Cristina G. Fernandes , Till Nierhoff The UPS Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:238-246 [Conf ] Paola Flocchini , Giuseppe Prencipe , Nicola Santoro , Peter Widmayer Gathering of Asynchronous Oblivious Robots with Limited Visibility. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:247-258 [Conf ] Anahí Gajardo , Eric Goles Ch. , Andrés Moreira Generalized Langton's Ant: Dynamical Behavior and Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:259-270 [Conf ] Clemente Galdi , Christos Kaklamanis , Manuela Montangero , Pino Persiano Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:271-282 [Conf ] Ricard Gavaldà , Denis Thérien Learning Expressions over Monoids. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:283-293 [Conf ] Andreas Goerdt , Michael Krivelevich Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:294-304 [Conf ] Massimiliano Goldwurm , Beatrice Palano , Massimo Santini On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:305-316 [Conf ] Torben Hagerup , Torsten Tholey Efficient Minimal Perfect Hashing in Nearly Minimal Space. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:317-326 [Conf ] Prahladh Harsha , Madhu Sudan Small PCPs with Low Query Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:327-338 [Conf ] Andreas Jakoby , Maciej Liskiewicz , Rüdiger Reischuk Space Efficient Algorithms for Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:339-352 [Conf ] David Janin , Jerzy Marcinkowski A Toolkit for First Order Extensions of Monadic Games. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:353-364 [Conf ] Klaus Jansen , Marek Karpinski , Andrzej Lingas , Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:365-375 [Conf ] Matthias Jantzen , Alexy Kurganskyy Refining the Hierarchy of Blind Multicounter Languages. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:376-387 [Conf ] Juhani Karhumäki , Leonid P. Lisovik A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab^{*} c. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:388-395 [Conf ] Jarkko Kari , Cristopher Moore New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:396-406 [Conf ] Lefteris M. Kirousis , Phokion G. Kolaitis The Complexity of Minimal Satisfiability Problems. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:407-418 [Conf ] Matthias Krause , Stefan Lucks On the Minimal Hardware Complexity of Pseudorandom Function Generators. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:419-430 [Conf ] Piotr Krysta , V. S. Anil Kumar Approximation Algorithms for Minimum Size 2-Connectivity Problems. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:431-442 [Conf ] Dietrich Kuske A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:443-454 [Conf ] Clemens Lautemann , Nicole Schweikardt An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:455-466 [Conf ] Giacomo Lenzi A New Logical Characterization of Büchi Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:467-477 [Conf ] Liang Zhao , Hiroshi Nagamochi , Toshihide Ibaraki A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:478-489 [Conf ] Markus Müller-Olm The Complexity of Copy Constant Detection in Parallel Programs. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:490-501 [Conf ] Giri Narasimhan , Michiel H. M. Smid Approximation Algorithms for the Bottleneck Stretch Factor Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:502-513 [Conf ] Dirk Pattinson Semantical Principles in the Modal Logic of Coalgebras. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:514-526 [Conf ] Klaus Reinhardt The #a = #b Pictures Are Recognizable. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:527-538 [Conf ] Victor L. Selivanov A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:539-550 [Conf ] Howard Straubing , Denis Thérien Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:551-562 [Conf ] Philipp Woelfel New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:563-574 [Conf ]