MFCS B

63 papers

YearTitle / Authors
1990A First-Order Logic for Partial Recursive Functions.
Antonio Gavilanes-Franco
1990A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).
Bengt Jonsson
1990A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation.
Egon Börger
1990A Stronger Version of Parikh Theorem.
Pham Huu Uyen
1990A Sup-Preserving Completion of Ordered Partial Algebras.
Ana Pasztor
1990ATIME(N) is Closed Under Counting.
Marek Piotrów
1990Affine Automata: A Technique to Generate Complex Images.
Karel Culík II, Simant Dube
1990Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).
Ingo Wegener
1990Characterizing Unambiguous Augmented Pushdown Automata by Circuits.
Klaus-Jörn Lange, Peter Rossmanith
1990Comparisons Among Classes of Y-Tree Systolic Automata.
Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
1990Computing Large Polynomial Powers Very Fast in Parallel.
Thomas Zeugmann
1990Counting the Number of Solutions.
Jacobo Torán
1990Decomposition of Semi Commutations.
Mireille Clerbout, D. Gonzalez
1990Distance Automata Having Large Finite Distance or Finite Ambiguity.
Andreas Weber
1990Dynamic Hashing Strategies.
Friedhelm Meyer auf der Heide
1990Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets.
Vincenzo Manca, Antonino Salibra
1990Event Structures, Causal Trees, and Refinements.
Philippe Darondeau, Pierpaolo Degano
1990Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).
Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
1990Gentzen Type Axiomatizations for PAL.
Igor Walukiewicz
1990Implementation of Parallel Graph Reduction by Explicit Annotation and Program Transformation.
Willem G. Vree
1990Interactive Computations of Optimal Solutions.
Jan Krajícek, Pavel Pudlák, Jirí Sgall
1990Internal Labellings in Lambda-Calculus.
Michel Parigot
1990Interrogative Complexity of omega-Languages' Recognition.
Maris Alberts
1990Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi.
Regimantas Pliuskevicius
1990Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings
Branislav Rovan
1990Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.
Janis Kaneps, Rusins Freivalds
1990On Checking Versus Evaluation of Multiple Queries.
William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
1990On Fast Algorithms for Two Servers.
Marek Chrobak, Lawrence L. Larmore
1990On Kleene Algebras and Closed Semirings.
Dexter Kozen
1990On Possibilities of One-Way Synchronized and Alternating Automata.
Dainis Geidmanis
1990On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
1990On the Complexity of Genuinely Polynomial Computation.
Marek Karpinski, Friedhelm Meyer auf der Heide
1990On the Power of Uniform Families of Constant Depth Treshold Circuits.
Eric Allender, Ulrich Hertrampf
1990One-Way Functions in Complexity Theory.
Alan L. Selman
1990Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).
Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1990Parallel Construction of Minimal Suffix and Factor Automata.
Maxime Crochemore, Wojciech Rytter
1990Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
Emmanuel Kounalis
1990Quality Criteria for Partial Order Semantics of Place/Transition-Nets.
Robert Gold, Walter Vogler
1990Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.
Pratul Dublish, S. N. Maheshwari
1990Rational omega-Transductions.
Michel Latteux, Erick Timmerman
1990Restricted Branching Programs and Their Computational Power.
Christoph Meinel
1990Results on the Glory of the Past.
Ildikó Sain
1990Retractions in Comparing Prolog Semantics (Extended Abstract).
Arie de Bruin, Erik P. de Vink
1990Semi-Commutation and Deterministic Petri Nets.
Edward Ochmanski
1990Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.
Matthias Krause
1990Separating Sets of Hyperrectangles.
Fabrizio d'Amore, Paolo Giulio Franciosa
1990Some Properties of Zerotesting Bounded One-Way Multicounter Machines.
Ivana Cerná
1990Specification & Verification of Higher Order Processes.
Michael R. Hansen, Zhou Chaochen
1990Speed-Up Theorem Without Tape Compression.
Viliam Geffert
1990Splitsort - An Adaptive Sorting Algorithm.
Christos Levcopoulos, Ola Petersson
1990Symmetric Functions in AC
Ingo Wegener, Norbert Wurm, Sang-Zin Yi
1990Syntactic Theories.
Jean-Pierre Jouannaud
1990The Complexity of Symmetric Functions in Parity Normal Forms.
Carsten Damm
1990The Membership Problem for Context-Free Chain Code Picture Languages.
Friedhelm Hinz
1990The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
Stephan Waack
1990The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.
Mirko Krivánek
1990The k-section of Treewidth Restricted Graphs.
Manfred Wiegers
1990Tree-Stack Automata.
Wolfgang Golubski, Wolfram-Manfred Lippe
1990Type Inference Problems: A Survey.
Jerzy Tiuryn
1990Typed Horn Logic.
Axel Poigné
1990Unrestricted Resolution versus N-Resolution.
Andreas Goerdt
1990Using Inductive Counting to Simulate Nondeterministic Computation.
Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
1990Vector Language: Simple Description of Hard Instances (Extended Abstract).
Miroslaw Kowaluk, Klaus W. Wagner