Conferences in DBLP
Thomas Cheatham Models, Languages, and Compiler Technology for High Performance Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Cosnard , Martín Matamala On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , José D. P. Rolim E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen L. Bloom , Zoltán Ésik Solving Polynomial Fixed Point Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky Capturing Complexity Classes with Lindström Quantifiers. [Citation Graph (1, 0)][DBLP ] Conf ] Burkhard Monien , Ralf Diekmann , Reinhard Lüling Communication Throughput of Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Conf ] James Lipton , Michael J. O'Donnell Intuitive Counterexamples for Constructive Fallacies. [Citation Graph (0, 0)][DBLP ] Conf ] Fernando Orejas , Elvira Pino , Hartmut Ehrig Algebraic Methods in the Compositional Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , Vlado Dancík Longest Common Subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel A. Pevzner , Robert J. Lipshutz Towards DNA Sequencing Chips. [Citation Graph (0, 0)][DBLP ] Conf ] Jiri Sgall On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Glynn Winskel Stable Bistructure Models of PCF. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers A Competitive Analysis of the List Update Problem with Lookahead. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Alessi , Mariangiola Dezani-Ciancaglini , Ugo de'Liguoro May and Must Convergencey in Concurrent Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies , Hans-Christian Neis , Sebastiaan Terwijn Genericity and Measure for Exponential Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates Analysis of Bounded Disorder. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Bertoni , Carlo Mereghetti , Giovanni Pighizzini On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Frank S. de Boer , M. van Hulst A Proof System for Asynchronously Communicating Deterministic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] A. Bouabdallah , Marie-Claude Heydemann , Jaroslav Opatrny , Dominique Sotteau Embedding Complete Binary Trees into Star Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm , Markus Holzer Inductive Counting Below LOGSPACE. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Dassow Decision Problems for Edge Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Frank K. H. A. Dehne , Rolf Klein "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Denejko , Krzysztof Diks , Andrzej Pelc , Marek Piotrów Reliable Minimum Finding Comparator Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Dessmark , Andrzej Lingas , Oscar Garrido On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Juraj Hromkovic , Georg Schnitger A Comparison of Two Lower Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] S. Eyono Obono , Pavel Goralcik , M. N. Maksimenko Efficient Solving of the Word Equations in One Variable. [Citation Graph (0, 0)][DBLP ] Conf ] Gian Luigi Ferrari , Ugo Montanari , Paola Quaglia A Pi-Calculus with Explicit Substitutions: the Late Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Forti , Furio Honsell , Marina Lenisa Processes and Hyperuniverses. [Citation Graph (0, 0)][DBLP ] Conf ] Felix Frayman , Valery Kanevsky , Walter W. Kirchherr The Combinatorial Complexity of a Finite String. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Gold A Fully Abstract Semantics for Termination in Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Mirian Halfeld Ferrari Alves , Dominique Laurent , Nicolas Spyratos Passive and Active Rules in Deductive Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Tibor Hegedüs Combinatorial Results on the Complexity of Teaching and Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Montserrat Hermo Degrees and Reducibilities of Easy Tally Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Hendrik Jan Hoogeboom , Paulien ten Pas MSO Definable Text Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Jarkko Kari , Lila Kari , Dana Pardubská Two Lower Bounds on Distributive Generation of Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Inverardi , Marisa Venturini Zilli Rational Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Wojciech Plandowski On the Size of Independent Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Wojciech Rytter On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris J. Kavvadias , Grammati E. Pantziou , Paul G. Spirakis , Christos D. Zaroliagis Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Klasing The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Kurka A Comparison of Finite and Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Jörn Lange , Klaus Reinhardt Empty Alternation. [Citation Graph (0, 0)][DBLP ] Conf ] Bertrand Le Saëc , Igor Litovsky On the Minimization Prolem for Omega-Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel , Anna Slobodová On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] H. Narayanan , Subir Roy , Sachin B. Patkar Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Rocco De Nicola , Anna Labella A Completeness Theorem fro Nondeterministic Kleene Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Marina Papatriantafilou , Philippas Tsigas How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking. [Citation Graph (0, 0)][DBLP ] Conf ] Detlef Plump Critical Pairs in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Corrado Priami , Daniel Yankelevich Read-Write Causality. [Citation Graph (0, 0)][DBLP ] Conf ] Gwénaël Richomme Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Kai Salomaa , Derick Wood , Sheng Yu Complexity of E0L Structural Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn , Bogdan S. Chlebus , Michael Kaufmann Shorter Queues for Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Sieber Full Abstraction for the Second Order Subset of an Algol-Like Language. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weber , Tom Head The Finest Homophonic Partition and Related Code Concepts. [Citation Graph (0, 0)][DBLP ] Conf ] 