MFCS B

51 papers

YearTitle / Authors
1992A Functorial Semantics for Observed Concurrency.
David Murphy, Axel Poigné
1992A Perfect Parallel Dictionary.
Hannah Bast, Martin Dietzfelbinger, Torben Hagerup
1992A Strategy for Speeding-up the Computation of Characteristic Sets.
Dongming Wang
1992A Threshold for Unsatisfiability.
Andreas Goerdt
1992About Boundedness for some DATALOG and DATALOG_neg Programs.
Irène Guessarian, Marcos Veloso Peixoto
1992Almost Every Set in Exponential Time is P-Bi-Immune.
Elvira Mayordomo
1992Characterization of Context-Free Languages by Erasing Automata.
Petr Jancar, Frantisek Mráz, Martin Plátek
1992Characterizing Regular Languages with Polynomial Densities.
Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey O. Shallit
1992Dataflow Semantics for Petri Nets.
Robert Gold
1992Decision Problems for Cellular Automata and Their Semigroups.
John Pedersen
1992Definitions and Comparisons of Local Computations on Graphs.
Igor Litovsky, Yves Métivier, Éric Sopena
1992Efficient Unidimensional Universal Cellular Automaton.
Bruno Martin
1992Fully Abstract Semantics for Higher Order Communicating Systems.
S. Ramesh
1992Graph Layout Problems.
Josep Díaz
1992Inferring a Tree from Walks.
Osamu Maruyama, Satoru Miyano
1992Insertion and Deletion of Words: Determinism and Reversibility.
Lila Kari
1992Maintaining Proximity in Higher Dimensional Spaces.
Thomas Roos, Gerhard Albers
1992Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings
Ivan M. Havel, Václav Koubek
1992Merging and Sorting Strings in Parallel.
Torben Hagerup, Ola Petersson
1992Methods in Parallel Algorithmics (Abstract).
Uzi Vishkin
1992Mobility in the CC-Paradigm.
Cosimo Laneve, Ugo Montanari
1992Modelling Concurrency with Semi-Commutations.
Edward Ochmanski
1992Negation Elimination in Equational Formulae.
Hubert Comon, Maribel Fernández
1992Neural Networks and Complexity Theory.
Pekka Orponen
1992New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space.
Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung
1992Object Interaction.
José Félix Costa, Amílcar Sernadas, Cristina Sernadas, Hans-Dieter Ehrich
1992On Computational Power of Weighted Finite Automata.
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1992On Finite Automata with Limited Nondeterminism.
Hing Leung
1992On Range Searching with Semialgebraic Sets.
Pankaj K. Agarwal, Jirí Matousek
1992On the Complexity of Incremental Computation.
Suresh Chari, Desh Ranjan, Pankaj Rohatgi
1992On the Complexity of Small Description and Related Topics.
Osamu Watanabe
1992On the Expansion of Combinatorial Polytopes.
Milena Mihail
1992On the Nature of Events.
G. Michele Pinna, Axel Poigné
1992One-Rule Trace-Rewriting Systems and Confluence.
Celia Wrathall, Volker Diekert, Friedrich Otto
1992Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers.
Carsten Damm, Markus Holzer, Klaus-Jörn Lange
1992Parallel Recognition and Ranking of Context-Free Languages.
Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
1992Poset Properties of Complex Traces.
Paul Gastin, Antoine Petit
1992Probabilistic and Pluralistic Learners with Mind Changes.
Robert P. Daley, Bala Kalyanasundaram
1992Promise Problems and Access to Unambiguous Computation.
Jin-Yi Cai, Lane A. Hemachandra, Jozef Vyskoc
1992Rational Transductions and Complexity of Counting Problems.
Christian Choffrut, Massimiliano Goldwurm
1992Small Universal One-State Linear Operator Algorithm.
Frantisek Kascak
1992Some Remarks on the Test Complexity of Iterative Logic Arrays.
Bernd Becker, Joachim Hartmann
1992Strong Normalization of Substitutions.
Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
1992Superposable Trellis Automata.
Nicolas Reimen
1992The Complexity of Graph Connectivity.
Avi Wigderson
1992The Degree Structure of 1-L Reductions.
Hans-Jörg Burtschick, Albrecht Hoene
1992The Emptiness Problem for Intersections of Regular Languages.
Klaus-Jörn Lange, Peter Rossmanith
1992The Shuffle Exchange Network has a Hamiltonian Path.
Rainer Feldmann, Peter Mysliwietz
1992Theory of Computation over Stream Algebras, and its Applications.
John V. Tucker, Jeffery I. Zucker
1992Two Simple Characterizations of Well-Founded Semantics.
Teodor C. Przymusinski
1992Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models.
Juraj Wiedermann