Conferences in DBLP
Pankaj K. Agarwal , Jirí Matousek On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:1-13 [Conf ] Josep Díaz Graph Layout Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:14-23 [Conf ] Klaus-Jörn Lange , Peter Rossmanith , Wojciech Rytter Parallel Recognition and Ranking of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:24-36 [Conf ] Milena Mihail On the Expansion of Combinatorial Polytopes. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:37-49 [Conf ] Pekka Orponen Neural Networks and Complexity Theory. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:50-61 [Conf ] J. V. Tucker , Jeffery I. Zucker Theory of Computation over Stream Algebras, and its Applications. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:62-80 [Conf ] Uzi Vishkin Methods in Parallel Algorithmics (Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:81- [Conf ] Osamu Watanabe On the Complexity of Small Description and Related Topics. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:82-94 [Conf ] Juraj Wiedermann Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:95-111 [Conf ] Avi Wigderson The Complexity of Graph Connectivity. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:112-132 [Conf ] Holger Bast , Martin Dietzfelbinger , Torben Hagerup A Perfect Parallel Dictionary. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:133-141 [Conf ] Bernd Becker , Joachim Hartmann Some Remarks on the Test Complexity of Iterative Logic Arrays. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:142-152 [Conf ] Hans-Jörg Burtschick , Albrecht Hoene The Degree Structure of 1-L Reductions. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:153-161 [Conf ] Jin-yi Cai , Lane A. Hemachandra , Jozef Vyskoc Promise Problems and Access to Unambiguous Computation. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:162-171 [Conf ] Suresh Chari , Desh Ranjan , Pankaj Rohatgi On the Complexity of Incremental Computation. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:172-180 [Conf ] Christian Choffrut , Massimiliano Goldwurm Rational Transductions and Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:181-190 [Conf ] Hubert Comon , Maribel Fernández Negation Elimination in Equational Formulae. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:191-199 [Conf ] José Félix Costa , Amílcar Sernadas , Cristina Sernadas , Hans-Dieter Ehrich Object Interaction. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:200-208 [Conf ] Pierre-Louis Curien , Thérèse Hardin , Alejandro Ríos Strong Normalization of Substitutions. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:209-217 [Conf ] Robert P. Daley , Bala Kalyanasundaram Probabilistic and Pluralistic Learners with Mind Changes. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:218-226 [Conf ] Carsten Damm , Markus Holzer , Klaus-Jörn Lange Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:227-235 [Conf ] Denis Derencourt , Juhani Karhumäki , Michel Latteux , Alain Terlutte On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:236-245 [Conf ] Rainer Feldmann , Peter Mysliwietz The Shuffle Exchange Network has a Hamiltonian Path. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:246-254 [Conf ] Paul Gastin , Antoine Petit Poset Properties of Complex Traces. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:255-263 [Conf ] Andreas Goerdt A Threshold for Unsatisfiability. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:264-274 [Conf ] Robert Gold Dataflow Semantics for Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:275-283 [Conf ] Irène Guessarian , Marcos Veloso Peixoto About Boundedness for some DATALOG and DATALOG_neg Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:284-297 [Conf ] Torben Hagerup , Ola Petersson Merging and Sorting Strings in Parallel. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:298-306 [Conf ] Petr Jancar , Frantisek Mráz , Martin Plátek Characterization of Context-Free Languages by Erasing Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:307-314 [Conf ] Lila Kari Insertion and Deletion of Words: Determinism and Reversibility. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:315-326 [Conf ] Frantisek Kascak Small Universal One-State Linear Operator Algorithm. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:327-335 [Conf ] Cosimo Laneve , Ugo Montanari Mobility in the CC-Paradigm. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:336-345 [Conf ] Klaus-Jörn Lange , Peter Rossmanith The Emptiness Problem for Intersections of Regular Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:346-354 [Conf ] Hing Leung On Finite Automata with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:355-363 [Conf ] Igor Litovsky , Yves Métivier , Eric Sopena Definitions and Comparisons of Local Computations on Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:364-373 [Conf ] Bruno Martin Efficient Unidimensional Universal Cellular Automaton. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:374-382 [Conf ] Osamu Maruyama , Satoru Miyano Inferring a Tree from Walks. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:383-391 [Conf ] Elvira Mayordomo Almost Every Set in Exponential Time is P-Bi-Immune. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:392-400 [Conf ] David Murphy , Axel Poigné A Functorial Semantics for Observed Concurrency. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:401-411 [Conf ] Edward Ochmanski Modelling Concurrency with Semi-Commutations. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:412-420 [Conf ] John Pedersen Decision Problems for Cellular Automata and Their Semigroups. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:421-429 [Conf ] G. Michele Pinna , Axel Poigné On the Nature of Events. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:430-441 [Conf ] W. Preilowski , Elias Dahlhaus , Gerd Wechsung New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:442-450 [Conf ] Teodor C. Przymusinski Two Simple Characterizations of Well-Founded Semantics. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:451-462 [Conf ] S. Ramesh Fully Abstract Semantics for Higher Order Communicating Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:463-471 [Conf ] Nicolas Reimen Superposable Trellis Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:472-482 [Conf ] Thomas Roos , Gerhard Albers Maintaining Proximity in Higher Dimensional Spaces. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:483-493 [Conf ] Andrew Szilard , Sheng Yu , Kaizhong Zhang , Jeffrey Shallit Characterizing Regular Languages with Polynomial Densities. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:494-503 [Conf ] Dongming Wang A Strategy for Speeding-up the Computation of Characteristic Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:504-510 [Conf ] Celia Wrathall , Volker Diekert , Friedrich Otto One-Rule Trace-Rewriting Systems and Confluence. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:511-521 [Conf ]