dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Anil Kamath Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1998
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Omri Palmon, Serge A. Plotkin: Routing and Admission Control in General Topology Networks with Poisson Arrivals. J. Algorithms 27(2): 236-258 (1998)
1996
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Omri Palmon, Serge A. Plotkin: Routing and Admission Control in General Topology Networks with Poisson Arrivals. SODA 1996: 269-278
1995
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Omri Palmon, Serge A. Plotkin: Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. SODA 1995: 493-501
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Omri Palmon: Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow Problems. SODA 1995: 502-511
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis: Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Random Struct. Algorithms 7(1): 59-80 (1995)
1994
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis: Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture FOCS 1994: 592-603

Coauthor Index

1Rajeev Motwani [1] [2]
2Krishna V. Palem [1] [2]
3Omri Palmon [3] [4] [5] [6]
4Serge A. Plotkin [4] [5] [6]
5Paul G. Spirakis [1] [2]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page