Conferences in DBLP
Flemming Nielson Abstract Interpretation of Denotational Definions (A Survey). [Citation Graph (0, 0)][DBLP ] Conf ] E. Allen Emerson , Chin-Laung Lei Temporal Reasoning Under Generalized Fairness Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Caucal Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. [Citation Graph (0, 0)][DBLP ] Conf ] David de Frutos-Escrig Some Probabilistic Powerdomains in the Category SFP. [Citation Graph (0, 0)][DBLP ] Conf ] M. A. Nait Abdallah Icons and Local Definitions in Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Paul G. Spirakis Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. [Citation Graph (0, 0)][DBLP ] Conf ] Emile H. L. Aarts , F. M. J. de Bont , J. H. A. Habers , Peter J. M. van Laarhoven A Parallel Statistical Cooling Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Bettina Helfrich , J. C. Lagarias , Claus-Peter Schnorr Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Jan van Leeuwen New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Tamassia , Ioannis G. Tollis Algorithms for Visibility Representations of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide Speeding up Random Access Machines by Few Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Bala Ravikumar On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Pécuchet Variétés de Semis Groupes et Mots Infinis. [Citation Graph (0, 0)][DBLP ] Conf ] Christine Duboc Equations in Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Darondeau Separating and Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut , Marcel Paul Schützenberger Décomposition de Fonctions Rationnelles. [Citation Graph (0, 0)][DBLP ] Conf ] Ursula Schmidt Long Unavoidable Patterns. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Bernot , Michel Bidoit , Christine Choppy Abstract Implementations and Correctness Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Udo Kelter Strictness and Serializability. [Citation Graph (1, 0)][DBLP ] Conf ] B. Gamatie Towards Specification and Proof of Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , Richard Edwin Stearns Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). [Citation Graph (0, 0)][DBLP ] Conf ] Chandra M. R. Kintala , Detlef Wotschke Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Louis E. Rosier , Hsu-Chun Yen Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Lane A. Hemachandra On Sparse Oracles Separating Feasible Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] José L. Balcázar , Ronald V. Book On Generalized Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Franco P. Preparata Area-time Optimal Division for T=Omega(log n)1+epsilon [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Faith E. Fich , Friedhelm Meyer auf der Heide , Eli Upfal , Avi Wigderson A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP ] Conf ] Rüdiger Reischuk Parallel Machines and their Communication Theoretical Limits. [Citation Graph (0, 0)][DBLP ] Conf ] 