Randomized Shellsort: A Simple Data-Oblivious Sorting AlgorithmGOODRICH, Michael T.Journal of the Association for Computing Machinery. 2011, Vol 58, Num 6, issn 0004-5411, 27.1-27.26Article

Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNAGOODRICH, Michael T.IEEE transactions on information theory. 2012, Vol 58, Num 11, pp 6726-6736, issn 0018-9448, 11 p.Article

Internet algorithmicsGOODRICH, Michael T.Algorithmica. 2002, Vol 33, Num 3, issn 0178-4617, 139 p.Serial Issue

On the algorithmic complexity of the Mastermind game with black-peg resultsGOODRICH, Michael T.Information processing letters. 2009, Vol 109, Num 13, pp 675-678, issn 0020-0190, 4 p.Article

Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random ComparisonsGOODRICH, Michael T.Algorithmica. 2014, Vol 68, Num 4, pp 835-858, issn 0178-4617, 24 p.Article

Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom FiltersEPPSTEIN, David; GOODRICH, Michael T.IEEE transactions on knowledge and data engineering. 2011, Vol 23, Num 2, pp 297-306, issn 1041-4347, 10 p.Article

Page replacement with multi-size pages and applications to Web cachingIRANI, S.Algorithmica. 2002, Vol 33, Num 3, pp 384-409, issn 0178-4617Article

Exploiting regularities in web traffic patterns for cache replacementCOHEN, E; KAPLAN, H.Algorithmica. 2002, Vol 33, Num 3, pp 300-334, issn 0178-4617Article

On-line file cachingYOUNG, N. E.Algorithmica. 2002, Vol 33, Num 3, pp 371-383, issn 0178-4617Article

LINEAR-TIME ALGORITHMS FOR GEOMETRIC GRAPHS WITH SUBLINEARLY MANY EDGE CROSSINGSEPPSTEIN, David; GOODRICH, Michael T; STRASH, Darren et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3814-3829, issn 0097-5397, 16 p.Article

Extending greedy multicast routing to delay sensitive applicationsGOEL, A; MUNAGALA, K.Algorithmica. 2002, Vol 33, Num 3, pp 335-352, issn 0178-4617Article

Computing the n x m shortest paths efficientlySHIBUYA, T.Lecture notes in computer science. 1999, pp 210-225, issn 0302-9743, isbn 3-540-66227-8Conference Paper

Drawing outer-planar graphs in O(n log n) areaBIEDL, Therese.Lecture notes in computer science. 2002, pp 54-65, issn 0302-9743, isbn 3-540-00158-1, 12 p.Conference Paper

Improved combinatorial group testing algorithms for real-world problem suzesEPPSTEIN, David; GOODRICH, Michael T; HIRSCHBERG, Daniel S et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1360-1375, issn 0097-5397, 16 p.Article

Three-dimensional layers of maximaBUCHSBAUM, Adam L; GOODRICH, Michael T.Algorithmica. 2004, Vol 39, Num 4, pp 275-286, issn 0178-4617, 12 p.Article

A framework for drawing planar graphs with curves and polylinesGOODRICH, Michael T; WAGNER, Christopher G.Journal of algorithms (Print). 2000, Vol 37, Num 2, pp 399-421, issn 0196-6774Article

A case study on the cost of geometric computingSCHIRRA, S.Lecture notes in computer science. 1999, pp 156-176, issn 0302-9743, isbn 3-540-66227-8Conference Paper

GD 2002 : graph drawing (Irvine CA, 26-28 August 2002, revised papers)Goodrich, Michael T; Kobourov, Stephen G.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00158-1, XIII, 384 p, isbn 3-540-00158-1Conference Proceedings

Applying crossing reduction strategies to layered compound graphsFORSTER, Michael.Lecture notes in computer science. 2002, pp 276-284, issn 0302-9743, isbn 3-540-00158-1, 9 p.Conference Paper

HGV: A library for hierarchies, graphs, and viewsRAITNER, Marcus.Lecture notes in computer science. 2002, pp 236-243, issn 0302-9743, isbn 3-540-00158-1, 8 p.Conference Paper

Semi-dynamic orthogonal drawings of planar graphsBACHL, Walter.Lecture notes in computer science. 2002, pp 354-361, issn 0302-9743, isbn 3-540-00158-1, 8 p.Conference Paper

Fast priority queues for cached memorySANDERS, P.Lecture notes in computer science. 1999, pp 312-327, issn 0302-9743, isbn 3-540-66227-8Conference Paper

Separating thickness from geometric thicknessEPPSTEIN, David.Lecture notes in computer science. 2002, pp 150-161, issn 0302-9743, isbn 3-540-00158-1, 12 p.Conference Paper

ALENEX '99 : algorithm engineering and experimentation (Baltimore MD, 15-16 January 1999)Goodrich, Michael T; McGeoch, Catherine C.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66227-8, VIII, 347 p, isbn 3-540-66227-8Conference Proceedings

Efficient tree-based revocation in groups of low-state devicesGOODRICH, Michael T; SUN, Jonathan Z; TAMASSIA, Roberto et al.Lecture notes in computer science. 2004, pp 511-527, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper