The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Martin Grohe, Christoph Koch, Nicole Schweikardt
    The Complexity of Querying External Memory and Streaming Data. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:1-16 [Conf]
  2. Daniel A. Spielman
    The Smoothed Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:17-18 [Conf]
  3. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Path Coupling Using Stopping Times. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:19-31 [Conf]
  4. Matthias P. Krieger
    On the Incompressibility of Monotone DNFs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:32-43 [Conf]
  5. Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
    Bounds on the Power of Constant-Depth Quantum Circuits. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:44-55 [Conf]
  6. Michael Hoffmann 0002, Richard M. Thomas
    Biautomatic Semigroups. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:56-67 [Conf]
  7. Julien Cristau, Christof Löding, Wolfgang Thomas
    Deterministic Automata on Unranked Trees. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:68-79 [Conf]
  8. Daniel Meister
    Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:80-91 [Conf]
  9. Philippe Moser
    Generic Density and Small Span Theorem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:92-102 [Conf]
  10. Till Tantau
    Logspace Optimization Problems and Their Approximability Properties. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:103-114 [Conf]
  11. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
    A Faster and Simpler 2-Approximation Algorithm for Block Sorting. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:115-124 [Conf]
  12. Holger Spakowski, Rahul Tripathi
    On the Power of Unambiguity in Alternating Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:125-136 [Conf]
  13. Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
    Translational Lemmas for Alternating TMs and PRAMs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:137-148 [Conf]
  14. Tomoyuki Yamakami
    Collapsing Recursive Oracles for Relativized Polynomial Hierarchies. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:149-160 [Conf]
  15. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:161-171 [Conf]
  16. Jiong Guo, Rolf Niedermeier, Daniel Raible
    Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:172-184 [Conf]
  17. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
    Clique-Width for Four-Vertex Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:185-196 [Conf]
  18. Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
    On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:197-208 [Conf]
  19. Bernd Gärtner, Leo Rüst
    Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:209-220 [Conf]
  20. Hans-Ulrich Simon
    Perfect Reconstruction of Black Pixels Revisited. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:221-232 [Conf]
  21. Sheung-Hung Poon, Chan-Su Shin
    Adaptive Zooming in Point Set Labeling. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:233-244 [Conf]
  22. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
    On the Black-Box Complexity of Sperner's Lemma. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:245-257 [Conf]
  23. Beate Bollig
    Property Testing and the Branching Program Size of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:258-269 [Conf]
  24. Bogdan S. Chlebus, Dariusz R. Kowalski
    Almost Optimal Explicit Selectors. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:270-280 [Conf]
  25. Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
    The Delayed k-Server Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:281-292 [Conf]
  26. Tomasz Jurdzinski, Krzysztof Lorys
    Leftist Grammars and the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:293-304 [Conf]
  27. Markus Holzer, Friedrich Otto
    Shrinking Multi-pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:305-316 [Conf]
  28. Michael Brinkmeier
    A Simple and Fast Min-cut Algorithm. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:317-328 [Conf]
  29. Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
    (Non)-Approximability for the Multi-criteria TSP(1, 2). [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:329-340 [Conf]
  30. Pawel Waszkiewicz
    Completeness and Compactness of Quantitative Domains. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:341-351 [Conf]
  31. Aleksy Schubert
    A Self-dependency Constraint in the Simply Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:352-364 [Conf]
  32. Peeter Laud, Varmo Vene
    A Type System for Computationally Secure Information Flow. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:365-377 [Conf]
  33. Alexander Grigoriev, Hans L. Bodlaender
    Algorithms for Graphs Embeddable with Few Crossings Per Edge. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:378-387 [Conf]
  34. Jérôme Monnot, Sophie Toulouse
    Approximation Results for the Weighted P4 Partition Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:388-396 [Conf]
  35. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
    The Maximum Resource Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:397-408 [Conf]
  36. Birgit Schelm
    Average-Case Non-approximability of Optimisation Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:409-421 [Conf]
  37. Aduri Pavan, N. V. Vinodchandran
    Relations Between Average-Case and Worst-Case Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:422-432 [Conf]
  38. Joachim Giesen, Dieter Mitsche
    Reconstructing Many Partitions Using Spectral Techniques. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:433-444 [Conf]
  39. Akimitsu Ono, Shin-Ichi Nakano
    Constant Time Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:445-453 [Conf]
  40. Sven Köhler, Christian Schindelhauer, Martin Ziegler
    On Approximating Real-World Halting Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:454-466 [Conf]
  41. Klaus Meer, Martin Ziegler
    An Explicit Solution to Post's Problem over the Reals. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:467-478 [Conf]
  42. Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
    The Complexity of Semilinear Problems in Succinct Representation. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:479-490 [Conf]
  43. Kouichi Hirata, Megumi Kuwabara, Masateru Harao
    On Finding Acyclic Subhypergraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:491-503 [Conf]
  44. Markus Bläser, L. Shankar Ram
    An Improved Approximation Algorithm for TSP with Distances One and Two. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:504-515 [Conf]
  45. Andreas Brandstädt, Van Bang Le, Suhail Mahfud
    New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:516-527 [Conf]
  46. Benedikt Bollig
    On the Expressiveness of Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:528-539 [Conf]
  47. Julien Bernet, David Janin
    Tree Automata and Discrete Distributed Games. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:540-551 [Conf]
  48. Yo-Sub Han, Derick Wood
    A New Linearizing Restriction in the Pattern Matching Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:552-562 [Conf]
  49. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Fully Incremental LCS Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:563-574 [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