15. MFCS 1990:
Banská Bystrica,
Czechoslovakia
Branislav Rovan (Ed.):
Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings.
Lecture Notes in Computer Science 452 Springer 1990, ISBN 3-540-52953-5 BibTeX
@proceedings{DBLP:conf/mfcs/1990,
editor = {Branislav Rovan},
title = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'a}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {452},
year = {1990},
isbn = {3-540-52953-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- Maris Alberts:
Interrogative Complexity of omega-Languages' Recognition.
152-157 BibTeX
- Eric Allender, Ulrich Hertrampf:
On the Power of Uniform Families of Constant Depth Treshold Circuits.
158-164 BibTeX
- Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating Sets of Hyperrectangles.
165-172 BibTeX
- Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier:
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
173-179 BibTeX
- Arie de Bruin, Erik P. de Vink:
Retractions in Comparing Prolog Semantics (Extended Abstract).
180-186 BibTeX
- Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes:
Using Inductive Counting to Simulate Nondeterministic Computation.
187-194 BibTeX
- Ivana Cerná:
Some Properties of Zerotesting Bounded One-Way Multicounter Machines.
195-201 BibTeX
- Marek Chrobak, Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
202-208 BibTeX
- Mireille Clerbout, D. Gonzalez:
Decomposition of Semi Commutations.
209-216 BibTeX
- Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata.
217-223 BibTeX
- Karel Culik II, Simant Dube:
Affine Automata: A Technique to Generate Complex Images.
224-231 BibTeX
- Carsten Damm:
The Complexity of Symmetric Functions in Parity Normal Forms.
232-238 BibTeX
- Philippe Darondeau, Pierpaolo Degano:
Event Structures, Causal Trees, and Refinements.
239-245 BibTeX
- Pratul Dublish, S. N. Maheshwari:
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.
246-253 BibTeX
- Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Comparisons Among Classes of Y-Tree Systolic Automata.
254-260 BibTeX
- William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene:
On Checking Versus Evaluation of Multiple Queries.
261-268 BibTeX
- Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar:
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).
269-276 BibTeX
- Antonio Gavilanes-Franco:
A First-Order Logic for Partial Recursive Functions.
277-284 BibTeX
- Viliam Geffert:
Speed-Up Theorem Without Tape Compression.
285-291 BibTeX
- Dainis Geidmanis:
On Possibilities of One-Way Synchronized and Alternating Automata.
292-299 BibTeX
- Andreas Goerdt:
Unrestricted Resolution versus N-Resolution.
300-305 BibTeX
- Robert Gold, Walter Vogler:
Quality Criteria for Partial Order Semantics of Place/Transition-Nets.
306-312 BibTeX
- Wolfgang Golubski, Wolfram-Manfred Lippe:
Tree-Stack Automata.
313-321 BibTeX
- Michael R. Hansen, Zhou Chaochen:
Specification & Verification of Higher Order Processes.
322-328 BibTeX
- Friedhelm Hinz:
The Membership Problem for Context-Free Chain Code Picture Languages.
329-336 BibTeX
- Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).
337-346 BibTeX
- Bengt Jonsson:
A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).
347-354 BibTeX
- Janis Kaneps, Rusins Freivalds:
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.
355-361 BibTeX
- Marek Karpinski, Friedhelm Meyer auf der Heide:
On the Complexity of Genuinely Polynomial Computation.
362-368 BibTeX
- Emmanuel Kounalis:
Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
369-377 BibTeX
- Miroslaw Kowaluk, Klaus W. Wagner:
Vector Language: Simple Description of Hard Instances (Extended Abstract).
378-384 BibTeX
- Matthias Krause:
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.
385-391 BibTeX
- Mirko Krivánek:
The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.
392-398 BibTeX
- Klaus-Jörn Lange, Peter Rossmanith:
Characterizing Unambiguous Augmented Pushdown Automata by Circuits.
399-406 BibTeX
- Michel Latteux, Erick Timmerman:
Rational omega-Transductions.
407-415 BibTeX
- Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm.
416-422 BibTeX
- Vincenzo Manca, Antonino Salibra:
Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets.
423-429 BibTeX
- Edward Ochmanski:
Semi-Commutation and Deterministic Petri Nets.
430-438 BibTeX
- Michel Parigot:
Internal Labellings in Lambda-Calculus.
439-445 BibTeX
- Ana Pasztor:
A Sup-Preserving Completion of Ordered Partial Algebras.
446-456 BibTeX
- Marek Priotrów:
ATIME(N) is Closed Under Counting.
457-463 BibTeX
- Regimantas Pliuskevicius:
Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi.
464-469 BibTeX
- Axel Poigné:
Typed Horn Logic.
470-477 BibTeX
- Ildikó Sain:
Results on the Glory of the Past.
478-484 BibTeX
- Pham Huu Uyen:
A Stronger Version of Parikh Theorem.
485-491 BibTeX
- Stephan Waack:
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
492-498 BibTeX
- Igor Walukiewicz:
Gentzen Type Axiomatizations for PAL.
499-507 BibTeX
- Andreas Weber:
Distance Automata Having Large Finite Distance or Finite Ambiguity.
508-515 BibTeX
- Ingo Wegener:
Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).
516-522 BibTeX
- Ingo Wegener, Norbert Wurm, Sang-Zin Yi:
Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size.
523-529 BibTeX
- Manfred Wiegers:
The k-section of Treewidth Restricted Graphs.
530-537 BibTeX
- Thomas Zeugmann:
Computing Large Polynomial Powers Very Fast in Parallel.
538-544 BibTeX
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)
