Steven S. Seiden

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

Steven S. Seiden, Gerhard J. Woeginger: The two-dimensional cutting stock problem revisited. Math. Program. 102(3): 519-530 (2005)

Steven S. Seiden, Peter P. Chen, Robert F. Lax, Jianhua Chen, Guoli Ding: New bounds for randomized busing. Theor. Comput. Sci. 332(1-3): 63-81 (2005)

Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden: How to Better Use Expert Advice. Machine Learning 55(3): 271-309 (2004)

John E. Augustine, Steven S. Seiden: Linear time approximation schemes for vehicle scheduling problems. Theor. Comput. Sci. 324(2-3): 147-160 (2004)

Manor Mendel, Steven S. Seiden: Online companion caching. Theor. Comput. Sci. 324(2-3): 183-200 (2004)

Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu: Combining request scheduling with web caching. Theor. Comput. Sci. 324(2-3): 201-218 (2004)

Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden: New results for online page replication. Theor. Comput. Sci. 324(2-3): 219-251 (2004)

Manor Mendel, Steven S. Seiden: Online Companion Caching. CoRR cs.DS/0406036 (2004)

Steven S. Seiden, Rob van Stee: New Bounds for Multidimensional Packing. Algorithmica 36(3): 261-293 (2003)

Steven S. Seiden: Barely Random Algorithms for Multiprocessor Scheduling. J. Scheduling 6(3): 309-334 (2003)

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

Steven S. Seiden: A General Decomposition Theorem for the k-Server Problem. Inf. Comput. 174(2): 193-202 (2002)

John Noga, Steven S. Seiden, Gerhard J. Woeginger: A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81(2): 71-73 (2002)

Steven S. Seiden: On the online bin packing problem. J. ACM 49(5): 640-671 (2002)

Steven S. Seiden: A manifesto for the computational method. Theor. Comput. Sci. 282(2): 381-395 (2002)

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: Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. CLUSTER 2002: 296-304

Amos Fiat, Manor Mendel, Steven S. Seiden: Online Companion Caching. ESA 2002: 499-511

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

Steven S. Seiden, Rob van Stee: New bounds for multi-dimensional packing. SODA 2002: 486-495

John E. Augustine, Steven S. Seiden: Linear Time Approximation Schemes for Vehicle Scheduling. SWAT 2002: 30-39

Steven S. Seiden: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. SIAM J. Discrete Math. 14(4): 458-470 (2001)

Steven S. Seiden: Can a computer proof be elegant? SIGACT News 32(1): 111-114 (2001)

Steven S. Seiden: Preemptive multiprocessor scheduling with rejection. Theor. Comput. Sci. 262(1): 437-458 (2001)

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

Steven S. Seiden: A General Decomposition Theorem for the k-Server Problem. ESA 2001: 86-97

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

Steven S. Seiden: On the Online Bin Packing Problem. ICALP 2001: 237-248

Steven S. Seiden: Online Randomized Multiprocessor Scheduling. Algorithmica 28(2): 173-216 (2000)

Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5): 215-221 (2000)

Rudolf Fleischer, Steven S. Seiden: New results for online page replication. APPROX 2000: 144-154

Steven S. Seiden: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. ICALP 2000: 283-295

Steven S. Seiden: A guessing game and randomized online algorithms. STOC 2000: 592-601

Steven S. Seiden: Unfair Problems and Randomized Algorithms for Metrical Task Systems. Inf. Comput. 148(2): 219-240 (1999)

Steven S. Seiden: Randomized Online Scheduling with Delivery Times. J. Comb. Optim. 3(4): 399-416 (1999)

Steven S. Seiden: Randomized Online Multi-Threaded Paging. Nord. J. Comput. 6(2): 148-161 (1999)

John Noga, Steven S. Seiden: Scheduling Two Machines with Release Times. IPCO 1999: 391-399

Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326

Steven S. Seiden: Randomized online interval scheduling. Oper. Res. Lett. 22(4-5): 171-177 (1998)

Sandy Irani, Steven S. Seiden: Randomized Algorithms for Metrical Task Systems. Theor. Comput. Sci. 194(1-2): 163-182 (1998)

Steven S. Seiden: Randomized Online Multi-threaded Paging. SWAT 1998: 264-275

Mayez A. Al-Mouhamed, Steven S. Seiden: A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. IEEE Trans. Parallel Distrib. Syst. 8(4): 441-447 (1997)

Steven S. Seiden: Randomized Algorithms for that Ancient Scheduling Problem. WADS 1997: 210-223

Steven S. Seiden: Theoretical computer science cheat sheet. SIGACT News 27(4): 52-61 (1996)

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

Sandy Irani, Steven S. Seiden: Randomized Algorithms for Metrical Task Systems. WADS 1995: 159-170

Steven S. Seiden, Daniel S. Hirschberg: Finding Succinct Ordered Minimal Perfect Hash Functions. Inf. Process. Lett. 51(6): 283-288 (1994)

Daniel S. Hirschberg, Steven S. Seiden: A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47(4): 215-219 (1993)