Steven S. Seiden

According to our database1, Steven S. Seiden authored at least 42 papers between 1993 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
On Multi-threaded Metrical Task Systems.
J. Discrete Algorithms, 2006

2005
New bounds for randomized busing.
Theor. Comput. Sci., 2005

The two-dimensional cutting stock problem revisited.
Math. Program., 2005

2004
Online companion caching.
Theor. Comput. Sci., 2004

New results for online page replication.
Theor. Comput. Sci., 2004

Combining request scheduling with web caching.
Theor. Comput. Sci., 2004

Linear time approximation schemes for vehicle scheduling problems.
Theor. Comput. Sci., 2004

How to Better Use Expert Advice.
Mach. Learn., 2004

2003
New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput., 2003

Barely Random Algorithms for Multiprocessor Scheduling.
J. Sched., 2003

New Bounds for Multidimensional Packing.
Algorithmica, 2003

2002
A manifesto for the computational method.
Theor. Comput. Sci., 2002

On the online bin packing problem.
J. ACM, 2002

A faster off-line algorithm for the TCP acknowledgement problem.
Inf. Process. Lett., 2002

A General Decomposition Theorem for the k-Server Problem.
Inf. Comput., 2002

Linear Time Approximation Schemes for Vehicle Scheduling.
Proceedings of the Algorithm Theory, 2002

New bounds for multi-dimensional packing.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Online Companion Caching.
Proceedings of the Algorithms, 2002

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2001
Preemptive multiprocessor scheduling with rejection.
Theor. Comput. Sci., 2001

An optimal online algorithm for scheduling two machines with release times.
Theor. Comput. Sci., 2001

Can a computer proof be elegant?
SIGACT News, 2001

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing.
SIAM J. Discret. Math., 2001

Buying a Constant Competitive Ratio for Paging.
Proceedings of the Algorithms, 2001

2000
Semi-online scheduling with decreasing job sizes.
Oper. Res. Lett., 2000

Online Randomized Multiprocessor Scheduling.
Algorithmica, 2000

A guessing game and randomized online algorithms.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

New results for online page replication.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Randomized Online Multi-Threaded Paging.
Nord. J. Comput., 1999

Randomized Online Scheduling with Delivery Times.
J. Comb. Optim., 1999

Unfair Problems and Randomized Algorithms for Metrical Task Systems.
Inf. Comput., 1999

Randomized Online Scheduling on Two Uniform Machines.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Scheduling Two Machines with Release Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
Randomized Algorithms for Metrical Task Systems.
Theor. Comput. Sci., 1998

Randomized online interval scheduling.
Oper. Res. Lett., 1998

1997
A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns.
IEEE Trans. Parallel Distributed Syst., 1997

Randomized Algorithms for that Ancient Scheduling Problem.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1996
Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems.
IEEE Trans. Computers, 1996

Theoretical computer science cheat sheet.
SIGACT News, 1996

1994
Finding Succinct Ordered Minimal Perfect Hash Functions.
Inf. Process. Lett., 1994

1993
A Bounded-Space Tree Traversal Algorithm.
Inf. Process. Lett., 1993


  Loading...