2008 |
67 | EE | Matthew Andrews,
Lisa Zhang:
Satisfying Arbitrary Delay Requirements in Multihop Networks.
INFOCOM 2008: 116-120 |
66 | EE | Yigal Bejerano,
Dongwook Lee,
Prasun Sinha,
Lisa Zhang:
Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs.
INFOCOM 2008: 2092-2100 |
65 | EE | Matthew Andrews,
Lisa Zhang:
Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems.
INFOCOM 2008: 861-869 |
64 | EE | Elliot Anshelevich,
Lisa Zhang:
Path decomposition under a new cost measure with applications to optical network design.
ACM Transactions on Algorithms 4(1): (2008) |
63 | EE | Matthew Andrews,
Lisa Zhang:
Almost-tight hardness of directed congestion minimization.
J. ACM 55(6): (2008) |
62 | EE | Hadas Shachnai,
Lisa Zhang,
Tomomi Matsui:
Exact algorithms for the master ring problem.
Networks 52(2): 98-107 (2008) |
2007 |
61 | EE | Spyridon Antonakopoulos,
Chandra Chekuri,
F. Bruce Shepherd,
Lisa Zhang:
Buy-at-Bulk Network Design with Protection.
FOCS 2007: 634-644 |
60 | EE | Spyridon Antonakopoulos,
Lisa Zhang:
Heuristics for Fiber Installation in Optical Network Optimization.
GLOBECOM 2007: 2342-2347 |
59 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling algorithms for multi-carrier wireless data systems.
MOBICOM 2007: 3-14 |
58 | EE | Matthew Andrews,
Lisa Zhang:
Routing and scheduling in multihop wireless networks with time-varying channels.
ACM Transactions on Algorithms 3(3): (2007) |
57 | EE | Matthew Andrews,
Julia Chuzhoy,
Venkatesan Guruswami,
Sanjeev Khanna,
Kunal Talwar,
Lisa Zhang:
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(113): (2007) |
56 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the Undirected Congestion Minimization Problem.
SIAM J. Comput. 37(1): 112-131 (2007) |
2006 |
55 | EE | Matthew Andrews,
Lisa Zhang:
Complexity of Wavelength Assignment in Optical Network Optimization.
INFOCOM 2006 |
54 | EE | Girija J. Narlikar,
Gordon T. Wilfong,
Lisa Zhang:
Designing Multihop Wireless Backhaul Networks with Delay Guarantees.
INFOCOM 2006 |
53 | EE | Matthew Andrews,
Lisa Zhang:
Logarithmic hardness of the directed congestion minimization problem.
STOC 2006: 517-526 |
52 | EE | 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.
Bell Labs Technical Journal 11(2): 129-143 (2006) |
51 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over nonstationary wireless channels with finite rate sets.
IEEE/ACM Trans. Netw. 14(5): 1067-1077 (2006) |
50 | EE | Matthew Andrews,
Lisa Zhang:
Logarithmic hardness of the undirected edge-disjoint paths problem.
J. ACM 53(5): 745-761 (2006) |
49 | EE | Matthew Andrews,
Lisa Zhang:
Minimizing maximum fiber requirement in optical networks.
J. Comput. Syst. Sci. 72(1): 118-131 (2006) |
48 | EE | Craig Gaw,
Thomas Arnold,
Robert Martin,
Lisa Zhang,
Dragan Zupac:
Evaluation of SiGe: C HBT intrinsic reliability using conventional and step stress methodologies.
Microelectronics Reliability 46(8): 1272-1278 (2006) |
2005 |
47 | EE | Matthew Andrews,
Julia Chuzhoy,
Sanjeev Khanna,
Lisa Zhang:
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.
FOCS 2005: 226-244 |
46 | EE | Matthew Andrews,
Lisa Zhang:
Bounds on fiber minimization in optical networks with fixed fiber capacity.
INFOCOM 2005: 409-419 |
45 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the undirected edge-disjoint paths problem.
STOC 2005: 276-283 |
44 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the undirected congestion minimization problem.
STOC 2005: 284-293 |
43 | EE | Lisa Zhang:
Guest Editor's Introduction.
Algorithmica 43(1-2): 1-3 (2005) |
42 | EE | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source routing and scheduling in packet networks.
J. ACM 52(4): 582-601 (2005) |
41 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data.
J. ACM 52(5): 809-834 (2005) |
2004 |
40 | EE | Elliot Anshelevich,
Lisa Zhang:
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.
ESA 2004: 28-39 |
39 | EE | Matthew Andrews,
Lisa Zhang:
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity.
ICALP 2004: 134-145 |
38 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over non-stationary wireless channels with finite rate sets.
INFOCOM 2004 |
37 | EE | Matthew Andrews,
Lisa Zhang:
Routing and scheduling in multihop wireless networks with time-varying channels.
SODA 2004: 1031-1040 |
36 | EE | Matthew Andrews,
Lisa Zhang:
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule.
J. Algorithms 52(1): 57-81 (2004) |
35 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling Protocols for Switches with Large Envelopes.
J. Scheduling 7(3): 171-186 (2004) |
34 | EE | Matthew Andrews,
Lisa Zhang:
The Effects of Temporary Sessions on Network Performance.
SIAM J. Comput. 33(3): 659-673 (2004) |
2003 |
33 | EE | Peter Winkler,
Lisa Zhang:
Wavelength assignment and generalized interval graph coloring.
SODA 2003: 830-831 |
32 | EE | Matthew Andrews,
Lisa Zhang:
Achieving stability in networks of input-queued switches.
IEEE/ACM Trans. Netw. 11(5): 848-857 (2003) |
2002 |
31 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data.
FOCS 2002: 293-302 |
30 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling protocols for switches with large envelopes.
SODA 2002: 443-452 |
29 | EE | Matthew Andrews,
Michael A. Bender,
Lisa Zhang:
New Algorithms for Disk Scheduling.
Algorithmica 32(2): 277-301 (2002) |
28 | EE | Yair Bartal,
Martin Farach-Colton,
Shibu Yooseph,
Lisa Zhang:
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.
Algorithmica 33(3): 272-286 (2002) |
27 | EE | Matthew Andrews,
Lisa Zhang:
Approximation Algorithms for Access Network Design.
Algorithmica 34(2): 197-215 (2002) |
26 | EE | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source Routing and Scheduling in Packet Networks
CoRR cs.NI/0203030: (2002) |
25 | EE | Funda Ergün,
Rakesh K. Sinha,
Lisa Zhang:
An improved FPTAS for Restricted Shortest Path.
Inf. Process. Lett. 83(5): 287-291 (2002) |
2001 |
24 | | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source Routing and Scheduling in Packet Networks.
FOCS 2001: 168-177 |
23 | EE | Matthew Andrews,
Lisa Zhang:
Achieving Stability in Networks of Input-Queued Switches.
INFOCOM 2001: 1673-1679 |
22 | | Ali Mili,
Senta Fowler Chmiel,
Ravi Gottumukkala,
Lisa Zhang:
Managing Software Reuse Economics: An Integrated ROI-based Model.
Ann. Software Eng. 11(1): 175-218 (2001) |
21 | | F. Bruce Shepherd,
Lisa Zhang:
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.
Discrete Applied Mathematics 110(2-3): 301-315 (2001) |
2000 |
20 | EE | Chandra Chekuri,
Kavita Ramanan,
Philip A. Whiting,
Lisa Zhang:
Blocking probability estimates in a partitioned sector TDMA system.
DIAL-M 2000: 28-34 |
19 | EE | Ali Mili,
Senta Fowler Chmiel,
Ravi Gottumukkala,
Lisa Zhang:
An integrated cost model for software reuse.
ICSE 2000: 157-166 |
18 | EE | Ali Mili,
Senta Fowler Chmiel,
Ravi Gottumukkala,
Lisa Zhang:
Tracking, predicting and assessing software reuse costs: an automated tool.
ICSE 2000: 785 |
17 | EE | Funda Ergün,
Rakesh K. Sinha,
Lisa Zhang:
QoS Routing with Performance-Dependent Costs.
INFOCOM 2000: 137-146 |
16 | EE | Matthew Andrews,
Lisa Zhang:
The effects of temporary sessions on network performance.
SODA 2000: 448-457 |
15 | EE | 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).
SIAM J. Comput. 30(5): 1594-1623 (2000) |
1999 |
14 | | Matthew Andrews,
Lisa Zhang:
Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule.
INFOCOM 1999: 380-388 |
13 | EE | Yair Bartal,
Martin Farach-Colton,
Shibu Yooseph,
Lisa Zhang:
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.
SODA 1999: 92-101 |
12 | EE | Matthew Andrews,
Lisa Zhang:
Packet Routing with Arbitrary End-to-End Delay Requirements.
STOC 1999: 557-565 |
11 | EE | Matthew Andrews,
Michel X. Goemans,
Lisa Zhang:
Improved Bounds for On-Line Load Balancing.
Algorithmica 23(4): 278-301 (1999) |
10 | | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Automatic Methods for Hiding Latency in Parallel and Distributed Computation.
SIAM J. Comput. 29(2): 615-647 (1999) |
1998 |
9 | EE | Matthew Andrews,
Lisa Zhang:
The Access Network Design Problem.
FOCS 1998: 40-59 |
8 | EE | Matthew Andrews,
Lisa Zhang:
Stability Results for Networks with Input and Output Blocking.
STOC 1998: 369-377 |
1997 |
7 | EE | 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).
FOCS 1997: 294-302 |
6 | | Yonatan Aumann,
Michael A. Bender,
Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.
Inf. Comput. 139(1): 1-16 (1997) |
1996 |
5 | | Matthew Andrews,
Michel X. Goemans,
Lisa Zhang:
Improved Bounds for On-line Load Balancing.
COCOON 1996: 1-10 |
4 | | Matthew Andrews,
Michael A. Bender,
Lisa Zhang:
New Algorithms for the Disk Scheduling Problem.
FOCS 1996: 550-559 |
3 | | Yonatan Aumann,
Michael A. Bender,
Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.
SPAA 1996: 270-276 |
2 | | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
SPAA 1996: 52-61 |
1 | EE | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
STOC 1996: 257-265 |