Steven S. Seiden

From MaRDI portal
Person:703066

Available identifiers

zbMath Open seiden.steven-sMaRDI QIDQ703066

List of research outcomes

PublicationDate of PublicationType
Randomized online multi-threaded paging2022-12-09Paper
On the online bin packing problem2015-12-07Paper
A guessing game and randomized online algorithms2014-09-26Paper
On multi-threaded metrical task systems2006-10-31Paper
The two-dimensional cutting stock problem revisited2005-04-29Paper
New bounds for randomized busing2005-04-06Paper
How to better use expert advice2005-01-19Paper
https://portal.mardi4nfdi.de/entity/Q48289732004-11-29Paper
Linear time approximation schemes for vehicle scheduling problems2004-11-23Paper
Online companion caching2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q30464742004-08-12Paper
Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems2003-11-02Paper
New bounds for multidimensional packing2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44113862003-07-08Paper
New Bounds for Variable-Sized Online Bin Packing2003-06-19Paper
https://portal.mardi4nfdi.de/entity/Q47961682003-03-02Paper
A general decomposition theorem for the \(k\)-server problem2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45357982002-06-25Paper
Preemptive multiprocessor scheduling with rejection2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27541512001-12-09Paper
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing2001-11-11Paper
Online randomized multiprocessor scheduling2001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q47193322000-10-17Paper
Randomized online interval scheduling1999-06-23Paper
Finding succinct ordered minimal perfect hash functions1996-02-26Paper
A bounded-space tree traversal algorithm1993-11-15Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Steven S. Seiden