| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Sanjeev Khanna, Brendan Lucier |
The Power of Local Information in Social Networks  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Justin Hsu, Sanjeev Khanna, Aaron Roth |
Distributed Private Heavy Hitters  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
On the communication and streaming complexity of maximum bipartite matching.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Khanna, Madhu Sudan |
Delays and the Capacity of Continuous-time Channels  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna |
Mechanism Design with Risk Aversion  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Social Welfare in One-sided Matching Markets without Money  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Khanna, Sudeepa Roy, Val Tannen |
Queries with Difference on Probabilistic Databases.  |
PVLDB  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Ashish Goel, Sanjeev Khanna |
Improved Approximation Results for Stochastic Knapsack Problems.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Susan B. Davidson, Sanjeev Khanna, Val Tannen, Sudeepa Roy, Yi Chen, Tova Milo, Julia Stoyanovich |
Enabling Privacy in Provenance-Aware Workflow Systems.  |
CIDR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design.  |
IPCO  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen |
On provenance and privacy.  |
ICDT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Social Welfare in One-Sided Matching Markets without Money.  |
APPROX-RANDOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.  |
APPROX-RANDOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Juba, Adam Tauman Kalai, Sanjeev Khanna, Madhu Sudan |
Compression without a common prior: an information-theoretic justification for ambiguity in language.  |
ICS  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zhiyi Huang, Sampath Kannan, Sanjeev Khanna |
Algorithms for the Generalized Sorting Problem.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Madhu Sudan |
Delays and the Capacity of Continuous-Time Channels.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy |
Provenance views for module privacy.  |
PODS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai |
Robust self-assembly of graphs.  |
Natural Computing  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect matchings via uniform sampling in regular bipartite graphs.  |
ACM Transactions on Algorithms  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang |
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.  |
Combinatorica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Susan B. Davidson, Sanjeev Khanna, Debmalya Panigrahi, Sudeepa Roy |
Preserving Module Privacy in Workflow Provenance  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Graph Sparsification via Refinement Sampling  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai |
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.  |
WINE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy |
An optimal labeling scheme for workflow provenance using skeleton labels.  |
SIGMOD Conference  |
2010 |
DBLP DOI BibTeX RDF |
workflow, provenance, labeling, reachability |
| 1 | Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna |
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.  |
ACM Conference on Electronic Commerce  |
2010 |
DBLP DOI BibTeX RDF |
cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms |
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect matchings in o(n log n) time in regular bipartite graphs.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
| 1 | Stanislav Angelov, Sanjeev Khanna, Keshav Kunal |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Troughput maximization, Online algorithms, Network routing |
| 1 | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu |
Approximation algorithms for data placement on parallel disks.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Directed multicut, hardness of approximation, sparsest cut |
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Sanjeev Khanna |
Perfect Matchings in Õ(n1.5) Time in Regular Bipartite Graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna |
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Patrick Briest, Sanjeev Khanna |
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs with Constant Congestion.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect matchings via uniform sampling in regular bipartite graphs.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Sanjeev Khanna, Brad Null |
The ratio index for budgeted learning, with applications.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Zhao, Aline Normoyle, Sanjeev Khanna, Alla Safonova |
Automatic construction of a minimum size motion graph.  |
Symposium on Computer Animation  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna |
Nash Dynamics in Congestion Games with Similar Resources.  |
WINE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhuowei Bao, Sarah Cohen Boulakia, Susan B. Davidson, Anat Eyal, Sanjeev Khanna |
Differencing Provenance in Scientific Workflows.  |
ICDE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Sanjeev Khanna |
Nash Dynamics in Constant Player and Bounded Jump Congestion Games.  |
SAGT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Biton, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy |
Optimizing user views for workflows.  |
ICDT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna |
Network bargaining: algorithms and structural results.  |
ACM Conference on Electronic Commerce  |
2009 |
DBLP DOI BibTeX RDF |
social networks, approximation algorithms, equilibrium, bargaining |
| 1 | Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna |
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
item pricing, limited supply setting, revenue maximization |
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
Approximation Algorithms, Allocation Problems |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
vertex-connectivity, survivable network design |
| 1 | Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai |
On the complexity of graph self-assembly in accretive systems.  |
Natural Computing  |
2008 |
DBLP DOI BibTeX RDF |
Graph self-assembly, Accretive systems, Computational complexity |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ashish Goel, Sanjeev Khanna, Brad Null |
The Ratio Index for Budgeted Learning, with Applications  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai |
Robust Self-assembly of Graphs.  |
DNA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna |
Algorithms for 2-Route Cut Problems.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter |
Adaptive SelectiveVerification.  |
INFOCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Sanjeev Khanna |
On the Network Coding Advantage for Wireless Multicast in Euclidean Space.  |
IPSN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Algorithms for Single-Source Vertex Connectivity.  |
FOCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sampath Kannan, Sanjeev Khanna, Sudeepa Roy |
STCON in Directed Unique-Path Graphs.  |
FSTTCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna |
Network design for vertex connectivity.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, hardness of approximation, vertex connectivity |
| 1 | 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)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim |
Efficient Enumeration of Phylogenetically Informative Substrings.  |
Journal of Computational Biology  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths |
| 1 | Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce |
A Formal Investigation of.  |
FSTTCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
| 1 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of Directed Routing with Congestion.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.  |
Theory of Computing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
Randomized Pursuit-Evasion with Local Visibility.  |
SIAM J. Discrete Math.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai |
On the Complexity of Graph Self-assembly in Accretive Systems.  |
DNA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt |
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.  |
DISC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim |
Efficient Enumeration of Phylogenetically Informative Substrings.  |
RECOMB  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
| 1 | Volkan Isler, Sanjeev Khanna, John R. Spletzer, Camillo J. Taylor |
Target tracking with distributed sensors: The focus of attention problem.  |
Computer Vision and Image Understanding  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
Randomized pursuit-evasion in a polygonal environment.  |
IEEE Transactions on Robotics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate.  |
J. ACM  |
2005 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation |
| 1 | Chandra Chekuri, Sanjeev Khanna |
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.  |
SIAM J. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor |
Approximating the average response time in broadcast scheduling.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Sanjeev Khanna, Keshav Kunal |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers.  |
APPROX-RANDOM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths |
| 1 | Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang Chiew Tan |
Archiving scientific data.  |
ACM Trans. Database Syst.  |
2004 |
DBLP DOI BibTeX RDF |
Keys for XML |
| 1 | Venkatesan Guruswami, Sanjeev Khanna |
On the Hardness of 4-Coloring a 3-Colorable Graph.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin |
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Aravind Srinivasan |
Special issue: 35th Annual ACM Symposium on Theory of Computing.  |
J. Comput. Syst. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna |
On Multidimensional Packing Problems.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor |
Reconstructing strings from random traces.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
Randomized pursuit-evasion with limited visibility.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund, Thore Husfeldt, Sanjeev Khanna |
Approximating Longest Directed Paths and Cycles.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Sanjeev Khanna, Li Li, Fernando Pereira |
ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences.  |
WABI  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang |
Genome Identification and Classification by Short Oligo Arrays.  |
WABI  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron (eds.) |
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings  |
APPROX-RANDOM  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor |
Machine Minimization for Scheduling Jobs with Interval Constraints.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Greenwald, Sanjeev Khanna |
Power-Conserving Computation of Order-Statistics over Sensor Networks. (PDF / PS)  |
PODS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation |
| 1 | Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar |
Multi-processor scheduling to minimize flow time with epsilon resource augmentation.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
multi-processor scheduling, load balancing, online algorithms, stretch, resource augmentation, flow time |
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
The all-or-nothing multicommodity flow problem.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths |
| 1 | Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh |
DoS Protection for Reliably Authenticated Broadcast.  |
NDSS  |
2004 |
DBLP BibTeX RDF |
|