The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vitus J. Leung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vitus J. Leung, Sandy Irani
    Experimental Results on Statistical Approaches to Page Replacement Policies. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:61-77 [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. David P. Bunde, Vitus J. Leung, Jens Mache
    Communication Patterns and Allocation Strategies. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  4. Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips
    Strengthening integrality gaps for capacitated network design and covering problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:106-115 [Conf]
  5. Sandy Irani, Vitus J. Leung
    Scheduling with Conflicts, and Applications to Traffic Signal Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:85-94 [Conf]
  6. Sandy Irani, Vitus J. Leung
    Probabilistic Analysis for Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:286-295 [Conf]
  7. Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
    Communication-Aware Processor Allocation for Supercomputers. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  8. Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
    Communication-Aware Processor Allocation for Supercomputers [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  9. Sandy Irani, Vitus J. Leung
    Scheduling with Conflicts on Bipartite and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:3, pp:287-307 [Journal]
  10. Vitus J. Leung
    The Undecidability of the Unrestricted Modified Edit Distance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:203-215 [Journal]

  11. Scheduling Restartable Jobs with Short Test Runs. [Citation Graph (, )][DBLP]


  12. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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