Conferences in DBLP
Harald Ganzinger Saturation-Based Theorem Proving (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Abhiram G. Ranade Bandwidth Efficient Parallel Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Michel Latteux Variable-Length Maximal Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Jun Chen , Rocco De Nicola Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Jenner , Walter Vogler Fast Asynchronous Systems in Dense Time. [Citation Graph (0, 0)][DBLP ] Conf ] Giacomo Lenzi A Hierarchy Theorem for the µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Julian C. Bradfield , Javier Esparza , Angelika Mader An Effective Tableau System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Yuh-Jzer Joung Characterizing Fairness Implementability for Multiparty Interaction. [Citation Graph (0, 0)][DBLP ] Conf ] Salvador Lucas Termination of Context-Sensitive Rewriting by Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Cheng , Dexter Kozen A Complete Gentzen-Style Axiomatization for Set Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Billaud Fatal Errors in Conditional Expressions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Till Mossakowski Different Types of Arrow Between Logical Frameworks. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Mitchell , Ramesh Viswanathan Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] D. J. B. Bosscher , W. O. David Griffioen Regularity for a Large Class of Context-Free Processes is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Caucal On Infinite Transition Graphs Having a Decidable Monadic Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues Semi-Groups Acting on Context-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid P. Lisovik Hard Sets Method and Semilinear Reservoir Method with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Xavier Gourdon , Daniel Panario Random Polynomials and Polynomial Factorization. [Citation Graph (0, 0)][DBLP ] Conf ] Ulla Koppenhagen , Ernst W. Mayr Optimal Gröbner Base Algorithms for Binomial Ideals. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks , Dieter Kratsch , C. K. Wong Minimum Fill-In on Circle and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , Christos H. Papadimitriou , Mihalis Yannakakis Searching a Fixed Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Mikkel Thorup Improved Sampling with Applications to Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eric Pin The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Roope Kaivola Fixpoints for Rabin Tree Automata Make Complementation Easy. [Citation Graph (0, 0)][DBLP ] Conf ] Kosaburo Hashiguchi New Upper Bounds to the Limitedness of Distance Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Raymond Recognizing Regular Expressions by Means of Dataflow Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev , Marek Karpinski On the Power of Randomized Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Andrea E. F. Clementi , José D. P. Rolim Hitting Sets Derandomize BPP. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Heribert Vollmer , Klaus W. Wagner On Type-2 Probabilistic Quantifiers. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Wiedermann Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results. [Citation Graph (0, 0)][DBLP ] Conf ] Sandrine Julia On \omega-Generators and Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Aldo de Luca On Standard Sturmian Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Ateniese , Carlo Blundo , Alfredo De Santis , Douglas R. Stinson Constructions and Bounds for Visual Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Yair Bartal , Esteban Feuerstein , Amos Fiat , Stefano Leonardi , Adi Rosén On Capital Investment. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Phillip G. Bradford , Knut Reinert Lower Bounds for Row Minima Searching (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep K. Shukla , Harry B. Hunt III , Daniel J. Rosenkrantz , Richard Edwin Stearns On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar , Javier Esparza Deciding Finiteness of Petri Nets Up To Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Chiara Bodei , Pierpaolo Degano , Corrado Priami Mobile Processes with a Distributed Environment. [Citation Graph (0, 0)][DBLP ] Conf ] Rob J. van Glabbeek The Meaning of Negative Premises in Transition System Specifications II. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Michael Mitzenmacher Average Case Analyses of List Update Algorithms, with Applications to Data Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Schulz , Elmar Schömer Self-Organizing Data Structures with Dependent Accesses. [Citation Graph (0, 0)][DBLP ] Conf ] Vicky Siu-Ngan Choi , Mordecai J. Golin Lopsided Trees: Analyses, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach , S. Muthukrishnan Optimal Logarithmic Time Randomized Suffix Tree Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Aravind Srinivasan Improved Parallel Approximation of a Class of Integer Programming Programming Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Claude Bermond , Luisa Gargano , Stephane Perennes , Adele A. Rescigno , Ugo Vaccaro Efficient Collective Communication in Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Anna Gambin , Piotr Indyk Shared-Memory Simulations on a Faulty-Memory DMM. [Citation Graph (0, 0)][DBLP ] Conf ] Kieran T. Herley , Andrea Pietracaprina , Geppino Pucci Fast Deterministic Backtrack Search. [Citation Graph (0, 0)][DBLP ] Conf ] Xiangdong Yu , Moti Yung Agent Rendezvous: A Dynamic Symmetry-Breaking Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Michael A. Bender Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. [Citation Graph (0, 0)][DBLP ] Conf ] Lenore Cowen , Joan Feigenbaum , Sampath Kannan A Formal Framework for Evaluating Heuristic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Soumen Chakrabarti , Cynthia A. Phillips , Andreas S. Schulz , David B. Shmoys , Clifford Stein , Joel Wein Improved Scheduling Algorithms for Minsum Criteria. [Citation Graph (1, 0)][DBLP ] Conf ] Mike Paterson , Teresa M. Przytycka On the Complexity of String Folding. [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca , Jens Lagergren A Polynomial-Time Algorithm for Near-Perfect Phylogeny. [Citation Graph (0, 0)][DBLP ] Conf ] 