Conferences in DBLP
Robin Milner Graphical Calculi for Interaction (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou NP-Completeness: A Retrospective. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Stefan Näher , Christian Uhrig The LEDA Platform of Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Carton , Dominique Perrin The Wadge-Wagner Hierarchy of omega-Rational Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof R. Apt From Chaotic Iteration to Constraint Propagation. [Citation Graph (0, 0)][DBLP ] Conf ] Laura F. Landweber , Richard J. Lipton DNA²DNA Computations: A Potential "Killer App"? [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Durand Tilings and Quasiperiodicity. [Citation Graph (0, 0)][DBLP ] Conf ] Frédérique Bassino , Marie-Pierre Béal , Dominique Perrin Enumerative Sequences of Leaves in Rational Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère A Completion Algorithm for Codes with Bounded Synchronization Delay. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Wojciech Plandowski , Filippo Mignosi The Expressibility of Languages and Relations by Word Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry , François Lemieux , Denis Thérien Finite Loops Recognize Exactly the Regular Open Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Pietro Di Gianantonio An Abstract Data Type for Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] James I. Lathrop , Jack H. Lutz Recursive Computational Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Bournez Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich , Andrei Voronkov Monadic Simultaneous Rigid E-Unification and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Weihrauch Computability on the Probability Measures on the Borel Sets of the Unit Interval. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Andrea E. F. Clementi , José D. P. Rolim Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Stephen A. Fenner , Lance Fortnow Results on Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Funda Ergün , Peter Gemmell , Ravi Kumar Checking Properties of Polynomials (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra , Jörg Rothe Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP ] Conf ] Kohei Honda , Nobuko Yoshida Game Theoretic Analysis of Call-by-Value Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , Neil Ghani On Modular Properties of Higher Order Extensional Lambda Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Ritter , Valeria de Paiva On Explicit Substitution and Names (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Asperti , Cosimo Laneve On the Dynamics of Sharing Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Jacob Holm , Kristian de Lichtenberg , Mikkel Thorup Minimizing Diameters of Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Oliver Krumke , Madhav V. Marathe , Hartmut Noltemeier , R. Ravi , S. S. Ravi , Ravi Sundaram , Hans-Christoph Wirth Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Dynamic Algorithms for Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Sangiorgi The Name Discipline of Uniform Receptiveness (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Anna Philippou , David Walker On Confluence in the pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Yuxi Fu A Proof Theoretical Approach to Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Yuri Matiyasevich , Anca Muscholl Solving Trace Equations Using Lexicographical Normal Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Wilke Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Bernardo An Algebra-Based Method to Associate Rewards with EMPA Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Ian A. Mason , Carolyn L. Talcott A Semantically Sound Actor Tranlsation. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schwiegelshohn , Lothar Thiele Periodic and Non-periodic Min-Max Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Edson Cáceres , Frank K. H. A. Dehne , Afonso Ferreira , Paola Flocchini , Ingo Rieping , Alessandro Roncato , Nicola Santoro , Siang W. Song Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis Upper Bound on Communication Complexity of Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Eli Singerman Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). [Citation Graph (0, 0)][DBLP ] Conf ] Olaf Burkart , Bernhard Steffen Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Edmund M. Clarke , Vassili Hartonas-Garmhausen , Marta Z. Kwiatkowska , Mark Ryan Symbolic Model Checking for Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] John Michael Robson On the Concentration of the Height of Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Salvador Roura An Improved Master Theorem for Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP ] Conf ] Erik P. de Vink , Jan J. M. M. Rutten Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. [Citation Graph (0, 0)][DBLP ] Conf ] James Riely , Matthew Hennessy Distributed Processes and Location Failures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michele Boreale , Rocco De Nicola , Rosario Pugliese Basic Observables for Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Kaklamanis , Pino Persiano , Thomas Erlebach , Klaus Jansen Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano , Pavol Hell , Stephane Perennes Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Stefano Leonardi On-Line Routing in All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Tamar Eilam , Michele Flammini , Shmuel Zaks A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar Bisimulation Equivalence is Decidable for One-Counter Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani , Peter Habermehl Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Wan Fokkink Axiomatizations for the Perpetual Loop in Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Peter W. Kopke Discrete-Time Control for Rectangular Hybrid Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Valerie King Maintaining Minimum Spanning Trees in Dynamic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Grossi , Giuseppe F. Italiano Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). [Citation Graph (2, 0)][DBLP ] Conf ] Sanjeev Khanna , S. Muthukrishnan , Steven Skiena Efficient Array Partitioning. [Citation Graph (2, 0)][DBLP ] Conf ] Hans L. Bodlaender , Dimitrios M. Thilikos Constructive Linear Time Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP ] Conf ] Paliath Narendran , Friedrich Otto The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. [Citation Graph (0, 0)][DBLP ] Conf ] Zurab Khasidashvili , John R. W. Glauert The Geometry of Orthogonal Reduction Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Marchiori The Theory of Vaccines. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues The Equivalence Problem for Deterministic Pushdown Automata is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste , Paul Gastin On Recognizable and Rational Formal Power Series in Partially Commuting Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Cassaigne On a Conjecture of J. Shallit. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Frankel , Moti Yung On Characterization of Escrow Encryption Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Approximation Results for the Optimum Cost Partition Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Guy Kortsarz The Minimum Color Sum of Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Toshihiro Fujito A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Hajo Broersma , Ton Kloks , Dieter Kratsch , Haiko Müller Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Giacobazzi , Francesco Ranzato Refining and Compressing Abstract Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Dami Labelled Reductions, Runtime Errors and Operational Subsumption. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini , Luciano Margara A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm . [Citation Graph (0, 0)][DBLP ] Conf ] Valentine Kabanets Recognizability Equals Definability for Partial k-Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , Bin Fu Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. [Citation Graph (0, 0)][DBLP ] Conf ] Péter L. Erdös , Mike A. Steel , László A. Székely , Tandy Warnow Constructing Big Trees from Short Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Salvatore Ruggieri Termination of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Francesco Buccafurri , Sergio Greco , Domenico Saccà The Expressive Power of Unique Total Stable Model Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] 