28. MFCS 2003:
Bratislava,
Slovak Republic
Branislav Rovan, Peter Vojtás (Eds.):
Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings.
Lecture Notes in Computer Science 2747 Springer 2003, ISBN 3-540-40671-9 BibTeX
@proceedings{DBLP:conf/mfcs/2003,
editor = {Branislav Rovan and
Peter Vojt{\'a}s},
title = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2747},
year = {2003},
isbn = {3-540-40671-9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Talks
Contributed Papers
- Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
Adversarial Models for Priority-Based Networks.
142-151
Electronic Edition (link) BibTeX
- Kazuyuki Amano, Akira Maruoka:
On Optimal Merging Networks.
152-161
Electronic Edition (link) BibTeX
- Klaus Ambos-Spies:
Problems with Cannot Be Reduced to Any Proper Subproblems.
162-168
Electronic Edition (link) BibTeX
- Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable.
169-178
Electronic Edition (link) BibTeX
- Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes.
179-188
Electronic Edition (link) BibTeX
- Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda:
On the Length of the Minimum Solution of Word Equations in One Variable.
189-197
Electronic Edition (link) BibTeX
- Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems.
198-207
Electronic Edition (link) BibTeX
- Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays.
208-217
Electronic Edition (link) BibTeX
- Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees.
218-227
Electronic Edition (link) BibTeX
- François Blanchard, Julien Cervelle, Enrico Formenti:
Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies.
228-238
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.
239-248
Electronic Edition (link) BibTeX
- Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM.
249-258
Electronic Edition (link) BibTeX
- Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.
259-268
Electronic Edition (link) BibTeX
- Michele Boreale, Maria Grazia Buscemi:
Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation.
269-278
Electronic Edition (link) BibTeX
- Michele Boreale, Fabio Gadducci:
Denotational Testing Semantics in Coinductive Form.
279-289
Electronic Edition (link) BibTeX
- Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.
290-299
Electronic Edition (link) BibTeX
- Antonio Bucciarelli, Antonino Salibra:
The Minimal Graph Model of Lambda Calculus.
300-307
Electronic Edition (link) BibTeX
- Olivier Carton:
Unambiguous Automata on Bi-infinite Words.
308-317
Electronic Edition (link) BibTeX
- Ivana Cerná, Radek Pelánek:
Relating Hierarchy of Temporal Properties to Model Checking.
318-327
Electronic Edition (link) BibTeX
- Hubie Chen:
Arithmetic Constant-Depth Circuit Complexity Classes.
328-337
Electronic Edition (link) BibTeX
- Hubie Chen:
Inverse NP Problems.
338-347
Electronic Edition (link) BibTeX
- Zhi-Zhong Chen, Mitsuharu Kouno:
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs.
348-357
Electronic Edition (link) BibTeX
- Víctor Dalmau, Daniel K. Ford:
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.
358-367
Electronic Edition (link) BibTeX
- Gianluca De Marco, Andrzej Pelc:
Randomized Algorithms for Determining the Majority on Graphs.
368-377
Electronic Edition (link) BibTeX
- Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas:
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.
378-387
Electronic Edition (link) BibTeX
- Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-Time Computation of Local Periods.
388-397
Electronic Edition (link) BibTeX
- Leah Epstein:
Two Dimensional Packing: The Power of Rotation.
398-407
Electronic Edition (link) BibTeX
- Leah Epstein, Tamir Tassa:
Approximation Schemes for the Min-Max Starting Time Problem.
408-418
Electronic Edition (link) BibTeX
- Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum Testers for Hidden Group Properties.
419-428
Electronic Edition (link) BibTeX
- Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
429-438
Electronic Edition (link) BibTeX
- Paul Gastin, Denis Oddoux:
LTL with Past and Two-Way Very-Weak Alternating Automata.
439-448
Electronic Edition (link) BibTeX
- Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems.
449-459
Electronic Edition (link) BibTeX
- Gregor Gramlich:
Probabilistic and Nondeterministic Unary Automata.
460-469
Electronic Edition (link) BibTeX
- Petr Hlinený:
On Matroid Properties Definable in the MSO Logic.
470-479
Electronic Edition (link) BibTeX
- Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems.
480-489
Electronic Edition (link) BibTeX
- Toshimasa Ishii, Masayuki Hagiwara:
Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.
490-499
Electronic Edition (link) BibTeX
- Piotr Krysta, Peter Sanders, Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
500-510
Electronic Edition (link) BibTeX
- Miroslaw Kutylowski, Daniel Letkiewicz:
Computing Average Value in Ad Hoc Networks.
511-520
Electronic Edition (link) BibTeX
- Slawomir Lasota:
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.
521-530
Electronic Edition (link) BibTeX
- Christof Löding, Philipp Rohde:
Solving the Sabotage Game Is PSPACE-Hard.
531-540
Electronic Edition (link) BibTeX
- Yann Loyer, Umberto Straccia:
The Approximate Well-Founded Semantics for Logic Programs with Uncertainty.
541-550
Electronic Edition (link) BibTeX
- Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium?
551-561
Electronic Edition (link) BibTeX
- Bas Luttik:
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory.
562-571
Electronic Edition (link) BibTeX
- Conrado Martínez, Xavier Molinero:
Generic Algorithms for the Generation of Combinatorial Objects.
572-581
Electronic Edition (link) BibTeX
- Klaus Meer:
On the Complexity of Some Problems in Interval Arithmetic.
582-591
Electronic Edition (link) BibTeX
- Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos:
An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources.
592-601
Electronic Edition (link) BibTeX
- Wolfgang Merkle, Jan Reimann:
On Selection Functions that Do Not Preserve Normality.
602-611
Electronic Edition (link) BibTeX
- Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On Converting CNF to DNF.
612-621
Electronic Edition (link) BibTeX
- Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
622-631
Electronic Edition (link) BibTeX
- Steffen Reith:
On the Complexity of Some Equivalence Problems for Propositional Calculi.
632-641
Electronic Edition (link) BibTeX
- Stéphane Riedweg, Sophie Pinchinat:
Quantified Mu-Calculus for Control Synthesis.
642-651
Electronic Edition (link) BibTeX
- Marcin Rychlik:
On Probabilistic Quantified Satisfability Games.
652-661
Electronic Edition (link) BibTeX
- Saeed Salehi:
A Completeness Property of Wilke's Tree Algebras.
662-670
Electronic Edition (link) BibTeX
- Philipp Woelfel:
Symbolic Topological Sorting with OBDDS.
671-680
Electronic Edition (link) BibTeX
- Xizhong Zheng, Robert Rettinger, Romain Gengler:
Ershov's Hierarchy of Real Numbers.
681-690
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:29:34 2009
by Michael Ley (ley@uni-trier.de)
