The SCEAS System
Navigation Menu

Conferences in DBLP

Fundamentals of Computation Theory (FCT) (fct)
2003 (conf/fct/2003)

  1. Sanjeev Arora
    Proving Integrality Gaps without Knowing the Linear Program. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:1- [Conf]
  2. Takao Asano
    An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:2-14 [Conf]
  3. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
    Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:15-26 [Conf]
  4. Miroslav Chlebík, Janka Chlebíková
    Inapproximability Results for Bounded Variants of Optimization Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:27-38 [Conf]
  5. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:39-48 [Conf]
  6. Monaldo Mastrolilli
    Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:49-60 [Conf]
  7. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:61-72 [Conf]
  8. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:73-85 [Conf]
  9. Joachim Gudmundsson
    Constructing Sparse t-Spanners with Small Separators. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:86-97 [Conf]
  10. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis
    Composing Equipotent Teams. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:98-108 [Conf]
  11. Ivan Damgård, Gudmund Skovbjerg Frandsen
    Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:109-117 [Conf]
  12. Ivan Damgård, Gudmund Skovbjerg Frandsen
    An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:118-131 [Conf]
  13. Marcin Kik
    Periodic Multisorting Comparator Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:132-143 [Conf]
  14. Grzegorz Stachowiak
    Fast Periodic Correction Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:144-156 [Conf]
  15. Christos H. Papadimitriou
    Games and Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:157- [Conf]
  16. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
    One-Way Communication Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:158-170 [Conf]
  17. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on Cylinders. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:171-182 [Conf]
  18. Peter Damaschke
    Fast Perfect Phylogeny Haplotype Inference. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:183-194 [Conf]
  19. Jens Gramm, Jiong Guo, Rolf Niedermeier
    On Exact and Approximation Algorithms for Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:195-209 [Conf]
  20. Patricia A. Evans, Andrew D. Smith
    Complexity of Approximating Closest Substring Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:210-221 [Conf]
  21. Binhai Zhu
    On Lawson's Oriented Walk in Random Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:222-233 [Conf]
  22. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    Competitive Exploration of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:234-245 [Conf]
  23. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    An Improved Approximation Algorithm for Computing Geometric Shortest Paths. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:246-257 [Conf]
  24. Zheng Sun, John H. Reif
    Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:258-270 [Conf]
  25. John H. Reif, Zheng Sun
    On Boundaries of Highly Visible Spaces and Applications. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:271-283 [Conf]
  26. Gheorghe Paun
    Membrane Computing. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:284-295 [Conf]
  27. Farid M. Ablayev, Aida Gainutdinova
    Classical Simulation Complexity of Quantum Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:296-302 [Conf]
  28. Luis Antunes, Lance Fortnow, N. V. Vinodchandran
    Using Depth to Capture Average-Case Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:303-310 [Conf]
  29. Richard J. Lipton, Anastasios Viglas
    Non-uniform Depth of Polynomial Time and Space Simulations. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:311-320 [Conf]
  30. Martin Kutrib
    Dimension- and Time-Hierarchies for Small Time Bounds. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:321-332 [Conf]
  31. Philippe Moser
    Baire's Categories on Small Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:333-342 [Conf]
  32. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
    Operations Preserving Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:343-354 [Conf]
  33. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
    Languages Defined by Generalized Equality Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:355-363 [Conf]
  34. Michele Bugliesi, Ambra Ceccato, Sabina Rossi
    Context-Sensitive Equivalences for Non-interference Based Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:364-375 [Conf]
  35. Werner Kuich, Klaus W. Wagner
    On the Exponentiation of Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:376-386 [Conf]
  36. Christian Pech
    Kleene's Theorem for Weighted Tree-Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:387-399 [Conf]
  37. Till Tantau
    Weak Cardinality Theorems for First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:400-411 [Conf]
  38. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:412-422 [Conf]
  39. Andrzej Szalas
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:423-431 [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