The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steven S. Seiden: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rudolf Fleischer, Steven S. Seiden
    New results for online page replication. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:144-154 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2002, pp:296-304 [Conf]
  3. János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
    Buying a Constant Competitive Ratio for Paging. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:98-108 [Conf]
  4. Amos Fiat, Manor Mendel, Steven S. Seiden
    Online Companion Caching. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:499-511 [Conf]
  5. Steven S. Seiden
    A General Decomposition Theorem for the k-Server Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:86-97 [Conf]
  6. Leah Epstein, Steven S. Seiden, Rob van Stee
    New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:306-317 [Conf]
  7. Steven S. Seiden
    An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:283-295 [Conf]
  8. Steven S. Seiden
    On the Online Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:237-248 [Conf]
  9. John Noga, Steven S. Seiden
    Scheduling Two Machines with Release Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:391-399 [Conf]
  10. Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:317-326 [Conf]
  11. Steven S. Seiden, Rob van Stee
    New bounds for multi-dimensional packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:486-495 [Conf]
  12. Steven S. Seiden
    A guessing game and randomized online algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:592-601 [Conf]
  13. John E. Augustine, Steven S. Seiden
    Linear Time Approximation Schemes for Vehicle Scheduling. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:30-39 [Conf]
  14. Steven S. Seiden
    Randomized Online Multi-threaded Paging. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:264-275 [Conf]
  15. Sandy Irani, Steven S. Seiden
    Randomized Algorithms for Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:159-170 [Conf]
  16. Steven S. Seiden
    Randomized Algorithms for that Ancient Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:210-223 [Conf]
  17. Steven S. Seiden, Rob van Stee
    New Bounds for Multidimensional Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:261-293 [Journal]
  18. Steven S. Seiden
    Online Randomized Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:2, pp:173-216 [Journal]
  19. Manor Mendel, Steven S. Seiden
    Online Companion Caching [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  20. Steven S. Seiden
    A General Decomposition Theorem for the k-Server Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:193-202 [Journal]
  21. Steven S. Seiden
    Unfair Problems and Randomized Algorithms for Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:148, n:2, pp:219-240 [Journal]
  22. Daniel S. Hirschberg, Steven S. Seiden
    A Bounded-Space Tree Traversal Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:4, pp:215-219 [Journal]
  23. John Noga, Steven S. Seiden, Gerhard J. Woeginger
    A faster off-line algorithm for the TCP acknowledgement problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:71-73 [Journal]
  24. Steven S. Seiden, Daniel S. Hirschberg
    Finding Succinct Ordered Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:6, pp:283-288 [Journal]
  25. Steven S. Seiden
    On the online bin packing problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:5, pp:640-671 [Journal]
  26. Steven S. Seiden
    Randomized Online Scheduling with Delivery Times. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:4, pp:399-416 [Journal]
  27. Esteban Feuerstein, Steven S. Seiden, Alejandro Strejilevich de Loma
    On Multi-threaded Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:401-413 [Journal]
  28. Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden
    How to Better Use Expert Advice. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:55, n:3, pp:271-309 [Journal]
  29. Steven S. Seiden, Gerhard J. Woeginger
    The two-dimensional cutting stock problem revisited. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:3, pp:519-530 [Journal]
  30. Steven S. Seiden
    Randomized Online Multi-Threaded Paging. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:2, pp:148-161 [Journal]
  31. Steven S. Seiden
    Randomized online interval scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:4-5, pp:171-177 [Journal]
  32. Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Semi-online scheduling with decreasing job sizes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:215-221 [Journal]
  33. Steven S. Seiden
    Barely Random Algorithms for Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:3, pp:309-334 [Journal]
  34. Steven S. Seiden, Rob van Stee, Leah Epstein
    New Bounds for Variable-Sized Online Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:455-469 [Journal]
  35. Steven S. Seiden
    An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:458-470 [Journal]
  36. Mayez A. Al-Mouhamed, Steven S. Seiden
    Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:757-762 [Journal]
  37. John E. Augustine, Steven S. Seiden
    Linear time approximation schemes for vehicle scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:147-160 [Journal]
  38. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
    Combining request scheduling with web caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:201-218 [Journal]
  39. Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden
    New results for online page replication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:219-251 [Journal]
  40. Sandy Irani, Steven S. Seiden
    Randomized Algorithms for Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:194, n:1-2, pp:163-182 [Journal]
  41. John Noga, Steven S. Seiden
    An optimal online algorithm for scheduling two machines with release times. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:133-143 [Journal]
  42. Steven S. Seiden
    Preemptive multiprocessor scheduling with rejection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:437-458 [Journal]
  43. Steven S. Seiden
    A manifesto for the computational method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:381-395 [Journal]
  44. Manor Mendel, Steven S. Seiden
    Online companion caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:183-200 [Journal]
  45. Steven S. Seiden, Peter P. Chen, R. F. Lax, Jianhua Chen, Guoli Ding
    New bounds for randomized busing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:63-81 [Journal]
  46. Mayez A. Al-Mouhamed, Steven S. Seiden
    A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:4, pp:441-447 [Journal]

Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002