Conferences in DBLP
Gilles Brassard New Trends in Quantum Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Luc Longpré Compressibility and Resource Bounded Measure. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kummer On the Complexity of Random Strings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Tero Harju , Juhani Karhumäki , Daniel Krob Remarks on Generalized Post Correspondence Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Olivier Carton , Christophe Reutenauer Cyclic Languages and Strongly Cyclic Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies , Elvira Mayordomo , Yongge Wang , Xizhong Zheng Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Thomas Thierauf The Complexity of Generating and Checking Proffs of Membership. [Citation Graph (0, 0)][DBLP ] Conf ] Jack H. Lutz Observations on Measure and Lowness for Delta^P_2. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , N. V. Vinodchandran Solvable Black-Box Group Problems Are Low for PP. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry Languages Recognized by Finite Aperiodic Groupoids. [Citation Graph (0, 0)][DBLP ] Conf ] Frédérique Bassino Star-Height of an N-Rational Series. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Jarkko Kari An Aperiodic Set of Wang Cubes. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Melançon Lyndon Factorization of Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Heun , Ernst W. Mayr Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Morvan , Laurent Viennot Parallel Comparability Graph Recognition and Modular Decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Berenbrink , Friedhelm Meyer auf der Heide , Volker Stemann Fault-Tolerant Shared Memory Simulations. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk On Word-Level Parallelism in Fault-Tolerant Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Janis Barzdins , Rusins Freivalds , Carl H. Smith Learning with Confidence. [Citation Graph (0, 0)][DBLP ] Conf ] Erika Tateishi , Osamu Maruyama , Satoru Miyano Extracting Best Consensus Motifs from Positive and Negative Examples. [Citation Graph (0, 0)][DBLP ] Conf ] François Denis , Cyrille D'Halluin , Rémi Gilleron PAC Learning with Simple Examples. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Rusins Freivalds , Carl H. Smith General Inductive Inference Types Based on Linearly-Ordered Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Béatrice Bérard , Paul Gastin , Antoine Petit On the Power of Non-Observable Actions in Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Bertol , Volker Diekert Trace Rewriting: Computing Normal Forms in Time O(n log n). [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Dürr , Huong Lê Thanh , Miklos Santha A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Jakoby , Christian Schindelhauer On the Complexity of Worst Case and Expected Time in a Circuit. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Ashish V. Naik , D. Sivakumar On the Existence of Hard Sparse Sets under Weak Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Andrea E. F. Clementi , José D. P. Rolim Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Alan L. Selman Fine Separation of Average Time Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Sifakis , Sergio Yovine Compositional Specification of Timed Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Bleichenbacher , Ueli M. Maurer Optimal Tree-Based One-Time Digital Signature Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman , Antoine Joux , Yuval Roichman , Jacques Stern , Jean-Pierre Tillich The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Ueli M. Maurer A Unified and Generalized Treatment of Authentification Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Walukiewicz Monadic Second Order Logic on Tree-Like Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick On Bijections vs. Unary Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Marcinkowski The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister , Hanno Lefmann A Combinatorial Design Approach to MAXCUT. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Naomi Nishimura Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Scott A. Mitchell A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume. [Citation Graph (0, 0)][DBLP ] Conf ] Julian C. Bradfield On the Expressivity of the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Beate Bollig , Ingo Wegener Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Giacobazzi "Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Schmitt Flip-Flop Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc Lower Bounds for Compact Routing (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christiane Frougny On the Successor Function in Non-Classical Numeration Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Filippo Mignosi , Antonio Restivo Minimal Forbidden Words and Symbolic Dynamics. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Kelsen Ranking and Unranking Trees Using Regular Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Dany Breslauer On Competitive On-Line Paging with Lookahead. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Lagergren Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel , Stephan Waack The "log Rank" Conjecture for Modular Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis Upper Bounds on Multiparty Communication Complexity of Shifts. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm , Stasys Jukna , Jiri Sgall Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP ] Conf ] Evripidis Bampis , Charles Delorme , Jean-Claude König Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner , Emo Welzl Linear Programming - Randomization and Abstract Frameworks. [Citation Graph (0, 0)][DBLP ] Conf ] 