The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Bernhard Steffen
    Unifying Models. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:1-20 [Conf]
  2. Gerth Stølting Brodal
    Predecessor Queries in Dynamic Integer Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:21-32 [Conf]
  3. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:33-46 [Conf]
  4. Robert Koch, Norbert Blum
    Greibach Normal Form Transformation, Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:47-54 [Conf]
  5. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:55-66 [Conf]
  6. Christophe Fiorio, Jens Gustedt
    Memory Management for Union-Find Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:67-79 [Conf]
  7. Matthias Schröder
    Fast Online Multiplication of Real Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:81-92 [Conf]
  8. Harald Hempel, Gerd Wechsung
    The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:93-104 [Conf]
  9. Harry Buhrman, Lance Fortnow
    Resource-Bounded Kolmogorov Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:105-116 [Conf]
  10. Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
    Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:117-128 [Conf]
  11. Maciej Liskiewicz
    Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:129-140 [Conf]
  12. Claudia Bertram-Kretzberg, Hanno Lefmann
    MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:141-152 [Conf]
  13. Luca de Alfaro, Arjun Kapur, Zohar Manna
    Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:153-164 [Conf]
  14. Luca de Alfaro
    Temporal Logics for the Specification of Performance and Reliability. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:165-176 [Conf]
  15. Carsten Weise, Dirk Lenzkes
    Efficient Scaling-Invariant Checking of Timed Bisimulation. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:177-188 [Conf]
  16. Martin Dietzfelbinger
    Gossiping and Broadcasting versus Computing Functions in Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:189-200 [Conf]
  17. Stephan Waack
    On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:201-212 [Conf]
  18. Christoph Meinel, Anna Slobodová
    A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:213-224 [Conf]
  19. John Case, Efim B. Kinber, Arun Sharma, Frank Stephan
    On the Classification of Computable Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:225-236 [Conf]
  20. Gabriele Kern-Isberner
    A Conditional-Logical Approach to Minimum Cross-Entropy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:237-248 [Conf]
  21. Erich Grädel, Martin Otto, Eric Rosen
    Undecidability Results on Two-Variable Logics. [Citation Graph (1, 0)][DBLP]
    STACS, 1997, pp:249-260 [Conf]
  22. Stephane Gaubert, Max Plus
    Methods and Applications of (MAX, +) Linear Algebra. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:261-282 [Conf]
  23. Oliver Matz
    Regular Expressions and Context-Free Grammars for Picture Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:283-294 [Conf]
  24. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    Measuring Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:295-306 [Conf]
  25. Arfst Nickelsen
    On Polynomially D-Verbose Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:307-318 [Conf]
  26. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Translation in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:319-328 [Conf]
  27. Klaus Reinhardt
    Strict Sequential P-completeness. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:329-338 [Conf]
  28. Klaus-Jörn Lange
    An Unambiguous Class Possessing a Complete Set. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:339-350 [Conf]
  29. Michele Flammini
    Deadlock-Free Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:351-362 [Conf]
  30. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power Consumption in Packet Radio Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:363-374 [Conf]
  31. Christoph Karg, Johannes Köbler, Rainer Schuler
    The Complexity of Generating Test Instances. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:375-386 [Conf]
  32. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Efficient Construction of Hitting Sets for Systems of Linear Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:387-398 [Conf]
  33. Ingrid Biehl, Bernd Meyer
    Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:399-412 [Conf]
  34. Ugo Montanari, Marco Pistore
    Minimal Transition Systems for History-Preserving Bisimulation. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:413-425 [Conf]
  35. Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara
    On Ergodic Linear Cellular Automata over Zm. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:427-438 [Conf]
  36. Jérôme Olivier Durand-Lose
    Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:439-450 [Conf]
  37. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
    The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:451-462 [Conf]
  38. Thomas Schwentick
    Algebraic and Logical Characterizations of Deterministic Linear Time Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:463-474 [Conf]
  39. Eric Ruppert
    Finding the k Shortest Paths in Parallel. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:475-486 [Conf]
  40. Elias Dahlhaus
    Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:487-498 [Conf]
  41. Erich Prisner
    Distance Approximating Spanning Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:499-510 [Conf]
  42. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke
    A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:511-522 [Conf]
  43. Joan Feigenbaum, Martin Strauss
    An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:523-534 [Conf]
  44. Josef M. Breutzmann, Jack H. Lutz
    Equivalence of Measures of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:535-545 [Conf]
  45. Vincenzo Auletta, Domenico Parente
    Better Algorithms for Minimum Weight Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:547-558 [Conf]
  46. Hans Jürgen Prömel, Angelika Steger
    RNC-Approximation Algorithms for the Steiner Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:559-570 [Conf]
  47. Jochen Meßner
    Pattern Matching in Trace Monoids (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:571-582 [Conf]
  48. Volker Diekert, Paul Gastin, Antoine Petit
    Removing epsilon-Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:583-594 [Conf]
  49. Oded Goldreich
    Probabilistic Proof Systems - A Survey. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:595-611 [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