The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lisa Zhang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-line Load Balancing. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:1-10 [Conf]
  2. Chandra Chekuri, Kavita Ramanan, Philip A. Whiting, Lisa Zhang
    Blocking probability estimates in a partitioned sector TDMA system. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:28-34 [Conf]
  3. Elliot Anshelevich, Lisa Zhang
    Path Decomposition Under a New Cost Measure with Applications to Optical Network Design. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:28-39 [Conf]
  4. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for the Disk Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:550-559 [Conf]
  5. Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang
    Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:226-244 [Conf]
  6. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source Routing and Scheduling in Packet Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:168-177 [Conf]
  7. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
    General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:294-302 [Conf]
  8. Matthew Andrews, Lisa Zhang
    Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:293-302 [Conf]
  9. Matthew Andrews, Lisa Zhang
    The Access Network Design Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:40-59 [Conf]
  10. Matthew Andrews, Lisa Zhang
    Wavelength Assignment in Optical Networks with Fixed Fiber Capacity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:134-145 [Conf]
  11. Ali Mili, Senta Fowler Chmiel, Ravi Gottumukkala, Lisa Zhang
    An integrated cost model for software reuse. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:157-166 [Conf]
  12. Ali Mili, Senta Fowler Chmiel, Ravi Gottumukkala, Lisa Zhang
    Tracking, predicting and assessing software reuse costs: an automated tool. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:785- [Conf]
  13. Matthew Andrews, Lisa Zhang
    Achieving Stability in Networks of Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1673-1679 [Conf]
  14. Matthew Andrews, Lisa Zhang
    Scheduling over non-stationary wireless channels with finite rate sets. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  15. Matthew Andrews, Lisa Zhang
    Bounds on fiber minimization in optical networks with fixed fiber capacity. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:409-419 [Conf]
  16. Matthew Andrews, Lisa Zhang
    Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:380-388 [Conf]
  17. Funda Ergün, Rakesh K. Sinha, Lisa Zhang
    QoS Routing with Performance-Dependent Costs. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:137-146 [Conf]
  18. Matthew Andrews, Lisa Zhang
    Routing and scheduling in multihop wireless networks with time-varying channels. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1031-1040 [Conf]
  19. Matthew Andrews, Lisa Zhang
    The effects of temporary sessions on network performance. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:448-457 [Conf]
  20. Matthew Andrews, Lisa Zhang
    Scheduling protocols for switches with large envelopes. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:443-452 [Conf]
  21. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang
    Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:92-101 [Conf]
  22. Peter Winkler, Lisa Zhang
    Wavelength assignment and generalized interval graph coloring. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:830-831 [Conf]
  23. Yonatan Aumann, Michael A. Bender, Lisa Zhang
    Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:270-276 [Conf]
  24. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:52-61 [Conf]
  25. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:257-265 [Conf]
  26. Matthew Andrews, Lisa Zhang
    Hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:276-283 [Conf]
  27. Matthew Andrews, Lisa Zhang
    Hardness of the undirected congestion minimization problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:284-293 [Conf]
  28. Matthew Andrews, Lisa Zhang
    Logarithmic hardness of the directed congestion minimization problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:517-526 [Conf]
  29. Matthew Andrews, Lisa Zhang
    Stability Results for Networks with Input and Output Blocking. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:369-377 [Conf]
  30. Matthew Andrews, Lisa Zhang
    Packet Routing with Arbitrary End-to-End Delay Requirements. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:557-565 [Conf]
  31. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:277-301 [Journal]
  32. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-Line Load Balancing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:4, pp:278-301 [Journal]
  33. Matthew Andrews, Lisa Zhang
    Approximation Algorithms for Access Network Design. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:197-215 [Journal]
  34. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang
    Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:272-286 [Journal]
  35. Lisa Zhang
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:1-3 [Journal]
  36. Ali Mili, Senta Fowler Chmiel, Ravi Gottumukkala, Lisa Zhang
    Managing Software Reuse Economics: An Integrated ROI-based Model. [Citation Graph (0, 0)][DBLP]
    Ann. Software Eng., 2001, v:11, n:1, pp:175-218 [Journal]
  37. Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang
    Design tools for transparent optical networks. [Citation Graph (0, 0)][DBLP]
    Bell Labs Technical Journal, 2006, v:11, n:2, pp:129-143 [Journal]
  38. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source Routing and Scheduling in Packet Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  39. F. Bruce Shepherd, Lisa Zhang
    A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:301-315 [Journal]
  40. Yonatan Aumann, Michael A. Bender, Lisa Zhang
    Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:1-16 [Journal]
  41. Funda Ergün, Rakesh K. Sinha, Lisa Zhang
    An improved FPTAS for Restricted Shortest Path. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:5, pp:287-291 [Journal]
  42. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source routing and scheduling in packet networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:582-601 [Journal]
  43. Matthew Andrews, Lisa Zhang
    Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:5, pp:809-834 [Journal]
  44. Matthew Andrews, Lisa Zhang
    Logarithmic hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:5, pp:745-761 [Journal]
  45. Matthew Andrews, Lisa Zhang
    Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:57-81 [Journal]
  46. Matthew Andrews, Lisa Zhang
    Minimizing maximum fiber requirement in optical networks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:118-131 [Journal]
  47. Matthew Andrews, Lisa Zhang
    Scheduling Protocols for Switches with Large Envelopes. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:171-186 [Journal]
  48. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
    General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1594-1623 [Journal]
  49. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Automatic Methods for Hiding Latency in Parallel and Distributed Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:615-647 [Journal]
  50. Matthew Andrews, Lisa Zhang
    The Effects of Temporary Sessions on Network Performance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:659-673 [Journal]
  51. Matthew Andrews, Lisa Zhang
    Hardness of the Undirected Congestion Minimization Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:112-131 [Journal]
  52. Matthew Andrews, Lisa Zhang
    Achieving stability in networks of input-queued switches. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2003, v:11, n:5, pp:848-857 [Journal]
  53. Matthew Andrews, Lisa Zhang
    Scheduling over nonstationary wireless channels with finite rate sets. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:5, pp:1067-1077 [Journal]
  54. Craig Gaw, Thomas Arnold, Robert Martin, Lisa Zhang, Dragan Zupac
    Evaluation of SiGe: C HBT intrinsic reliability using conventional and step stress methodologies. [Citation Graph (0, 0)][DBLP]
    Microelectronics Reliability, 2006, v:46, n:8, pp:1272-1278 [Journal]
  55. Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
    Designing Multihop Wireless Backhaul Networks with Delay Guarantees. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  56. Matthew Andrews, Lisa Zhang
    Complexity of Wavelength Assignment in Optical Network Optimization. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  57. Matthew Andrews, Lisa Zhang
    Routing and scheduling in multihop wireless networks with time-varying channels. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  58. Buy-at-Bulk Network Design with Protection. [Citation Graph (, )][DBLP]


  59. Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems. [Citation Graph (, )][DBLP]


  60. Satisfying Arbitrary Delay Requirements in Multihop Networks. [Citation Graph (, )][DBLP]


  61. Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs. [Citation Graph (, )][DBLP]


  62. Multiserver Scheduling with Contiguity Constraints. [Citation Graph (, )][DBLP]


  63. Approximation Algorithms for Grooming in Optical Network Design. [Citation Graph (, )][DBLP]


  64. Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model. [Citation Graph (, )][DBLP]


  65. Routing for Energy Minimization in the Speed Scaling Model. [Citation Graph (, )][DBLP]


  66. Scheduling algorithms for multi-carrier wireless data systems. [Citation Graph (, )][DBLP]


  67. Heuristics for Fiber Installation in Optical Network Optimization. [Citation Graph (, )][DBLP]


  68. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]


  69. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. [Citation Graph (, )][DBLP]


Search in 0.572secs, Finished in 0.575secs
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