Conferences in DBLP
Raimund Seidel The Nature and Meaning of Perturbations in Geometric Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Devienne , Patrick Lebègue , Jean-Christophe Routier , Jörg Würtz One Binary Horn Clause is Enough. [Citation Graph (0, 0)][DBLP ] Conf ] N. Bensaou , Irène Guessarian Transforming Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] François Laroussinie , Ph. Schnoebelen A Hierarchy of Temporal Logics with Past (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jean Goubault The Complexity of Resource-Bounded First-Order Classical Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Belaid Benhamou , Lakhdar Sais , Pierre Siegel Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Burchard von Braunmühl , Romain Gengler , Robert Rettinger The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish V. Naik , Kenneth W. Regan , D. Sivakumar Quasilinear Time Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Ioan I. Macarie Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Neil Immerman Reachability and the Power of Local Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Louis Mak Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon , Florent Jacquemard Ground Reducibility and Automata with Disequality Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Zurab Khasidashvili Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Sattler-Klein About Changing the Ordering During Knuth-Bendix Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Ringeissen Combination of Matching Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Kik , Miroslaw Kutylowski , Grzegorz Stachowiak Periodic Constant Depth Sorting Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Leszek Gasieniec Optimal Pattern Matching on Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kunde , Rolf Niedermeier , Peter Rossmanith Faster Sorting and Routing on Grids with Diagonals. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn , Michael Kaufmann Deterministic 1-k Routing on Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hofmann , Benjamin C. Pierce A Unifying Type-Theoretic Framework for Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Klaus Becker Operational Specifications with Built-Ins. [Citation Graph (0, 0)][DBLP ] Conf ] E. Pascal Gribomont , Jacques Hagelstein Reactive Variables for System Specification and Design. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth W. Regan A New Parallel Vector Model, with Exact Characterization of NC^k. [Citation Graph (0, 0)][DBLP ] Conf ] Carme Àlvarez , Birgit Jenner On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mitsunori Ogiwara NC^k(NP) = AC^(k-1)(NP). [Citation Graph (0, 0)][DBLP ] Conf ] André Arnold Hypertransition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Métivier , Gwénaël Richomme On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Clelia de Felice , Giovanna Guaiana Coding with Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Dora Giammarresi , Antonio Restivo , Sebastian Seibert , Wolfgang Thomas Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maylis Delest , Jean-Philippe Dubernard q-Grammars: Results, Implementation. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Karner A Topology for Complete Semirings. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Jack H. Lutz , David M. Martin Jr. The Global Power of Additional Queries to Random Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] Jack H. Lutz , Elvira Mayordomo Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Thierauf , Seinosuke Toda , Osamu Watanabe On Sets Bounded Truth-Table Reducible to P-selective Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov Two Refinements of the Polynomial Hierarcht. [Citation Graph (0, 0)][DBLP ] Conf ] Heribert Vollmer On Different Reducibility Notions for Function Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Wolfgang Ertel Optimal Parallelization of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Amitava Datta Efficient Parallel Algorithms for Geometric k-Clustering Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Maheshwari , Andrzej Lingas A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Apostolico , Dany Breslauer , Zvi Galil Parallel Detection of all Palindromes in a String. [Citation Graph (0, 0)][DBLP ] Conf ] Liming Cai , Jianer Chen , Rodney G. Downey , Michael R. Fellows On the Structure of Parameterized Problems in NP (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Edoardo Amaldi , Viggo Kann On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Borchert On the Acceptance Power of Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Hertrampf Complexity Classes with Finite Acceptance Types. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Parrow , Peter Sjödin The Complete Axiomatization of Cs-congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent van Oostrom , Erik P. de Vink Transition System Specifications in Stalk Formal with Bisimulation as a Congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Krzysztof Lorys The Variable Membership Problem: Succinctness Versus Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weber , Reinhard Klemm Economy of Description for Single-valued Transducers. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Shallit , Yuri Breitbart Automaticity: Properties of a Measure of Descriptional Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] David Harel Towards a Theory of Recursive Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroki Arimura , Takeshi Shinohara , Setsuko Otsuki Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandru Mateescu , Arto Salomaa Nondeterminism in Patterns. [Citation Graph (0, 0)][DBLP ] Conf ] Vlado Dancík , Mike Paterson Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] H. Petersen The Ambiguity of Primitive Words. [Citation Graph (0, 0)][DBLP ] Conf ] Nguyen Huong Lam On Codes Having no Finite Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton A New Approach To Information Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Ngoc-Minh Lê On Voronoi Diagrams in the L_p-Metric in Higher Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao Total Protection of Analytic Invariant Information in Cross Tabulated Tables. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan , Andreas Brandstädt Dominating Cliques in Graphs with Hypertree Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Jitender S. Deogun , Ton Kloks , Dieter Kratsch , Haiko Müller On Vertex Ranking for Permutations and Other Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks , Dieter Kratsch Finding All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Klaus Jansen On the Complexity of the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 