Tradeoff lower lounds for stack machines | 0 | 0.34 | 2014 |
Computationally Limited Randomness. | 0 | 0.34 | 2011 |
SHRiMP2: sensitive yet practical SHort Read Mapping. | 44 | 2.00 | 2011 |
Separating Deterministic from Randomized Multiparty Communication Complexity | 2 | 0.36 | 2010 |
Polynomial Time with Restricted Use of Randomness | 0 | 0.34 | 2009 |
Separating NOF communication complexity classes RP and NP | 2 | 0.38 | 2008 |
Separating deterministic from nondeterministic nof multiparty communication complexity | 4 | 0.56 | 2007 |
Restricted Stack Implementations | 2 | 0.40 | 2005 |
Brief announcement: a single enqueuer wait-free queue implementation | 1 | 0.41 | 2004 |