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

Search the dblp DataBase

Title:
Author:
Hartmut Klauck: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hartmut Klauck
    Rectangle Size Bounds and Threshold Covers in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:118-134 [Conf]
  2. Hartmut Klauck
    Lower Bounds for Computation with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:141-0 [Conf]
  3. Hartmut Klauck
    Algorithms for Parity Games. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:107-129 [Conf]
  4. Hartmut Klauck
    Lower Bounds for Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:288-297 [Conf]
  5. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:12-21 [Conf]
  6. Hartmut Klauck
    Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:384-395 [Conf]
  7. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:199-210 [Conf]
  8. Hartmut Klauck
    Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:241-252 [Conf]
  9. Hartmut Klauck
    On the Size of Probabilistic Formulae. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:243-252 [Conf]
  10. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual Communication Complexity: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:19-30 [Conf]
  11. Hartmut Klauck
    On Quantum and Approximate Privacy. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:335-346 [Conf]
  12. Hartmut Klauck
    On quantum and probabilistic communication: Las Vegas and one-way protocols. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:644-651 [Conf]
  13. Hartmut Klauck
    Quantum time-space tradeoffs for sorting. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:69-76 [Conf]
  14. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in quantum communication and the complexity of set disjointness. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:124-133 [Conf]
  15. Hartmut Klauck
    On the Hardness of Global and Local Approximation. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:88-99 [Conf]
  16. Hartmut Klauck
    One-way communication complexity and the Neciporuk lower bound on formula size [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  17. Hartmut Klauck
    Rectangle Size Bounds and Threshold Covers in Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  18. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  19. Hartmut Klauck
    Quantum Time-Space Tradeoffs for Sorting [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  20. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  21. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:76, pp:- [Journal]
  22. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:045, pp:- [Journal]
  23. Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
    Communication Complexity Method for Measuring Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:172, n:2, pp:202-217 [Journal]
  24. Hartmut Klauck
    Quantum and Approximate Privacy. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:221-246 [Journal]
  25. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1472-1493 [Journal]
  26. Hartmut Klauck
    Lower Bounds for Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:20-46 [Journal]
  27. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:1970-1982 [Journal]
  28. Hartmut Klauck
    Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual communication complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:973-985 [Journal]
  30. Hartmut Klauck
    One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:552-583 [Journal]

  31. New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. [Citation Graph (, )][DBLP]


  32. The Partition Bound for Classical Communication Complexity and Query Complexity. [Citation Graph (, )][DBLP]


  33. Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. [Citation Graph (, )][DBLP]


  34. Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. [Citation Graph (, )][DBLP]


  35. A strong direct product theorem for disjointness. [Citation Graph (, )][DBLP]


  36. New Results in the Simultaneous Message Passing Model [Citation Graph (, )][DBLP]


  37. A Strong Direct Product Theorem for Disjointness [Citation Graph (, )][DBLP]


  38. Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas [Citation Graph (, )][DBLP]


  39. The Partition Bound for Classical Communication Complexity and Query Complexity [Citation Graph (, )][DBLP]


  40. Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity [Citation Graph (, )][DBLP]


  41. Direct Product Theorems for Communication Complexity via Subdistribution Bounds. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.305secs
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