default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHartmut Klauck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c34]Hartmut Klauck, Debbie Lim:
The Power of One Clean Qubit in Communication Complexity. MFCS 2021: 69:1-69:23- 2020
- [j9]Rahul Jain
, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020)
2010 – 2019
- 2019
- [i31]Hartmut Klauck, Debbie Lim:
The aBc Problem and Equator Sampling Renyi Divergences. CoRR abs/1912.11275 (2019) - 2018
- [c33]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [i30]Hartmut Klauck, Debbie Lim:
The Power of One Clean Qubit in Communication Complexity. CoRR abs/1807.07762 (2018) - 2017
- [c32]Hartmut Klauck:
The Complexity of Quantum Disjointness. MFCS 2017: 15:1-15:13 - [i29]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i28]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2015
- [c31]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Correlation in Hard Distributions in Communication Complexity. APPROX-RANDOM 2015: 544-572 - [c30]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Equality, Revisited. MFCS (2) 2015: 127-138 - [c29]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Computation of Large-scale Graph Problems. SODA 2015: 391-410 - [i27]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Correlation in Hard Distributions in Communication Complexity. CoRR abs/1508.05189 (2015) - [i26]Ralph C. Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Equality, Revisited. CoRR abs/1511.01211 (2015) - [i25]Hartmut Klauck, Troy Lee, Dirk Oliver Theis, Rekha R. Thomas:
Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). Dagstuhl Reports 5(2): 109-127 (2015) - 2014
- [c28]Hartmut Klauck, Supartha Podder:
New Bounds for the Garden-Hose Model. FSTTCS 2014: 481-492 - [c27]Hartmut Klauck, Ved Prakash:
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. ICALP (1) 2014: 919-930 - [c26]Hartmut Klauck, Supartha Podder:
Two Results about Quantum Messages. MFCS (2) 2014: 445-456 - [c25]Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Can quantum communication speed up distributed computation? PODC 2014: 166-175 - [i24]Hartmut Klauck, Supartha Podder:
Two Results about Quantum Messages. CoRR abs/1402.4312 (2014) - [i23]Hartmut Klauck, Ved Prakash:
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. CoRR abs/1402.6800 (2014) - [i22]Hartmut Klauck, Supartha Podder:
New Bounds for the Garden-Hose Model. CoRR abs/1412.4904 (2014) - 2013
- [c24]Hartmut Klauck, Ved Prakash:
Streaming computations with a loquacious prover. ITCS 2013: 305-320 - [c23]Hartmut Klauck, Ronald de Wolf:
Fooling One-Sided Quantum Protocols. STACS 2013: 424-433 - [i21]LeRoy Beasely, Troy Lee, Hartmut Klauck, Dirk Oliver Theis:
Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices. CoRR abs/1305.4147 (2013) - [i20]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
The Distributed Complexity of Large-scale Graph Processing. CoRR abs/1311.6209 (2013) - [i19]LeRoy B. Beasley, Hartmut Klauck, Troy Lee, Dirk Oliver Theis:
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Reports 3(2): 127-143 (2013) - 2012
- [c22]Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf:
New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS 2012: 148-159 - [i18]Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf:
New bounds on the classical and quantum communication complexity of some graph properties. CoRR abs/1204.4596 (2012) - [i17]Hartmut Klauck, Ronald de Wolf:
Fooling One-Sided Quantum Protocols. CoRR abs/1204.4619 (2012) - [i16]Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Quantum Distributed Network Computing: Lower Bounds and Techniques. CoRR abs/1207.5211 (2012) - 2011
- [c21]Hartmut Klauck:
On Arthur Merlin Games in Communication Complexity. CCC 2011: 189-199 - [i15]Hartmut Klauck:
On Arthur Merlin Games in Communication Complexity. CoRR abs/1101.0523 (2011) - 2010
- [j8]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010) - [c20]Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CCC 2010: 247-258 - [c19]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59 - [c18]Hartmut Klauck:
A strong direct product theorem for disjointness. STOC 2010: 77-86 - [i14]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity. CoRR abs/1004.0105 (2010)
2000 – 2009
- 2009
- [c17]Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. CCC 2009: 369-378 - [i13]Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model. CoRR abs/0902.3056 (2009) - [i12]Hartmut Klauck:
A Strong Direct Product Theorem for Disjointness. CoRR abs/0908.2940 (2009) - [i11]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (2009) - [i10]Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CoRR abs/0910.4266 (2009) - 2008
- [c16]Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608 - 2007
- [j7]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual communication complexity. J. Comput. Syst. Sci. 73(6): 973-985 (2007) - [j6]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36(5): 1472-1493 (2007) - [j5]Hartmut Klauck:
Lower Bounds for Quantum Communication Complexity. SIAM J. Comput. 37(1): 20-46 (2007) - [j4]Hartmut Klauck:
One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. SIAM J. Comput. 37(2): 552-583 (2007) - [j3]Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
Interaction in Quantum Communication. IEEE Trans. Inf. Theory 53(6): 1970-1982 (2007) - [i9]Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. TR07 (2007) - 2004
- [j2]Hartmut Klauck:
Quantum and Approximate Privacy. Theory Comput. Syst. 37(1): 221-246 (2004) - [c15]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS 2004: 12-21 - [c14]Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. FSTTCS 2004: 384-395 - [c13]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30 - [i8]Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. CoRR abs/quant-ph/0412088 (2004) - [i7]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. CoRR quant-ph/0402123 (2004) - [i6]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c12]Hartmut Klauck:
Rectangle Size Bounds and Threshold Covers in Communication Complexity. CCC 2003: 118-134 - [c11]Hartmut Klauck:
Quantum time-space tradeoffs for sorting. STOC 2003: 69-76 - [i5]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity. CoRR cs.CC/0304012 (2003) - 2002
- [j1]Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger:
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172(2): 202-217 (2002) - [c10]Hartmut Klauck:
On Quantum and Approximate Privacy. STACS 2002: 335-346 - [i4]Hartmut Klauck:
Rectangle Size Bounds and Threshold Covers in Communication Complexity. CoRR cs.CC/0208006 (2002) - [i3]Hartmut Klauck:
Quantum Time-Space Tradeoffs for Sorting. CoRR quant-ph/0211174 (2002) - 2001
- [c9]Hartmut Klauck:
Algorithms for Parity Games. Automata, Logics, and Infinite Games 2001: 107-129 - [c8]Hartmut Klauck:
Lower Bounds for Quantum Communication Complexity. FOCS 2001: 288-297 - [c7]Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133 - [i2]Hartmut Klauck:
One-way communication complexity and the Neciporuk lower bound on formula size. CoRR cs.CC/0111062 (2001) - 2000
- [b1]Hartmut Klauck:
Über beschränkte Interaktion in der Kommunikationskomplexität. Goethe University Frankfurt, Frankfurt am Main, Germany, 2000, pp. 1-148 - [c6]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210 - [c5]Hartmut Klauck:
Quantum Communication Complexity. ICALP Satellite Workshops 2000: 241-252 - [c4]Hartmut Klauck:
On quantum and probabilistic communication: Las Vegas and one-way protocols. STOC 2000: 644-651 - [i1]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1998
- [c3]Hartmut Klauck:
Lower Bounds for Computation with Limited Nondeterminism. CCC 1998: 141- - 1997
- [c2]Hartmut Klauck:
On the Size of Probabilistic Formulae. ISAAC 1997: 243-252 - 1996
- [c1]Hartmut Klauck:
On the Hardness of Global and Local Approximation. SWAT 1996: 88-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
