April Rasala Lehman

According to our database, April Rasala Lehman authored at least 16 papers between 1999 and 2007.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2007

Multiple-signal duplicate detection for search evaluation.

Scott B. Huffman, April Rasala Lehman, Alexei P. Stolboushkin, Howard Wong-Toi, Fan Yang, Hein Röhrig

Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

2006

On the capacity of information networks.

Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman

IEEE Trans. Inf. Theory, 2006

On the capacity of information networks.

Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Playing games in many possible worlds.

Matt Lepinski, David Liben-Nowell, Seth Gilbert, April Rasala Lehman

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005

Network coding.

April Rasala Lehman

PhD thesis, 2005

Strictly Nonblocking WDM Cross-connects.

April Rasala Lehman, Gordon T. Wilfong

SIAM J. Comput., 2005

2004

Network Coding: Does the Model Need Tuning?

April Rasala Lehman, Eric Lehman

Electron. Colloquium Comput. Complex., 2004

Complexity classification of network information flow problems.

April Rasala Lehman, Eric Lehman

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002

On list update and work function algorithms.

Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks

Theor. Comput. Sci., 2002

Approximating the smallest grammar: Kolmogorov complexity in natural models.

Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.

April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Route oscillations in I-BGP with route reflection.

Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong

Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Wide-Sense Nonblocking WDM Cross-Connects.

Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler

Proceedings of the Algorithms, 2002

2000

Strictly non-blocking WDM cross-connects for heterogeneous networks.

April Rasala, Gordon T. Wilfong

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Strictly non-blocking WDM cross-connects.

April Rasala, Gordon T. Wilfong

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Improved Bicriteria Existence Theorems for Scheduling.

Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999