Conferences in DBLP
Vincent Cremet , François Garillot , Sergueï Lenglet , Martin Odersky A Core Calculus for Scala Type Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , David Ilcinkas , Andrzej Pelc Tree Exploration with an Oracle. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Gavoille Distributed Data Structures: A Survey on Informative Labeling Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Herman Geuvers , Iris Loeb From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe The Structure of Tractable Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen On the Representation of Kleene Algebras with Tests. [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li From Three Ideas in TCS to Three Applications in Bioinformatics. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Clemens Huemer , S. Kappes , Bettina Speckmann , Csaba D. Tóth Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Lyudmil Aleksandrov , Hristo Djidjev , Hua Guo , Anil Maheshwari , Doron Nussbaum , Jörg-Rüdiger Sack Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Allauzen , Mehryar Mohri A Unified Construction of the Glushkov, Follow, and Antimirov Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pablo Arrighi Algebraic Characterizations of Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Piyush P. Kurur A Polynomial Time Nilpotence Test for Galois Groups and Related Results. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , William I. Gasarch , James Glenn The Multiparty Communication Complexity of Exact-T : Improved Bounds and New Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel , Alessandra Savelli Crochemore Factorization of Sturmian and Other Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Francine Blanchet-Sadri , D. Dakota Blair , Rebeca V. Lewis Equations on Partial Words. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Boyar , René Peralta Concrete Multiplicative Complexity of Symmetric Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Boyer , Victor Poupet , Guillaume Theyssier On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Jürgen Lerner Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. [Citation Graph (0, 0)][DBLP ] Conf ] Arnaud Carayol , Didier Caucal The Kleene Equality for Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Arturo Carpi On the Repetition Threshold for Large Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Iyad A. Kanj , Ge Xia Improved Parameterized Upper Bounds for Vertex Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Qi Cheng On Comparing Sums of Square Roots of Small Integers. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandra Cherubini , P. Gawrychowski , Andrzej Kisielewicz , B. Piochi A Combinatorial Approach to Collapsing Words. [Citation Graph (0, 0)][DBLP ] Conf ] Johanne Cohen , Fedor V. Fomin , Pinar Heggernes , Dieter Kratsch , Gregory Kucherov Optimal Linear Arrangement of Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sorin Constantinescu , Lucian Ilie The Lempel-Ziv Complexity of Fixed Points of Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Markus Lohrey , Alexander Miller Partially Commutative Inverse Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Dojer Learning Bayesian Networks Does Not Have to Be NP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Domaratzki , Kai Salomaa Lower Bounds for the Transition Complexity of NFAs. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Dynia , Jaroslaw Kutylowski , Friedhelm Meyer auf der Heide , Christian Schindelhauer Smart Robot Teams Exploring Sparse Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Wael El Oraiby , Dominique Schmitt k -Sets of Convex Inclusion Chains of Planar Point Sets.Citation Graph (0, 0)][DBLP ] Conf ] Robert Elsässer Toward the Eigenvalue Power Law. [Citation Graph (0, 0)][DBLP ] Conf ] Angelo Fanelli , Michele Flammini , Giovanna Melideo , Luca Moscardelli Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Mitsunori Ogihara Very Sparse Leaf Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Gál , Vladimir Trifonov On the Correlation Between Parity and Modular Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano , Adele A. Rescigno Optimally Fast Data Gathering in Sensor Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Magic Numbers in the State Hierarchy of Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Beat Gfeller , Leon Peeters , Birgitta Weber , Peter Widmayer Online Single Machine Batch Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Glaßer , Stephen D. Travers Machines that Can Output Empty Words. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Goncharov , Lutz Schröder , Till Mossakowski Completeness of Global Evaluation Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Andre Gronemeier NOF-Multiparty Information Complexity Bounds for Pointer Jumping. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaoyang Gu , Jack H. Lutz Dimension Characterizations of Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Jérôme Monnot , Danny Segev Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Yoram Hirshfeld , Alexander Moshe Rabinovich An Expressive Temporal Logic for Real Time. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Hlinený On Matroid Representability and Minor Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hoefer Non-cooperative Tree Creation. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher M. Homan , Lane A. Hemaspaandra Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Hiroki Morizumi Reductions for Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Jonsson , Gustav Nordh Generalised Integer Programming Based on Logically Defined Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Jurdzinski Probabilistic Length-Reducing Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Kik Sorting Long Sequences in a Single Hop Radio Network. [Citation Graph (0, 0)][DBLP ] Conf ] Ondrej Klíma , Benoit Larose , Pascal Tesson Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran , Sylvain Perifel Valiant's Model: From Exponential Sums to Exponential Products. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Kostin A Reachability Algorithm for General Petri Nets Based on Transition Invariants. [Citation Graph (0, 0)][DBLP ] Conf ] Fredrik Kuivinen Approximability of Bounded Occurrence Max Ones. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kutrib , Andreas Malcher Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. [Citation Graph (0, 0)][DBLP ] Conf ] Slawomir Lasota , Wojciech Rytter Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP ] Conf ] François Le Gall Quantum Weakly Nondeterministic Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Rodrigo S. C. Leão , Valmir C. Barbosa Minimal Chordal Sense of Direction and Circulant Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yury Lifshits , Markus Lohrey Querying and Embedding Compressed Texts. [Citation Graph (0, 0)][DBLP ] Conf ] María López-Valdés Lempel-Ziv Dimension for Lempel-Ziv Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Malod , Natacha Portier Characterizing Valiant's Algebraic Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Marios Mavronicolas , Loizos Michael , Vicky G. Papadopoulou , Anna Philippou , Paul G. Spirakis The Price of Defense. [Citation Graph (0, 0)][DBLP ] Conf ] Linh Anh Nguyen The Data Complexity of MDatalog in Basic Modal Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Aris Pagourtzis , Stathis Zachos The Complexity of Counting Functions with Easy Decision Version. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Persiano , Ivan Visconti On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model. [Citation Graph (0, 0)][DBLP ] Conf ] Sasanka Roy , Arindam Karmakar , Sandip Das , Subhas C. Nandy Constrained Minimum Enclosing Circle with Center on a Query Line Segment. [Citation Graph (0, 0)][DBLP ] Conf ] Holger Spakowski , Rahul Tripathi Hierarchical Unambiguity. [Citation Graph (0, 0)][DBLP ] Conf ] A. N. Trahtman An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Damian Wójtowicz , Jerzy Tiuryn On Genome Evolution with Innovation. [Citation Graph (0, 0)][DBLP ] Conf ] 