![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Erik Vee Ronald Fagin , Ravi Kumar , Mohammad Mahdian , D. Sivakumar , Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004 : 47-58 Paul Beame , Michael E. Saks , Xiaodong Sun , Erik Vee: Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50 (2): 154-195 (2003) Paul Beame , Erik Vee: Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. IEEE Conference on Computational Complexity 2002 : 18 Paul Beame , Erik Vee: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. STOC 2002 : 688-697 Paul Beame , Michael E. Saks , Xiaodong Sun , Erik Vee: Super-linear time-space tradeoff lower bounds for randomized computation. FOCS 2000 : 169-179 Paul Beame , Michael E. Saks , Xiaodong Sun , Erik Vee: Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation Electronic Colloquium on Computational Complexity (ECCC) 7 (25): (2000) 1 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] 2 [ 6 ] 3 [ 6 ] 4 [ 6 ] 5 [ 1 ] [ 2 ] [ 5 ] 6 [ 6 ] 7 [ 1 ] [ 2 ] [ 5 ] ![]() ©2005 Association for Computing Machinery |