The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
2003 (conf/mfcs/2003)

  1. Harry Buhrman, Hein Röhrig
    Distributed Quantum Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:1-20 [Conf]
  2. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Selfish Routing in Non-cooperative Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:21-45 [Conf]
  3. Roberto Gorrieri, Fabio Martinelli
    Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:46-67 [Conf]
  4. Jo Erskine Hannay, Shin-ya Katsumata, Donald Sannella
    Semantic and Syntactic Approaches to Simulation Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:68-91 [Conf]
  5. Giancarlo Mauri, Alberto Leporati
    On the Computational Complexity of Conservative Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:92-112 [Conf]
  6. Wolfgang Thomas
    Constructing Infinite Graphs with a Decidable MSO-Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:113-124 [Conf]
  7. Ingo Wegener
    Towards a Theory of Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:125-141 [Conf]
  8. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna
    Adversarial Models for Priority-Based Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:142-151 [Conf]
  9. Kazuyuki Amano, Akira Maruoka
    On Optimal Merging Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:152-161 [Conf]
  10. Klaus Ambos-Spies
    Problems with Cannot Be Reduced to Any Proper Subproblems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:162-168 [Conf]
  11. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    ACID-Unification Is NEXPTIME-Decidable. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:169-178 [Conf]
  12. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in Differential Approximation Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:179-188 [Conf]
  13. Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
    On the Length of the Minimum Solution of Word Equations in One Variable. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:189-197 [Conf]
  14. Cyril Banderier, René Beier, Kurt Mehlhorn
    Smoothed Analysis of Three Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:198-207 [Conf]
  15. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Inferring Strings from Graphs and Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:208-217 [Conf]
  16. Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    Faster Algorithms for k-Medians in Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:218-227 [Conf]
  17. François Blanchard, Julien Cervelle, Enrico Formenti
    Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:228-238 [Conf]
  18. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
    Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:239-248 [Conf]
  19. Elmar Böhler, Christian Glaßer, Daniel Meister
    Error-Bounded Probabilistic Computations between MA and AM. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:249-258 [Conf]
  20. Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger
    A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:259-268 [Conf]
  21. Michele Boreale, Maria Grazia Buscemi
    Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:269-278 [Conf]
  22. Michele Boreale, Fabio Gadducci
    Denotational Testing Semantics in Coinductive Form. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:279-289 [Conf]
  23. Henrik Brosenne, Matthias Homeister, Stephan Waack
    Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:290-299 [Conf]
  24. Antonio Bucciarelli, Antonino Salibra
    The Minimal Graph Model of Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:300-307 [Conf]
  25. Olivier Carton
    Unambiguous Automata on Bi-infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:308-317 [Conf]
  26. Ivana Cerná, Radek Pelánek
    Relating Hierarchy of Temporal Properties to Model Checking. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:318-327 [Conf]
  27. Hubie Chen
    Arithmetic Constant-Depth Circuit Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:328-337 [Conf]
  28. Hubie Chen
    Inverse NP Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:338-347 [Conf]
  29. Zhi-Zhong Chen, Mitsuharu Kouno
    A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:348-357 [Conf]
  30. Víctor Dalmau, Daniel K. Ford
    Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:358-367 [Conf]
  31. Gianluca De Marco, Andrzej Pelc
    Randomized Algorithms for Determining the Majority on Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:368-377 [Conf]
  32. Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas
    Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:378-387 [Conf]
  33. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-Time Computation of Local Periods. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:388-397 [Conf]
  34. Leah Epstein
    Two Dimensional Packing: The Power of Rotation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:398-407 [Conf]
  35. Leah Epstein, Tamir Tassa
    Approximation Schemes for the Min-Max Starting Time Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:408-418 [Conf]
  36. Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
    Quantum Testers for Hidden Group Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:419-428 [Conf]
  37. Paul Gastin, Madhavan Mukund, K. Narayan Kumar
    Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:429-438 [Conf]
  38. Paul Gastin, Denis Oddoux
    LTL with Past and Two-Way Very-Weak Alternating Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:439-448 [Conf]
  39. Alfons Geser, Dieter Hofbauer, Johannes Waldmann
    Match-Bounded String Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:449-459 [Conf]
  40. Gregor Gramlich
    Probabilistic and Nondeterministic Unary Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:460-469 [Conf]
  41. Petr Hlinený
    On Matroid Properties Definable in the MSO Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:470-479 [Conf]
  42. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena
    Characterizations of Catalytic Membrane Computing Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:480-489 [Conf]
  43. Toshimasa Ishii, Masayuki Hagiwara
    Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:490-499 [Conf]
  44. Piotr Krysta, Peter Sanders, Berthold Vöcking
    Scheduling and Traffic Allocation for Tasks with Bounded Splittability. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:500-510 [Conf]
  45. Miroslaw Kutylowski, Daniel Letkiewicz
    Computing Average Value in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:511-520 [Conf]
  46. Slawomir Lasota
    A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:521-530 [Conf]
  47. Christof Löding, Philipp Rohde
    Solving the Sabotage Game Is PSPACE-Hard. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:531-540 [Conf]
  48. Yann Loyer, Umberto Straccia
    The Approximate Well-Founded Semantics for Logic Programs with Uncertainty. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:541-550 [Conf]
  49. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
    Which Is the Worst-Case Nash Equilibrium? [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:551-561 [Conf]
  50. Bas Luttik
    A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:562-571 [Conf]
  51. Conrado Martínez, Xavier Molinero
    Generic Algorithms for the Generation of Combinatorial Objects. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:572-581 [Conf]
  52. Klaus Meer
    On the Complexity of Some Problems in Interval Arithmetic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:582-591 [Conf]
  53. Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos
    An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:592-601 [Conf]
  54. Wolfgang Merkle, Jan Reimann
    On Selection Functions that Do Not Preserve Normality. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:602-611 [Conf]
  55. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:612-621 [Conf]
  56. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:622-631 [Conf]
  57. Steffen Reith
    On the Complexity of Some Equivalence Problems for Propositional Calculi. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:632-641 [Conf]
  58. Stéphane Riedweg, Sophie Pinchinat
    Quantified Mu-Calculus for Control Synthesis. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:642-651 [Conf]
  59. Marcin Rychlik
    On Probabilistic Quantified Satisfability Games. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:652-661 [Conf]
  60. Saeed Salehi
    A Completeness Property of Wilke's Tree Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:662-670 [Conf]
  61. Philipp Woelfel
    Symbolic Topological Sorting with OBDDS. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:671-680 [Conf]
  62. Xizhong Zheng, Robert Rettinger, Romain Gengler
    Ershov's Hierarchy of Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:681-690 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002