27. MFCS 2002:
Warsaw,
Poland
Krzysztof Diks, Wojciech Rytter (Eds.):
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings.
Lecture Notes in Computer Science 2420 Springer 2002, ISBN 3-540-44040-2 BibTeX
@proceedings{DBLP:conf/mfcs/2002,
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2420},
year = {2002},
isbn = {3-540-44040-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Talks
Contributed Talks
- Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
81-92
Electronic Edition (Springer LINK) BibTeX
- Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson:
Finite Domain Constraint Satisfaction Using Quantum Computation.
93-103
Electronic Edition (Springer LINK) BibTeX
- Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties.
104-117
Electronic Edition (Springer LINK) BibTeX
- Mihalis Beis, William Duckworth, Michele Zito:
Packing Edges in Random Regular Graphs.
118-130
Electronic Edition (Springer LINK) BibTeX
- Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
131-142
Electronic Edition (Springer LINK) BibTeX
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems.
143-154
Electronic Edition (Springer LINK) BibTeX
- Olivier Carton:
Accessibility in Automata on Scattered Linear Orderings.
155-164
Electronic Edition (Springer LINK) BibTeX
- Didier Caucal:
On Infinite Terms Having a Decidable Monadic Theory.
165-176
Electronic Edition (Springer LINK) BibTeX
- Didier Caucal, Teodor Knapik:
A Chomsky-Like Hierarchy of Infinite Graphs.
177-187
Electronic Edition (Springer LINK) BibTeX
- Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
Competitive Analysis of On-line Stream Merging Algorithms.
188-200
Electronic Edition (Springer LINK) BibTeX
- Amin Coja-Oghlan:
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming.
201-211
Electronic Edition (Springer LINK) BibTeX
- Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable.
212-220
Electronic Edition (Springer LINK) BibTeX
- Todd Ebert, Wolfgang Merkle:
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits.
221-233
Electronic Edition (Springer LINK) BibTeX
- Joost Engelfriet, Sebastian Maneth:
Two-Way Finite State Transducers with Nested Pebbles.
234-244
Electronic Edition (Springer LINK) BibTeX
- Leah Epstein, Lene M. Favrholdt:
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
245-256
Electronic Edition (Springer LINK) BibTeX
- Leah Epstein, Csanád Imreh, Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU.
257-268
Electronic Edition (Springer LINK) BibTeX
- Aleksei V. Fishkin, Guochuan Zhang:
On Maximizing the Throughput of Multiprocessor Tasks.
269-279
Electronic Edition (Springer LINK) BibTeX
- Andreas Goerdt, Tomasz Jurdzinski:
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures.
280-291
Electronic Edition (Springer LINK) BibTeX
- Richard Groult, Martine Léonard, Laurent Mouchard:
Evolutive Tandem Repeats Using Hamming Distance.
292-304
Electronic Edition (Springer LINK) BibTeX
- Mohammad Taghi Hajiaghayi, Naomi Nishimura:
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth.
305-318
Electronic Edition (Springer LINK) BibTeX
- Mika Hirvensalo, Juhani Karhumäki:
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.
319-327
Electronic Edition (Springer LINK) BibTeX
- Lucian Ilie, Sheng Yu:
Algorithms for Computing Small NFAs.
328-340
Electronic Edition (Springer LINK) BibTeX
- Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa:
Space-Economical Construction of Index Structures for All Suffixes of a String.
341-352
Electronic Edition (Springer LINK) BibTeX
- Kazuo Iwama, Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
353-364
Electronic Edition (Springer LINK) BibTeX
- Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane.
365-374
Electronic Edition (Springer LINK) BibTeX
- Ryszard Janicki:
On a Mereological System for Relational Software Specifications.
375-386
Electronic Edition (Springer LINK) BibTeX
- Jan Johannsen, N. S. Narayanaswamy:
An Optimal Lower Bound for Resolution with 2-Conjunctions.
387-398
Electronic Edition (Springer LINK) BibTeX
- Iyad A. Kanj, Ljubomir Perkovic:
Improved Parameterized Algorithms for Planar Dominating Set.
399-410
Electronic Edition (Springer LINK) BibTeX
- Jan Kára, Daniel Král:
Optimal Free Binary Decision Diagrams for Computation of EARn.
411-422
Electronic Edition (Springer LINK) BibTeX
- Ondrej Klíma:
Unification Modulo Associativity and Idempotency Is NP-complete.
423-432
Electronic Edition (Springer LINK) BibTeX
- Antonín Kucera, Richard Mayr:
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
433-445
Electronic Edition (Springer LINK) BibTeX
- Orna Kupferman, Sharon Zuhovitzky:
An Improved Algorithm for the Membership Problem for Extended Regular Expressions.
446-458
Electronic Edition (Springer LINK) BibTeX
- Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao:
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.
459-470
Electronic Edition (Springer LINK) BibTeX
- Sylvain Lombardy, Jacques Sakarovitch:
Derivation of Rational Expressions with Multiplicity.
471-482
Electronic Edition (Springer LINK) BibTeX
- Yann Loyer, Nicolas Spyratos:
Hypothesis-Founded Semantics for Datalog Programs with Negation.
483-494
Electronic Edition (Springer LINK) BibTeX
- Thomas Lücking, Burkhard Monien, Manuel Rode:
On the Problem of Scheduling Flows on Distributed Networks.
495-505
Electronic Edition (Springer LINK) BibTeX
- Patrícia D. L. Machado, Donald Sannella:
Unit Testing for C88 ASL Architectural Specifications.
506-518
Electronic Edition (Springer LINK) BibTeX
- Fabio Martinelli:
Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems.
519-531
Electronic Edition (Springer LINK) BibTeX
- Dániel Marx:
The Complexity of Tree Multicolorings.
532-542
Electronic Edition (Springer LINK) BibTeX
- Benoît Masson, Ph. Schnoebelen:
On Verifying Fair Lossy Channel Systems.
543-555
Electronic Edition (Springer LINK) BibTeX
- Catherine McCartin:
Parameterized Counting Problems.
556-567
Electronic Edition (Springer LINK) BibTeX
- Wolfgang Merkle, Nenad Mihailovic:
On the Construction of Effective Random Sets.
568-580
Electronic Edition (Springer LINK) BibTeX
- Jochen Messner:
On the Structure of the Simulation Order of Proof Systems.
581-592
Electronic Edition (Springer LINK) BibTeX
- Till Mossakowski:
Comorphism-Based Grothendieck Logics.
593-604
Electronic Edition (Springer LINK) BibTeX
- Gwénaël Richomme, Francis Wlazinski:
Finite Test-Sets for Overlap-Free Morphisms.
605-614
Electronic Edition (Springer LINK) BibTeX
- Michel Rigo:
Characterizing Simpler Recognizable Sets of Integers.
615-624
Electronic Edition (Springer LINK) BibTeX
- Till Tantau:
Towards a Cardinality Theorem for Finite Automata.
625-636
Electronic Edition (Springer LINK) BibTeX
- Roger Villemaire:
An Approximation Semantics for the Propositional Mu-Calculus.
637-650
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:29:34 2009
by Michael Ley (ley@uni-trier.de)