default search action
28. MFCS 2003: Bratislava, Slovak Republic
- Branislav Rovan, Peter Vojtás:
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
Invited Talks
- Harry Buhrman, Hein Röhrig:
Distributed Quantum Computing. 1-20 - Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. 21-45 - Roberto Gorrieri, Fabio Martinelli:
Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols. 46-67 - Jo Erskine Hannay, Shin-ya Katsumata
, Donald Sannella
Semantic and Syntactic Approaches to Simulation Relations. 68-91 - Giancarlo Mauri, Alberto Leporati:
On the Computational Complexity of Conservative Computing. 92-112 - Wolfgang Thomas:
Constructing Infinite Graphs with a Decidable MSO-Theory. 113-124 - Ingo Wegener:
Towards a Theory of Randomized Search Heuristics. 125-141
Contributed Papers
- Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
Adversarial Models for Priority-Based Networks. 142-151 - Kazuyuki Amano, Akira Maruoka:
On Optimal Merging Networks. 152-161 - Klaus Ambos-Spies:
Problems with Cannot Be Reduced to Any Proper Subproblems. 162-168 - Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable. 169-178 - Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes. 179-188 - Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara
On the Length of the Minimum Solution of Word Equations in One Variable. 189-197 - Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems. 198-207 - Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
Inferring Strings from Graphs and Arrays. 208-217 - Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. 218-227 - François Blanchard, Julien Cervelle, Enrico Formenti
Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. 228-238 - Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. 239-248 - Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM. 249-258 - Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. 259-268 - Michele Boreale, Maria Grazia Buscemi:
Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. 269-278 - Michele Boreale, Fabio Gadducci:
Denotational Testing Semantics in Coinductive Form. 279-289 - Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. 290-299 - Antonio Bucciarelli, Antonino Salibra:
The Minimal Graph Model of Lambda Calculus. 300-307 - Olivier Carton
Unambiguous Automata on Bi-infinite Words. 308-317 - Ivana Cerná, Radek Pelánek:
Relating Hierarchy of Temporal Properties to Model Checking. 318-327 - Hubie Chen:
Arithmetic Constant-Depth Circuit Complexity Classes. 328-337 - Hubie Chen:
Inverse NP Problems. 338-347 - Zhi-Zhong Chen, Mitsuharu Kouno:
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. 348-357 - Víctor Dalmau, Daniel K. Ford:
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. 358-367 - Gianluca De Marco, Andrzej Pelc:
Randomized Algorithms for Determining the Majority on Graphs. 368-377 - Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas:
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. 378-387 - Jean-Pierre Duval, Roman Kolpakov
Linear-Time Computation of Local Periods. 388-397 - Leah Epstein:
Two Dimensional Packing: The Power of Rotation. 398-407 - Leah Epstein, Tamir Tassa:
Approximation Schemes for the Min-Max Starting Time Problem. 408-418 - Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum Testers for Hidden Group Properties. 419-428 - Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. 429-438 - Paul Gastin, Denis Oddoux:
LTL with Past and Two-Way Very-Weak Alternating Automata. 439-448 - Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems. 449-459 - Gregor Gramlich:
Probabilistic and Nondeterministic Unary Automata. 460-469 - Petr Hlinený:
On Matroid Properties Definable in the MSO Logic. 470-479 - Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems. 480-489 - Toshimasa Ishii, Masayuki Hagiwara:
Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. 490-499 - Piotr Krysta, Peter Sanders, Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability. 500-510 - Miroslaw Kutylowski, Daniel Letkiewicz:
Computing Average Value in Ad Hoc Networks. 511-520 - Slawomir Lasota:
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. 521-530 - Christof Löding, Philipp Rohde:
Solving the Sabotage Game Is PSPACE-Hard. 531-540 - Yann Loyer, Umberto Straccia:
The Approximate Well-Founded Semantics for Logic Programs with Uncertainty. 541-550 - Thomas Lücking, Marios Mavronicolas
Which Is the Worst-Case Nash Equilibrium? 551-561 - Bas Luttik:
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. 562-571 - Conrado Martínez, Xavier Molinero:
Generic Algorithms for the Generation of Combinatorial Objects. 572-581 - Klaus Meer:
On the Complexity of Some Problems in Interval Arithmetic. 582-591 - Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos:
An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources. 592-601 - Wolfgang Merkle, Jan Reimann:
On Selection Functions that Do Not Preserve Normality. 602-611 - Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On Converting CNF to DNF. 612-621 - 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 - Steffen Reith:
On the Complexity of Some Equivalence Problems for Propositional Calculi. 632-641 - Stéphane Riedweg, Sophie Pinchinat:
Quantified Mu-Calculus for Control Synthesis. 642-651 - Marcin Rychlik:
On Probabilistic Quantified Satisfability Games. 652-661 - Saeed Salehi
A Completeness Property of Wilke's Tree Algebras. 662-670 - Philipp Woelfel:
Symbolic Topological Sorting with OBDDS. 671-680 - Xizhong Zheng, Robert Rettinger, Romain Gengler:
Ershov's Hierarchy of Real Numbers. 681-690
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-18 18:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: