Hartmut Klauck
- Lower bounds for quantum communication complexity
2001/06/28 by Hartmut Klauck, Klauck, Hartmut · 5 citations
Computer Science · Physics and Astronomy · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Quantum Computing Algorithms and Architecture #quant-ph
- Can Quantum Communication Speed Up Distributed Computation?
2012/07/22 by Michael Elkin, Hartmut Klauck, Elkin, Michael +5 · 2 citations
Computer Science · #C.2.4 #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #F.0 #F.2.2 #FOS: Computer and information sciences #FOS: Physical sciences #G.2.2 #Parallel #Quantum Physics (quant-ph) #and Cluster Computing (cs.DC)
- Rectangle Size Bounds and Threshold Covers in Communication Complexity
2002/08/05 by Hartmut Klauck, Klauck, Hartmut · 2 citations
Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #cs.CC
- Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
2004/02/18 by Hartmut Klauck, Robert Špalek, Robert Spalek +4 · 1 citation
Computer Science · Physics and Astronomy · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Quantum Computing Algorithms and Architecture #cs.CC #quant-ph
- The Partition Bound for Classical Communication Complexity and Query Complexity
2009/10/22 by Rahul Jain, Jain, Rahul, Hartmut Klauck +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #Quantum Computing Algorithms and Architecture