Reingold, Edward M.
~ 400  Ergebnisse:
Personensuche X
?
1

Analysis of Boyer and Moore's MJRTY algorithm:

Alonso, Laurent ; Reingold, Edward M.
Information Processing Letters.  113 (2013)  13 - p. 495-497 , 2013
 
?
 
?
 
?
4

Improved bounds for cops-and-robber pursuit:

Alonso, Laurent ; Reingold, Edward M.
Computational Geometry.  44 (2011)  8 - p. 365-369 , 2011
 
?
5

Bounds for cops and robber pursuit:

Alonso, Laurent ; Reingold, Edward M.
Computational Geometry.  43 (2010)  9 - p. 749-766 , 2010
 
?
6

Average-case analysis of some plurality algorithms:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms.  5 (2009)  2 - p. 1-36 , 2009
 
?
7

Average-case analysis of some plurality algorithms:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms (TALG).  5 (2009)  2 - p. 1-36 , 2009
 
?
8

Average-case lower bounds for the plurality problem:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms.  4 (2008)  3 - p. 1-17 , 2008
 
?
9

Average-case lower bounds for the plurality problem:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms (TALG).  4 (2008)  3 - p. 1-17 , 2008
 
?
10

Determining plurality:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms.  4 (2008)  3 - p. 1-19 , 2008
 
?
11

Determining plurality:

Alonso, Laurent ; Reingold, Edward M.
ACM Transactions on Algorithms (TALG).  4 (2008)  3 - p. 1-19 , 2008
 
?
13

Line drawing, leap years, and Euclid:

Harris, Mitchell A. ; Reingold, Edward M.
ACM Computing Surveys (CSUR).  36 (2004)  1 - p. 68-80 , 2004
 
?
14

The worst-case chip problem:

Alonso, Laurent ; Chassaing, Philippe ; Reingold, Edward M..
Information Processing Letters.  89 (2004)  6 - p. 303-308 , 2004
 
?
15

Line drawing, leap years, and Euclid:

Harris, Mitchell A. ; Reingold, Edward M.
ACM Computing Surveys.  36 (2004)  1 - p. 68-80 , 2004
 
1-15