default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven S. Seiden
Person information
- affiliation: Louisiana State University, Baton Rouge, LA, USA
- affiliation (former): University of California Irvine, CA, USA
- not to be confused with: Steven Seiden 0002
Other persons with the same name
- Steven Seiden 0002
![[0009-0006-4358-946X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0006-4358-946X")
(aka: Steven R. Seiden) — Duke University, School of Engineering, Durham, NC, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j31]Esteban Feuerstein, Steven S. Seiden, Alejandro Strejilevich de Loma:
On Multi-threaded Metrical Task Systems. J. Discrete Algorithms 4(3): 401-413 (2006)- 2005
- [j30]Steven S. Seiden, Gerhard J. Woeginger:
The two-dimensional cutting stock problem revisited. Math. Program. 102(3): 519-530 (2005) - [j29]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) - 2004
- [j28]Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden:
How to Better Use Expert Advice. Mach. Learn. 55(3): 271-309 (2004) - [j27]John E. Augustine, Steven S. Seiden:
Linear time approximation schemes for vehicle scheduling problems. Theor. Comput. Sci. 324(2-3): 147-160 (2004) - [j26]Manor Mendel, Steven S. Seiden:
Online companion caching. Theor. Comput. Sci. 324(2-3): 183-200 (2004) - [j25]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) - [j24]Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden:
New results for online page replication. Theor. Comput. Sci. 324(2-3): 219-251 (2004) - [i1]Manor Mendel, Steven S. Seiden:
Online Companion Caching. CoRR cs.DS/0406036 (2004) - 2003
- [j23]Steven S. Seiden, Rob van Stee:
New Bounds for Multidimensional Packing. Algorithmica 36(3): 261-293 (2003) - [j22]Steven S. Seiden:
Barely Random Algorithms for Multiprocessor Scheduling. J. Sched. 6(3): 309-334 (2003) - [j21]Steven S. Seiden, Rob van Stee, Leah Epstein:
New Bounds for Variable-Sized Online Bin Packing. SIAM J. Comput. 32(2): 455-469 (2003) - 2002
- [j20]Steven S. Seiden:
A General Decomposition Theorem for the k-Server Problem. Inf. Comput. 174(2): 193-202 (2002) - [j19]John Noga, Steven Seiden, Gerhard J. Woeginger:
A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81(2): 71-73 (2002) - [j18]Steven S. Seiden:
On the online bin packing problem. J. ACM 49(5): 640-671 (2002) - [j17]Steven Seiden:
A manifesto for the computational method. Theor. Comput. Sci. 282(2): 381-395 (2002) - [c16]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 - [c15]Amos Fiat, Manor Mendel, Steven S. Seiden:
Online Companion Caching. ESA 2002: 499-511 - [c14]Leah Epstein, Steven S. Seiden, Rob van Stee:
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ICALP 2002: 306-317 - [c13]Steven S. Seiden, Rob van Stee:
New bounds for multi-dimensional packing. SODA 2002: 486-495 - [c12]John E. Augustine, Steven S. Seiden:
Linear Time Approximation Schemes for Vehicle Scheduling. SWAT 2002: 30-39 - 2001
- [j16]Steven S. Seiden:
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. SIAM J. Discret. Math. 14(4): 458-470 (2001) - [j15]Steven S. Seiden:
Can a computer proof be elegant? SIGACT News 32(1): 111-114 (2001) - [j14]Steven S. Seiden:
Preemptive multiprocessor scheduling with rejection. Theor. Comput. Sci. 262(1): 437-458 (2001) - [j13]John Noga, Steven S. Seiden:
An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268(1): 133-143 (2001) - [c11]Steven S. Seiden:
A General Decomposition Theorem for the k-Server Problem. ESA 2001: 86-97 - [c10]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 - [c9]Steven S. Seiden:
On the Online Bin Packing Problem. ICALP 2001: 237-248 - 2000
- [j12]Steven S. Seiden:
Online Randomized Multiprocessor Scheduling. Algorithmica 28(2): 173-216 (2000) - [j11]Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5): 215-221 (2000) - [c8]Rudolf Fleischer, Steven S. Seiden:
New results for online page replication. APPROX 2000: 144-154 - [c7]Steven S. Seiden:
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. ICALP 2000: 283-295 - [c6]Steven S. Seiden:
A guessing game and randomized online algorithms. STOC 2000: 592-601
1990 – 1999
- 1999
- [j10]Steven S. Seiden:
Unfair Problems and Randomized Algorithms for Metrical Task Systems. Inf. Comput. 148(2): 219-240 (1999) - [j9]Steven S. Seiden:
Randomized Online Scheduling with Delivery Times. J. Comb. Optim. 3(4): 399-416 (1999) - [j8]Steven S. Seiden:
Randomized Online Multi-Threaded Paging. Nord. J. Comput. 6(2): 148-161 (1999) - [c5]John Noga, Steven S. Seiden:
Scheduling Two Machines with Release Times. IPCO 1999: 391-399 - [c4]Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326 - 1998
- [j7]Steven S. Seiden:
Randomized online interval scheduling. Oper. Res. Lett. 22(4-5): 171-177 (1998) - [j6]Sandy Irani, Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems. Theor. Comput. Sci. 194(1-2): 163-182 (1998) - [c3]Steven S. Seiden:
Randomized Online Multi-threaded Paging. SWAT 1998: 264-275 - 1997
- [j5]Mayez A. Al-Mouhamed, Steven S. Seiden:
A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. IEEE Trans. Parallel Distributed Syst. 8(4): 441-447 (1997) - [c2]Steven S. Seiden:
Randomized Algorithms for that Ancient Scheduling Problem. WADS 1997: 210-223 - 1996
- [j4]Steven S. Seiden:
Theoretical computer science cheat sheet. SIGACT News 27(4): 52-61 (1996) - [j3]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) - 1995
- [c1]Sandy Irani, Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems. WADS 1995: 159-170 - 1994
- [j2]Steven S. Seiden, Daniel S. Hirschberg:
Finding Succinct Ordered Minimal Perfect Hash Functions. Inf. Process. Lett. 51(6): 283-288 (1994) - 1993
- [j1]Daniel S. Hirschberg, Steven S. Seiden:
A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47(4): 215-219 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-18 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
