The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Marcin Bienkowski, Friedhelm Meyer auf der Heide
    Page Migration in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:1-14 [Conf]
  2. Rusins Freivalds
    Knot Theory, Jones Polynomial and Quantum Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:15-25 [Conf]
  3. Yuri Gurevich
    Interactive Algorithms 2005. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:26-38 [Conf]
  4. Oscar H. Ibarra
    Some Computational Issues in Membrane Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:39-51 [Conf]
  5. Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
    The Generalization of Dirac's Theorem for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:52-56 [Conf]
  6. Andrew Chi-Chih Yao
    On the Communication Complexity of Co-linearity Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:57- [Conf]
  7. Wieslaw Zielonka
    An Invitation to Play. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:58-70 [Conf]
  8. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
    The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:71-82 [Conf]
  9. César Luis Alonso, José Luis Montaña, Luis Miguel Pardo
    On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:83-94 [Conf]
  10. Carme Àlvarez, Joaquim Gabarró, Maria J. Serna
    Pure Nash Equilibria in Games with a Large Number of Actions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:95-106 [Conf]
  11. Kazuyuki Amano, Akira Maruoka
    On the Complexity of Depth-2 Circuits with Threshold Gates. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:107-118 [Conf]
  12. Michael Bauland, Edith Hemaspaandra
    Isomorphic Implication. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:119-130 [Conf]
  13. Valérie Berthé, Michel Rigo
    Abstract Numeration Systems and Tilings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:131-143 [Conf]
  14. Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna
    Adversarial Queueing Model for Continuous Network Dynamics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:144-155 [Conf]
  15. Julia Böttcher
    Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:156-167 [Conf]
  16. Arnaud Carayol
    Regular Sets of Higher-Order Pushdown Stacks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:168-179 [Conf]
  17. Arnaud Carayol, Antoine Meyer
    Linearly Bounded Infinite Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:180-191 [Conf]
  18. Julien Cervelle, Enrico Formenti, Benoît Masson
    Basic Properties for Sand Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:192-211 [Conf]
  19. Jérémie Chalopin, Yves Métivier
    A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:212-223 [Conf]
  20. Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
    Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:224-235 [Conf]
  21. Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong
    New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:236-247 [Conf]
  22. Ho-Lun Cheng, Tony Tan
    Approximating Polygonal Objects by Deformable Smooth Surfaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:248-259 [Conf]
  23. Dimitri Chubarov, Andrei Voronkov
    Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:260-270 [Conf]
  24. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
    Asynchronous Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:271-282 [Conf]
  25. David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser
    Zeta-Dimension. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:283-294 [Conf]
  26. Leah Epstein, Meital Levy
    Online Interval Coloring with Packing Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:295-307 [Conf]
  27. Piotr Faliszewski, Mitsunori Ogihara
    Separating the Notions of Self- and Autoreducibility. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:308-315 [Conf]
  28. Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry
    Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:316-327 [Conf]
  29. Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:328-339 [Conf]
  30. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
    Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:340-351 [Conf]
  31. Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
    Packing Weighted Rectangles into a Square. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:352-363 [Conf]
  32. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
    Nondeterministic Graph Searching: From Pathwidth to Treewidth. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:364-375 [Conf]
  33. Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro
    Goals in the Propositional Horn Language Are Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:376-386 [Conf]
  34. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, Mitoticity, and Immunity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:387-398 [Conf]
  35. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Canonical Disjoint NP-Pairs of Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:399-409 [Conf]
  36. Judy Goldsmith, Matthias Hagen, Martin Mundhenk
    Complexity of DNF and Isomorphism of Monotone Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:410-421 [Conf]
  37. Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    The Expressive Power of Two-Variable Least Fixed-Point Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:422-434 [Conf]
  38. Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov
    Languages Representable by Vertex-Labeled Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:435-446 [Conf]
  39. Leonid Gurvits
    On the Complexity of Mixed Discriminants and Related Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:447-458 [Conf]
  40. Uffe Flarup Hansen, Klaus Meer
    Two Logical Hierarchies of Optimization Problems over the Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:459-470 [Conf]
  41. Bernhard Heinemann
    Algebras as Knowledge Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:471-482 [Conf]
  42. André Hernich, Arfst Nickelsen
    Combining Self-reducibility and Partial Information Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:483-494 [Conf]
  43. Paul Hunter, Anuj Dawar
    Complexity Bounds for Regular Games. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:495-506 [Conf]
  44. Ryszard Janicki
    Basic Mereology with Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:507-519 [Conf]
  45. Jesper Jansson, Zeshan Peng
    Online and Dynamic Recognition of Squarefree Strings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:520-531 [Conf]
  46. Tomasz Jurdzinski, Friedrich Otto
    Shrinking Restarting Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:532-543 [Conf]
  47. Christos A. Kapoutsis
    Removing Bidirectionality from Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:544-555 [Conf]
  48. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:556-567 [Conf]
  49. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    On the Parameterized Complexity of Exact Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:568-579 [Conf]
  50. Petr Kolman
    Approximating Reversal Distance for Strings with Bounded Number of Duplicates. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:580-590 [Conf]
  51. Konstantin Korovin, Andrei Voronkov
    Random Databases and Threshold for Monotone Non-recursive Datalog. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:591-602 [Conf]
  52. Daniel Král, Ondrej Pangrác
    An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:603-614 [Conf]
  53. Piotr Krysta
    Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:615-627 [Conf]
  54. Fredrik Kuivinen
    Tight Approximability Results for the Maximum Solution Equation Problem over Zp. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:628-639 [Conf]
  55. Martin Lange, Rafal Somla
    The Complexity of Model Checking Higher Order Fixpoint Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:640-651 [Conf]
  56. Minming Li, Frances F. Yao
    An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:652-663 [Conf]
  57. Markus Lohrey, Nicole Ondrusch
    Inverse Monoids: Decidability and Complexity of Algebraic Questions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:664-675 [Conf]
  58. María López-Valdés, Elvira Mayordomo
    Dimension Is Compression. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:676-685 [Conf]
  59. Rémi Morin
    Concurrent Automata vs. Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:686-698 [Conf]
  60. Hidenosuke Nishio
    Completeness and Degeneracy in Information Dynamics of Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:699-707 [Conf]
  61. Alexander Okhotin
    Strict Language Inequalities and Their Decision Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:708-719 [Conf]
  62. G. Michele Pinna
    Event Structures for the Collective Tokens Philosophy of Inhibitor Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:720-732 [Conf]
  63. Tobias Riege, Jörg Rothe
    An Exact 2.9416n Algorithm for the Three Domatic Number Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:733-744 [Conf]
  64. Mohammad Ali Safari
    D-Width: A More Natural Measure for Directed Tree Width. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:745-756 [Conf]
  65. Jakob Grue Simonsen
    On Beta-Shifts Having Arithmetical Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:757-768 [Conf]
  66. Jaco van de Pol, Olga Tveretina
    A BDD-Representation for the Logic of Equality and Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:769-780 [Conf]
  67. Falk Unger
    On Small Hard Leaf Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:781-792 [Conf]
  68. Virginia Vassilevska
    Explicit Inapproximability Bounds for the Shortest Superstring Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:793-800 [Conf]
  69. Michal Wrona
    Stratified Boolean Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:801-812 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002