Conferences in DBLP
Manuel Blum Program Result Checking: A New Approach to Making Programs More Reliable. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Christer Mattsson Dynamic Interpolation Search in o(log log n) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson Searching among Intervals and Compact Routing Tables. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Lund , Mihalis Yannakakis The Approximation of Maximum Subgraph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Viggo Kann Polynomially Bounded Minimization Problems which are Hard to Approximate. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Vijay V. Vazirani , Mihalis Yannakakis Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Madhav V. Marathe , Harry B. Hunt III , S. S. Ravi The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Alan Gibbons Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Constructing Competitive Tours From Local Information. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Ton Kloks , Dieter Kratsch Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy W. Jaromczyk , Grzegorz Swiatek A Theory of Even Functionals and Their Algorithmic Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Mordecai J. Golin Exact Asymptotics of Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen , Shmuel Zaks Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , Stephen R. Tate The Complexity of N-body Simulation. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Dillencourt , Warren D. Smith A Simple Method for Resolving Degeneracies in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemachandra Fault-Tolerance and Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hiroaki Yamamoto Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Pekka Orponen On the Computational Power of Discrete Hopfield Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Rutger Verbeek On Randomized Versus Deterministic Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev Lower Bounds for One-way Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup , Kurt Mehlhorn , J. Ian Munro Maintaining Discrete Probability Distributions Optimally. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew K. Franklin , Moti Yung Secure and Efficient Off-Line Digital Money (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David W. Juedes , James I. Lathrop , Jack H. Lutz Computational Depth and Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ganesh Baliga , John Case Learnability: Admissible, Co-finite, and Hypersimple Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Arto Salomaa , Kai Salomaa , Sheng Yu Inclusion is Undecidable for Pattern Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Tao Jiang , Nicholas Q. Trân , Hui Wang New Decidability Results Concerning Two-way Counter Machines and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Michaux , Roger Villemaire Cobham's Ttheorem seen through Büchi's Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Ebinger , Anca Muscholl Logical Definability on Infinite Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Wilke Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Dalia Malki On Distributed Algorithms in a Broadcast Domain. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Krzysztof Diks , Andrzej Pelc Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Brigitte Oesterdiekhoff , Rolf Wanka Strongly Adaptive Token Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Arnold Schönhage Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic. [Citation Graph (0, 0)][DBLP ] Conf ] Lefteris M. Kirousis Fast Parallel Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] Conf ] Imre Simon The Product of Rational Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Edward Ochmanski , Pierre-André Wacrenier On Regular Compatibility of Semi-Commutations. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Dumas Algebraic Aspects of B-regular Series. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Cohen , Michael L. Fredman Products of Finite State Machines with Full Coverage. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Arto Lepistö On the Power of Periodic Iteration of Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Filippo Mignosi , Patrice Séébold If a D0L Language is k-Power Free then it is Circular. [Citation Graph (0, 0)][DBLP ] Conf ] Lalita Jategaonkar , Albert R. Meyer Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler Timed Testing of Concurrent Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Havelund , Kim Guldstrand Larsen The Fork Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Inverardi , Corrado Priami , Daniel Yankelevich Extended Transition Systems for Parametric Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Carolyn Brown , Doug Gurr Temporal Logic and Categories of Petrie Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Lodaya , P. S. Thiagarajan Decidability of a Partial Order Based Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Hardi Hungar , Bernhard Steffen Local Model Checking for Context-Free Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Abiteboul , Victor Vianu Computing on Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Evelyne Contejean A Partial Solution for D-Unification Based on a Reduction to AC1-Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Codish , Moreno Falaschi , Kim Marriott , William H. Winsborough Efficient Analysis of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , Delia Kesner A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. [Citation Graph (0, 0)][DBLP ] Conf ] Franco Barbanera , Maribel Fernández Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Bracho , Manfred Droste From Domains to Automata with Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] Ramarao Kanneganti , Robert Cartwright What is a Universal Higher-Order Programming Language? [Citation Graph (0, 0)][DBLP ] Conf ] 