default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApril Rasala Lehman
Person information
- affiliation: Google
- affiliation: MIT
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b1]April Rasala Lehman:
Network coding. Massachusetts Institute of Technology, Cambridge, MA, USA, 2005
Journal Articles
- 2006
- [j3]Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. IEEE Trans. Inf. Theory 52(6): 2345-2364 (2006) - 2005
- [j2]April Rasala Lehman, Gordon T. Wilfong:
Strictly Nonblocking WDM Cross-connects. SIAM J. Comput. 35(2): 449-485 (2005) - 2002
- [j1]Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks:
On list update and work function algorithms. Theor. Comput. Sci. 287(2): 393-418 (2002)
Conference and Workshop Papers
- 2007
- [c13]Scott B. Huffman, April Rasala Lehman, Alexei P. Stolboushkin, Howard Wong-Toi, Fan Yang, Hein Röhrig:
Multiple-signal duplicate detection for search evaluation. SIGIR 2007: 223-230 - 2006
- [c12]Matt Lepinski, David Liben-Nowell, Seth Gilbert
, April Rasala Lehman:
Playing games in many possible worlds. EC 2006: 150-159 - [c11]Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. SODA 2006: 241-250 - 2005
- [c10]April Rasala Lehman, Eric Lehman:
Network coding: does the model need tuning? SODA 2005: 499-504 - 2004
- [c9]April Rasala Lehman, Eric Lehman:
Complexity classification of network information flow problems. SODA 2004: 142-150 - 2002
- [c8]Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects. ESA 2002: 538-549 - [c7]Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong:
Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247 - [c6]April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut:
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. SODA 2002: 723-731 - [c5]Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat:
Approximating the smallest grammar: Kolmogorov complexity in natural models. STOC 2002: 792-801 - 2000
- [c4]April Rasala, Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects. SODA 2000: 606-615 - [c3]April Rasala, Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects for heterogeneous networks. STOC 2000: 514-523 - 1999
- [c2]Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks:
On List Update and Work Function Algorithms. ESA 1999: 289-300 - [c1]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847
Informal and Other Publications
- 2004
- [i2]April Rasala Lehman, Eric Lehman:
Network Coding: Does the Model Need Tuning? Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [i1]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. CoRR cs.DS/0205008 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
