A Bounded-Space Tree Traversal Algorithm. - Daniel S. Hirschberg; Steven S. Seiden (Inf. Process. Lett., 1993)

Finding Succinct Ordered Minimal Perfect Hash Functions. - Steven S. Seiden; Daniel S. Hirschberg (Inf. Process. Lett., 1994)

Theoretical computer science cheat sheet. - Steven S. Seiden (SIGACT News, 1996)

Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems. - Mayez A. Al-Mouhamed; Steven S. Seiden (IEEE Trans. Computers, 1996)

Randomized Algorithms for that Ancient Scheduling Problem. - Steven S. Seiden (WADS, 1997)

A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. - Mayez A. Al-Mouhamed; Steven S. Seiden (IEEE Trans. Parallel Distributed Syst., 1997)

Randomized online interval scheduling. - Steven S. Seiden (Oper. Res. Lett., 1998)

Randomized Algorithms for Metrical Task Systems. - Sandy Irani; Steven S. Seiden (Theor. Comput. Sci., 1998)

Scheduling Two Machines with Release Times. - John Noga; Steven S. Seiden (IPCO, 1999)

Randomized Online Scheduling on Two Uniform Machines. - Leah Epstein; John Noga; Steven S. Seiden; Jirí Sgall; Gerhard J. Woeginger (SODA, 1999)

Unfair Problems and Randomized Algorithms for Metrical Task Systems. - Steven S. Seiden (Inf. Comput., 1999)

Randomized Online Scheduling with Delivery Times. - Steven S. Seiden (J. Comb. Optim., 1999)

Randomized Online Multi-Threaded Paging. - Steven S. Seiden (Nord. J. Comput., 1999)

New results for online page replication. - Rudolf Fleischer; Steven S. Seiden (APPROX, 2000)

A guessing game and randomized online algorithms. - Steven S. Seiden (STOC, 2000)

Online Randomized Multiprocessor Scheduling. - Steven S. Seiden (Algorithmica, 2000)

Semi-online scheduling with decreasing job sizes. - Steven S. Seiden; Jirí Sgall; Gerhard J. Woeginger (Oper. Res. Lett., 2000)

Buying a Constant Competitive Ratio for Paging. - János Csirik; Csanád Imreh; John Noga; Steven S. Seiden; Gerhard J. Woeginger (ESA, 2001)

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. - Steven S. Seiden (SIAM J. Discret. Math., 2001)

Can a computer proof be elegant? - Steven S. Seiden (SIGACT News, 2001)

An optimal online algorithm for scheduling two machines with release times. - John Noga; Steven S. Seiden (Theor. Comput. Sci., 2001)

Preemptive multiprocessor scheduling with rejection. - Steven S. Seiden (Theor. Comput. Sci., 2001)

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. - Vitus J. Leung; Esther M. Arkin; Michael A. Bender; David P. Bunde; Jeanette Johnston; Alok Lal; Joseph S. B. Mitchell; Cynthia A. Phillips; Steven S. Seiden (CLUSTER, 2002)

Online Companion Caching. - Amos Fiat; Manor Mendel; Steven S. Seiden (ESA, 2002)

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. - Leah Epstein; Steven S. Seiden; Rob van Stee (ICALP, 2002)

New bounds for multi-dimensional packing. - Steven S. Seiden; Rob van Stee (SODA, 2002)

Linear Time Approximation Schemes for Vehicle Scheduling. - John E. Augustine; Steven S. Seiden (SWAT, 2002)

A General Decomposition Theorem for the k-Server Problem. - Steven S. Seiden (Inf. Comput., 2002)

A faster off-line algorithm for the TCP acknowledgement problem. - John Noga; Steven Seiden 001; Gerhard J. Woeginger (Inf. Process. Lett., 2002)

On the online bin packing problem. - Steven S. Seiden (J. ACM, 2002)

A manifesto for the computational method. - Steven Seiden 001 (Theor. Comput. Sci., 2002)

New Bounds for Multidimensional Packing. - Steven S. Seiden; Rob van Stee (Algorithmica, 2003)

Barely Random Algorithms for Multiprocessor Scheduling. - Steven S. Seiden (J. Sched., 2003)

New Bounds for Variable-Sized Online Bin Packing. - Steven S. Seiden; Rob van Stee; Leah Epstein (SIAM J. Comput., 2003)

How to Better Use Expert Advice. - Rani Yaroshinsky; Ran El-Yaniv; Steven S. Seiden (Mach. Learn., 2004)

Linear time approximation schemes for vehicle scheduling problems. - John E. Augustine; Steven S. Seiden (Theor. Comput. Sci., 2004)

Combining request scheduling with web caching. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Steven S. Seiden; Rob van Stee; An Zhu (Theor. Comput. Sci., 2004)

New results for online page replication. - Rudolf Fleischer; Wodzimierz Glazek; Steven S. Seiden (Theor. Comput. Sci., 2004)

Online companion caching. - Manor Mendel; Steven S. Seiden (Theor. Comput. Sci., 2004)

The two-dimensional cutting stock problem revisited. - Steven S. Seiden; Gerhard J. Woeginger (Math. Program., 2005)

New bounds for randomized busing. - Steven S. Seiden; Peter P. Chen; Robert F. Lax; Jianhua Chen 003; Guoli Ding (Theor. Comput. Sci., 2005)

On Multi-threaded Metrical Task Systems. - Esteban Feuerstein; Steven S. Seiden; Alejandro Strejilevich de Loma (J. Discrete Algorithms, 2006)