Buhrman, Harry Matthijs
9  results:
Search for persons X
?
1

Computing with a full memory : catalytic space:

, In: Proceedings of the forty-sixth annual ACM symposium on Theory of computing,
Buhrman, Harry ; Cleve, Richard ; Koucký, Michal.. - p. 857-866 , 2014
 
?
2

The garden-hose model:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,
 
?
3

Quantum verification of matrix products:

, In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm,
Buhrman, Harry ; Špalek, Robert - p. 880-889 , 2006
 
?
4

Quantum property testing:

, In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms,
Buhrman, Harry ; Fortnow, Lance ; Newman, Ilan. - p. 480-488 , 2003
 
?
5

NP might not be as easy as detecting unique solutions:

, In: Proceedings of the thirtieth annual ACM symposium on Theory of computing,
 
?
6

Mutual search:

, In: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms,
Buhrman, Harry ; Franklin, Matthew ; Garay, Juan A.... - p. 481-489 , 1998
 
?
7

Quantum vs. classical communication and computation:

, In: Proceedings of the thirtieth annual ACM symposium on Theory of computing,
 
?
8

Optimal routing tables:

, In: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing,
 
?
9

Long-lived renaming made fast:

, In: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing,
 
1-9