The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Till Tantau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard M. Karp, Till Nierhoff, Till Tantau
    Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:111-128 [Conf]
  2. Arfst Nickelsen, Till Tantau
    On Reachability in Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:554-563 [Conf]
  3. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Computation with Absolutely No Space Overhead. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:325-336 [Conf]
  4. Arfst Nickelsen, Till Tantau
    Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:299-310 [Conf]
  5. Till Tantau
    Weak Cardinality Theorems for First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:400-411 [Conf]
  6. Till Tantau
    Logspace Optimization Problems and Their Approximability Properties. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:103-114 [Conf]
  7. Klaus Didrich, Wolfgang Grieskamp, Florian Schintke, Till Tantau, Baltasar Trancón-y-Widemann
    Reflections in Opal - Meta Information in a Functional Programming Language. [Citation Graph (0, 0)][DBLP]
    IFL, 1999, pp:149-164 [Conf]
  8. Jens Gramm, Till Nierhoff, Till Tantau
    Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:174-186 [Conf]
  9. Till Tantau
    Towards a Cardinality Theorem for Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:625-636 [Conf]
  10. Till Tantau
    Comparing Verboseness for Finite Automata and Turing Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:465-476 [Conf]
  11. Till Tantau
    A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:326-337 [Conf]
  12. Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
    On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:92-102 [Conf]
  13. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Overhead-Free Computation, DCFLs, and CFLs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  14. Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau
    Haplotyping with missing data via perfect path phylogenies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:788-805 [Journal]
  15. Till Tantau
    On the Power of Extra Queries to Selective Languages [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:77, pp:- [Journal]
  16. Till Tantau
    A Note on the Complexity of the Reachability Problem for Tournaments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:092, pp:- [Journal]
  17. Till Tantau
    A Note on the Power of Extra Queries to Membership Comparable Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:004, pp:- [Journal]
  18. Till Tantau
    Weak Cardinality Theorems for First-Order Logic [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:024, pp:- [Journal]
  19. Till Tantau
    Logspace Optimisation Problems and their Approximation Properties [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:077, pp:- [Journal]
  20. Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker
    Aggregates with Component Size One Characterize Polynomial Space [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:028, pp:- [Journal]
  21. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Context-free languages can be accepted with absolutely no space overhead. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:2, pp:163-180 [Journal]
  22. Mitsunori Ogihara, Till Tantau
    On the reducibility of sets inside NP to sets with low information content. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:4, pp:499-524 [Journal]
  23. Till Tantau
    Comparing Verboseness for Finite Automata and Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:95-109 [Journal]
  24. Arfst Nickelsen, Till Tantau
    The Complexity of Finding Paths in Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1176-1195 [Journal]
  25. Till Tantau
    Query complexity of membership comparable sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:467-474 [Journal]
  26. Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
    On the Complexity of Kings. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:328-340 [Conf]
  27. Till Tantau
    Logspace Optimization Problems and Their Approximability Properties. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:327-350 [Journal]

  28. Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. [Citation Graph (, )][DBLP]


  29. Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. [Citation Graph (, )][DBLP]


  30. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. [Citation Graph (, )][DBLP]


  31. Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. [Citation Graph (, )][DBLP]


  32. Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. [Citation Graph (, )][DBLP]


  33. Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. [Citation Graph (, )][DBLP]


  34. Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. [Citation Graph (, )][DBLP]


  35. Fixed-Parameter Algorithms in Phylogenetics. [Citation Graph (, )][DBLP]


  36. On the complexity of SNP block partitioning under the perfect phylogeny model. [Citation Graph (, )][DBLP]


  37. Generalizations of the Hartmanis-Immerman-Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets. [Citation Graph (, )][DBLP]


  38. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. [Citation Graph (, )][DBLP]


  39. The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.044secs
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