Conferences in DBLP
Marie-Claude Gaudel Structuring and Modularizing Algebraic Specifications: The PLUSS Specification Language, Evolutions and Perspectives. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:3-18 [Conf ] Arvind Gupta , Naomi Nishimura The Parallel Complexity of Tree Embedding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:21-32 [Conf ] Anne Condon A Theory of Strict P-completeness. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:33-44 [Conf ] Torben Hagerup Fast and Optimal Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:45-56 [Conf ] Eric Nassor , Guy Vidal-Naquet Suitability of the Propositional Temporal Logic to Express Properties of Real-Time Systems. [Citation Graph (1, 0)][DBLP ] STACS, 1992, pp:59-70 [Conf ] Michel Billaud Axiomatizations of Backtracking. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:71-82 [Conf ] Roger Villemaire Joining k- and l-Recognizable Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:83-94 [Conf ] Friedhelm Meyer auf der Heide , Hieu Thien Pham On the Performance of Networks with Multiple Busses. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:97-108 [Conf ] Venkatesh Radhakrishnan , Harry B. Hunt III , Richard Edwin Stearns Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:109-119 [Conf ] Lawrence L. Larmore , Wojciech Rytter Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:121-132 [Conf ] Franco P. Preparata , Jeffrey Scott Vitter A Simplified Technique for Hidden-Line Elimination in Terrains. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:135-146 [Conf ] Bala Kalyanasundaram , Kirk Pruhs A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:147-157 [Conf ] Bruno Bogaert , Sophie Tison Equality and Disequality Constraints on Direct Subterms in Tree Automata. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:161-171 [Conf ] Anne Brüggemann-Klein , Derick Wood Deterministic Regular Languages. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:173-184 [Conf ] Ming-Jye Sheu , Timothy J. Long The Extended Low Hierarchy Is an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:187-198 [Conf ] Ulrich Hertrampf Locally Definable Acceptance Types for Polynomial Time Machines. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:199-207 [Conf ] Klaus Ambos-Spies , André Nies The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:209-218 [Conf ] Frank Bartling , Klaus Hinrichs A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:221-232 [Conf ] Jean-Marc Robert , Godfried T. Toussaint Linear Approximation of Simple Objects. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:233-244 [Conf ] Shyam Kapur , Gianfranco Bilardi Language Learning without Overgeneralization. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:245-256 [Conf ] Torben Hagerup The Log-Star Revolution. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:259-278 [Conf ] Carsten Damm , Matthias Krause , Christoph Meinel , Stephan Waack Separating Counting Communication Complexity Classes. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:281-292 [Conf ] Xaver Gubás , Juraj Hromkovic , Juraj Waczulík A Nonlinear Lower Bound on the Practical Combinational Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:293-302 [Conf ] Jorge Castro , Carlos Seara Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:305-317 [Conf ] Ronald V. Book , Jack H. Lutz , Klaus W. Wagner On Complexity Classes and Algorithmically Random Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:319-328 [Conf ] Krzysztof Lorys New Time Hierarchy Results for Deterministic TMs. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:329-336 [Conf ] Birgit Pfitzmann , Michael Waidner Unconditional Byzantine Agreement for any Number of Faulty Processors. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:339-350 [Conf ] Ralf Klasing , Burkhard Monien , Regine Peine , Elena Stöhr Broadcasting in Butterfly and DeBruijn Networks. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:351-362 [Conf ] Claire Diehl , Claude Jard Interval Approximations of Message Causality in Distributed Executions. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:363-374 [Conf ] Viggo Kann On the Approximability of the Maximum Common Subgraph Problem. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:377-388 [Conf ] Walter Unger The Complexity of Colouring Circle Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:389-400 [Conf ] Johannes Köbler , Uwe Schöning , Jacobo Torán Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:401-411 [Conf ] Hans L. Bodlaender , Ton Kloks A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:415-423 [Conf ] Norbert Blum On Locally Optimal Alignments in Genetic Sequences. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:425-436 [Conf ] Rafail Ostrovsky , Ramarathnam Venkatesan , Moti Yung Secure Commitment Against A Powerful Adversary. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:439-448 [Conf ] Alfredo De Santis , Giuseppe Persiano Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:449-460 [Conf ] Kenneth L. Clarkson , Kurt Mehlhorn , Raimund Seidel Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:463-474 [Conf ] Bruno Becker , Paolo Giulio Franciosa , Stephan Gschwind , Thomas Ohler , Gerald Thiemt , Peter Widmayer Enclosing Many Boxes by an Optimal Pair of Boxes. [Citation Graph (2, 0)][DBLP ] STACS, 1992, pp:475-486 [Conf ] Michael Kaufmann , Paul Molitor , Wolfgang Vogelgesang Performance Driven k-Layer Wiring. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:489-500 [Conf ] Bernd Becker Synthesis for Testability: Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:501-512 [Conf ] Georges Hansel , Dominique Perrin , Imre Simon Compression and Entropy. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:515-528 [Conf ] Karel Culik II , Juhani Karhumäki Iterative Devices Generating Infinite Words. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:531-543 [Conf ] Clelia de Felice On the Factorization Conjecture. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:545-556 [Conf ] Thomas Deiß Conditional Seme-Thue Systems for Presenting Monoids. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:557-565 [Conf ] Micha Sharir , Emo Welzl A Combinatorial Bound for Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:569-579 [Conf ] Svante Carlsson , Jyrki Katajainen , Jukka Teuhola In-place Linear Probing Sort. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:581-587 [Conf ] Maxime Crochemore , Thierry Lecroq , Artur Czumaj , Leszek Gasieniec , Stefan Jarominek , Wojciech Plandowski , Wojciech Rytter Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:589-600 [Conf ] Michel Billaud The ANIGRAF System. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:603-604 [Conf ] Jean-Marc Champarnaud A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:605-606 [Conf ] Hélène Collavizza Mu-SPEED: A System for the Specification and Verification of Microprocessors. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:607-608 [Conf ] Miltos D. Grammatikakis , Jung-Sing Jwo A Discrete Event Simulator of Communication Algorithms in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:609-610 [Conf ] Hervé Le Verge Alpha du Centaur: An Environment for the Design of Systolic Arrays. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:611-612 [Conf ] Eric Madelaine , Didier Vergamini Verification of Communicating Processes by Means of Automata Reduction and Abstraction. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:613-614 [Conf ] Paul G. Spirakis , Basil Tampakas , Marina Papatriantafilou , K. Konstantoulis , K. Vlaxodimitropoulos , V. Antonopoulos , P. Kazazis , T. Metallidou , D. Spartiotis Distributed System Simulator (DSS). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:615-616 [Conf ] Huimin Lin An Interactive Proof Tool for Process Algebras. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:617-618 [Conf ] Peter Bachmann , Thomas Drescher , Sabine Nieke SPECI90: A Term Rewriting and Narrowing System. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:619-620 [Conf ]