Conferences in DBLP
Eric Allender Characterizations on PUNC and Precomputation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Didier Arquès , Jean Françon , M. T. Guichet , P. Guichet Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Aurenhammer A New Duality Result Concerning Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Amir Averbuch , Shmuel Winograd , Zvi Galil Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Pekka Orponen , David A. Russo , Osamu Watanabe On Exponential Lowness. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Faith E. Fich , Friedhelm Meyer auf der Heide , Eli Upfal , Avi Wigderson A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Franz-Josef Brandenburg Intersections of Some Families of Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Janusz A. Brzozowski , Carl-Johan H. Seger Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary). [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut , Marcel Paul Schützenberger Counting with Rational Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Clelia de Felice Finite Biprefix Sets of Path in a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick W. Dymond , Walter L. Ruzzo Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Fribourg A Strong Restriction of the Inductive Completion Procedure. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Goralcik , Václav Koubek On Discerning Words by Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Lane A. Hemachandra Complexity Classes Without Machines: On Complete Languages for UP. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Ming Li , Yaacov Yesha Containment, Separation, Complete Sets, and Immunity of Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Miki Hermann , Igor Prívara On Nontermination of Knuth-Bendix Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic Tradeoffs for Language Recognition on Parallel Computing Models. [Citation Graph (0, 0)][DBLP ] Conf ] J. Howard Johnson Rational Equivalence Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Kirschenhofer , Helmut Prodinger Some Further Results on Digital Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sarit Kraus , Daniel J. Lehmann Knowledge, Belief and Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ten-Hwang Lai A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Jörn Lange Decompositions of Nondeterministic Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer Hierarchical Planary Testing Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Björn Lisper Synthesis and Equivalence of Concurrent Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Heikki Mannila , Esko Ukkonen The Set Union Problem with Backtracking. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Paul Mascle Torsion Matrix Semigroups and Recognizable Transductions. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Métivier On Recognizable Subsets of Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien , Ivan Hal Sudborough Min Cut is NP-Complete for Edge Weigthed Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David E. Muller , Ahmed Saoudi , Paul E. Schupp Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Th. Müller Subpolynomial Complexity Classes of Real Functions and Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Pécuchet Etude Syntaxique des Parties Reconnaissables de Mots Infinis. [Citation Graph (0, 0)][DBLP ] Conf ] Iain Phillips Refusal Testing. [Citation Graph (0, 0)][DBLP ] Conf ] George M. Reed , A. W. Roscoe A Timed Model for Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth W. Regan A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. [Citation Graph (0, 0)][DBLP ] Conf ] Louis E. Rosier , Hsu-Chun Yen On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Shavit , Nissim Francez A New Approach to Detection of Locally Indicative Stability. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schöning Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Simon An Improved Algorithm for Transitive Closure on Acyclic Digraphs. [Citation Graph (1, 0)][DBLP ] Conf ] Jean-Claude Spehner Un Algorithme Determinant les Melanges de Deux Mots. [Citation Graph (0, 0)][DBLP ] Conf ] Paul G. Spirakis , Athanasios K. Tsakalidis A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Stirling A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. [Citation Graph (0, 0)][DBLP ] Conf ] Howard Straubing Semigroups and Languages of Dot-Depth 2. [Citation Graph (0, 0)][DBLP ] Conf ] Peter J. Varman , Kshitij Doshi A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus W. Wagner More Complicated Questions About Maxima and Minima, and Some Closures of NP. [Citation Graph (0, 0)][DBLP ] Conf ] Dan E. Willard Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jia-Huai You , P. A. Subrahmanyam E-Unification Algorithms for a Class of Confluent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Damian Niwinski On Fixed-Point Clones (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] 