Conferences in DBLP
Richard M. Karp Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jeannette Janssen , Danny Krizanc , Lata Narayanan , Sunil M. Shende Distributed Online Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Floats, Integers, and Single Source Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Habib , Christophe Paul , Laurent Viennot A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Julian C. Bradfield Simplifying the Modal Mu-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Eiter , Toshihide Ibaraki , Kazuhisa Makino On Disguised Double Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Demri , Ph. Schnoebelen The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David A. Mix Barrington , Chi-Jen Lu , Peter Bro Miltersen , Sven Skyum Searching Constant Width Mazes Captures the AC0 Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Sophie Laplante Nearly Optimal Language Compression Using Extractors. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Spencer , Katherine St. John Random Sparse Bit Strings at the Threshold of Adjacency. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Sauerhoff Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Mazoyer , Ivan Rapaport Inducing an Order on Cellular Automata by a Grouping Operation. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini , Luciano Margara Attractors of D-dimensional Linear Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Carlo Mereghetti , Giovanni Pighizzini Optimal Simulations Between Unary Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandru Mateescu Shuffle of omega-Words: Algebraic Aspects (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Dieter van Melkebeek , Kenneth W. Regan , D. Sivakumar , Martin Strauss A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Richard Beigel , Antoni Lozano The Complexity of Modular Graph Automorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Libkin , Limsoon Wong Unary Quantifiers, Transitive Closure, and Relations of Large Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bürgisser On the Structure of Valiant's Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Detlef Sieling On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Sampath Kannan , Moshe Y. Vardi , Mahesh Viswanathan Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Jan Behrens , Stephan Waack Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Clemens Gröpl , Hans Jürgen Prömel , Anand Srivastav Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Serge Vaudenay Provable Security for Block Ciphers by Decorrelation. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina Bazgan , Miklos Santha , Zsolt Tuza On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Lynn Burroughs Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kim S. Larsen Partially Persistent Search Trees with Transcript Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Damian Niwinski , Igor Walukiewicz Relating Hierarchies of Word and Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Howard Straubing Languages Defined With Modular Counting Quantifiers (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Jantzen Hierarchies of Principal Twist-Closed Trios. [Citation Graph (0, 0)][DBLP ] Conf ] Taoufik Safer Radix Representations of Algebraic Number Fields and Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Sorting and Searching on the Word RAM. [Citation Graph (0, 0)][DBLP ] Conf ] Mohamadou Diallo , Afonso Ferreira , Andrew Rau-Chaplin Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. [Citation Graph (0, 0)][DBLP ] Conf ] Christine Rüb On Batcher's Merge Sorts as Parallel Sorting Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Gustedt Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Dessmark , Andrzej Lingas , Hans Olsson , Hiroaki Yamamoto Optimal Broadcasting in Almost Trees and Partial k-trees. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick , Klaus Barthelmann Local Normal Forms for First-Order Logic with Applications to Games and Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Ésik Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). [Citation Graph (0, 0)][DBLP ] Conf ] Angelo Monti , Adriano Peron A Logical Characterization of Systolic Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Meßner , Jacobo Torán Optimal Proof Systems for Propositional Logic and Complete Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Maria J. Serna , Luca Trevisan , Fatos Xhafa The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Ivanov , Michel de Rougemont Interactive Protocols on the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Kouichi Sakurai , Moti Yung Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio De Agostino , Riccardo Silvestri Bounded Size Dictionary Compression: SCk -Completeness and NC Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Raphaël Meyer , Antoine Petit Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. [Citation Graph (0, 0)][DBLP ] Conf ] Anna E. Frid On Uniform DOL Words. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Lodaya , Pascal Weil Series-Parallel Posets: Algebra, Automata and Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer Kemp On the Expected Number of Nodes at Level k in 0-balanced Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Charles Golumbic , Haim Kaplan Cell Flipping in Permutation Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Marius Dorkenoo , Marie-Christine Eglin-Leclerc , Eric Rémila Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure. [Citation Graph (0, 0)][DBLP ] Conf ] Cristian Calude , Peter Hertling , Bakhadyr Khoussainov , Yongge Wang Recursively Enumerable Reals and Chaitin Omega Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Kosub , Heinz Schmitz , Heribert Vollmer Uniformly Defining Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Lapoire Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] Conf ] 