Conferences in DBLP
Michel Bidoit , Donald Sannella , Andrzej Tarlecki Global Development via Local Observational Construction Steps. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Gibbons , Paul Sant Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki Applications of Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg Low Stretch Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Maria I. Andreou , Dimitris Fotakis , Sotiris E. Nikoletseas , Vicky G. Papadopoulou , Paul G. Spirakis On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Ola Angelsmark , Vilhelm Dahllöf , Peter Jonsson Finite Domain Constraint Satisfaction Using Quantum Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang W. Bein , Peter Brucker , Lawrence L. Larmore , James K. Park Fast Algorithms with Algebraic Monge Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Beis , William Duckworth , Michele Zito Packing Edges in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Beate Bollig , Philipp Woelfel A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Leonid Khachiyan Matroid Intersections, Polymatroid Inequalities, and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Carton Accessibility in Automata on Scattered Linear Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Caucal On Infinite Terms Having a Decidable Monadic Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Caucal , Teodor Knapik A Chomsky-Like Hierarchy of Infinite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong Competitive Analysis of On-line Stream Merging Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Dabrowski , Wojciech Plandowski On Word Equations in One Variable. [Citation Graph (0, 0)][DBLP ] Conf ] Todd Ebert , Wolfgang Merkle Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. [Citation Graph (0, 0)][DBLP ] Conf ] Joost Engelfriet , Sebastian Maneth Two-Way Finite State Transducers with Nested Pebbles. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Lene M. Favrholdt Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Csanád Imreh , Rob van Stee More on Weighted Servers or FIFO is Better than LRU. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Guochuan Zhang On Maximizing the Throughput of Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt , Tomasz Jurdzinski Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Groult , Martine Léonard , Laurent Mouchard Evolutive Tandem Repeats Using Hamming Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Taghi Hajiaghayi , Naomi Nishimura Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Mika Hirvensalo , Juhani Karhumäki Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example. [Citation Graph (0, 0)][DBLP ] Conf ] Lucian Ilie , Sheng Yu Algorithms for Computing Small NFAs. [Citation Graph (0, 0)][DBLP ] Conf ] Shunsuke Inenaga , Ayumi Shinohara , Masayuki Takeda , Hideo Bannai , Setsuo Arikawa Space-Economical Construction of Index Structures for All Suffixes of a String. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Hiroki Morizumi An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Chuzo Iwamoto , Takeshi Andou , Kenichi Morita , Katsunobu Imai Computational Complexity in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Ryszard Janicki On a Mereological System for Relational Software Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Johannsen , N. S. Narayanaswamy An Optimal Lower Bound for Resolution with 2-Conjunctions. [Citation Graph (0, 0)][DBLP ] Conf ] Iyad A. Kanj , Ljubomir Perkovic Improved Parameterized Algorithms for Planar Dominating Set. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kára , Daniel Král Optimal Free Binary Decision Diagrams for Computation of EARn . [Citation Graph (0, 0)][DBLP ] Conf ] Ondrej Klíma Unification Modulo Associativity and Idempotency Is NP-complete. [Citation Graph (0, 0)][DBLP ] Conf ] Antonín Kucera , Richard Mayr On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman , Sharon Zuhovitzky An Improved Algorithm for the Membership Problem for Extended Regular Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Yaw-Ling Lin , Tao Jiang , Kun-Mao Chao Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Lombardy , Jacques Sakarovitch Derivation of Rational Expressions with Multiplicity. [Citation Graph (0, 0)][DBLP ] Conf ] Yann Loyer , Nicolas Spyratos Hypothesis-Founded Semantics for Datalog Programs with Negation. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lücking , Burkhard Monien , Manuel Rode On the Problem of Scheduling Flows on Distributed Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Patrícia D. L. Machado , Donald Sannella Unit Testing for C88 ASL Architectural Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Martinelli Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Dániel Marx The Complexity of Tree Multicolorings. [Citation Graph (0, 0)][DBLP ] Conf ] Benoît Masson , Ph. Schnoebelen On Verifying Fair Lossy Channel Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Catherine McCartin Parameterized Counting Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle , Nenad Mihailovic On the Construction of Effective Random Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Messner On the Structure of the Simulation Order of Proof Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Till Mossakowski Comorphism-Based Grothendieck Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Gwénaël Richomme , Francis Wlazinski Finite Test-Sets for Overlap-Free Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Rigo Characterizing Simpler Recognizable Sets of Integers. [Citation Graph (0, 0)][DBLP ] Conf ] Till Tantau Towards a Cardinality Theorem for Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Roger Villemaire An Approximation Semantics for the Propositional Mu-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] 