Chandra Chekuri

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
114Pruning 2-Connected Graphs. Chandra Chekuri, Nitish Korula. Algorithmica (62): 436-463 (2012). Web SearchBibTeXDownload
2011
113Set connectivity problems in undirected graphs and the directed steiner network problem. Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev. ACM Transactions on Algorithms (7): 18 (2011). Web SearchBibTeXDownload
112Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. Chandra Chekuri, Jan Vondrák, Rico Zenklusen. CoRR (abs/1105.4593) (2011). Web SearchBibTeXDownload
111Approximation Algorithms for Submodular Multiway Partition. Chandra Chekuri, Alina Ene. CoRR (abs/1105.2048) (2011). Web SearchBibTeXDownload
110Multicommodity Flows and Cuts in Polymatroidal Networks. Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath. CoRR (abs/1110.6832) (2011). Web SearchBibTeXDownload
109Submodular Cost Allocation Problem and Applications. Chandra Chekuri, Alina Ene. ICALP (1) 2011, 354-366. Web SearchBibTeXDownload
108Approximability of Capacitated Network Design. Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula. IPCO 2011, 78-91. Web SearchBibTeXDownload
107Buy-at-Bulk Network Design with Protection. Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang. Math. Oper. Res. (36): 71-87 (2011). Web SearchBibTeXDownload
106Prize-collecting Steiner Problems on Planar Graphs. MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx. SODA 2011, 1028-1049. Web SearchBibTeXDownload
105Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. Chandra Chekuri, Jan Vondrák, Rico Zenklusen. SODA 2011, 1080-1097. Web SearchBibTeXDownload
104Submodular function maximization via the multilinear relaxation and contention resolution schemes. Jan Vondrák, Chandra Chekuri, Rico Zenklusen. STOC 2011, 783-792. Web SearchBibTeXDownload
2010
103Approximability of Capacitated Network Design. Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula. CoRR (abs/1009.5734) (2010). Web SearchBibTeXDownload
102Prize-Collecting Steiner Tree and Forest in Planar Graphs. Chandra Chekuri, Alina Ene, Nitish Korula. CoRR (abs/1006.4357) (2010). Web SearchBibTeXDownload
101Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. Chandra Chekuri, Jan Vondrák, Rico Zenklusen. FOCS 2010, 575-584. Web SearchBibTeXDownload
100Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. SIAM J. Comput. (39): 1772-1798 (2010). Web SearchBibTeXDownload
99Flow-Cut Gaps for Integer and Fractional Multiflows. Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel. SODA 2010, 1198-1208. Web SearchBibTeXDownload
98New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid. WAOA 2010, 71-82. Web SearchBibTeXDownload
2009
97A Note on Multiflows and Treewidth. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. Algorithmica (54): 400-412 (2009). Web SearchBibTeXDownload
96Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. Chandra Chekuri, Alina Ene, Nitish Korula. APPROX-RANDOM 2009, 42-55. Web SearchBibTeXDownload
95Truthful Mechanisms via Greedy Iterative Packing. Chandra Chekuri, Iftah Gamzu. APPROX-RANDOM 2009, 56-69. Web SearchBibTeXDownload
94On the Set Multi-Cover Problem in Geometric Settings. Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled. CoRR (abs/0909.0537) (2009). Web SearchBibTeXDownload
93Randomized Pipage Rounding for Matroid Polytopes and Applications. Chandra Chekuri, Jan Vondrák. CoRR (abs/0909.4348) (2009). Web SearchBibTeXDownload
92Longest Wait First for Broadcast Scheduling. Chandra Chekuri, Sungjin Im, Benjamin Moseley. CoRR (abs/0906.2395) (2009). Web SearchBibTeXDownload
91Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. Chandra Chekuri, Sungjin Im, Benjamin Moseley. ESA 2009, 444-455. Web SearchBibTeXDownload
90A Graph Reduction Step Preserving Element-Connectivity and Applications. Chandra Chekuri, Nitish Korula. ICALP (1) 2009, 254-265. Web SearchBibTeXDownload
89Topology Formation for Wireless Mesh Network Planning. Chun-cheng Chen, Chandra Chekuri, D. Klabjan. INFOCOM 2009, 2671-2675. Web SearchBibTeXDownload
88Disjoint bases in a polymatroid. Gruia Calinescu, Chandra Chekuri, Jan Vondrák. Random Struct. Algorithms (35): 418-430 (2009). Web SearchBibTeXDownload
87Edge-Disjoint Paths in Planar Graphs with Constant Congestion. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. SIAM J. Comput. (39): 281-301 (2009). Web SearchBibTeXDownload
86Online scheduling to minimize the maximum delay factor. Chandra Chekuri, Benjamin Moseley. SODA 2009, 1116-1125. Web SearchBibTeXDownload
85On the set multi-cover problem in geometric settings. Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled. Symposium on Computational Geometry 2009, 341-350. Web SearchBibTeXDownload
84Longest Wait First for Broadcast Scheduling [Extended Abstract]. Chandra Chekuri, Sungjin Im, Benjamin Moseley. WAOA 2009, 62-74. Web SearchBibTeXDownload
2008
83Min-Cost 2-Connected Subgraphs With k Terminals. Chandra Chekuri, Nitish Korula. CoRR (abs/0802.2528) (2008). Web SearchBibTeXDownload
82Online Scheduling to Minimize the Maximum Delay Factor. Chandra Chekuri, Benjamin Moseley. CoRR (abs/0807.1891) (2008). Web SearchBibTeXDownload
81Multicommodity Flow, Well-linked Terminals and Routing Problems. Chandra Chekuri. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
80Single-Sink Network Design with Vertex Connectivity Requirements. Chandra Chekuri, Nitish Korula. FSTTCS 2008, 131-142. Web SearchBibTeXDownload
79Pruning 2-Connected Graphs. Chandra Chekuri, Nitish Korula. FSTTCS 2008, 119-130. Web SearchBibTeXDownload
78Algorithms for 2-Route Cut Problems. Chandra Chekuri, Sanjeev Khanna. ICALP (1) 2008, 472-484. Web SearchBibTeXDownload
77Approximate Integer Decompositions for Undirected Network Design Problems. Chandra Chekuri, F. Bruce Shepherd. SIAM J. Discrete Math. (23): 163-177 (2008). Web SearchBibTeXDownload
76Set connectivity problems in undirected graphs and the directed Steiner network problem. Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev. SODA 2008, 532-541. Web SearchBibTeXDownload
75Improved algorithms for orienteering and related problems. Chandra Chekuri, Nitish Korula, Martin Pál. SODA 2008, 661-670. Web SearchBibTeXDownload
2007
74Edge-disjoint paths revisited. Chandra Chekuri, Sanjeev Khanna. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
73Multicommodity demand flow in a tree and packing integer programs. Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
72Approximation Algorithms for the Unsplittable Flow Problem. Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar. Algorithmica (47): 53-78 (2007). Web SearchBibTeXDownload
71Approximation Algorithms for Orienteering with Time Windows. Chandra Chekuri, Nitish Korula. CoRR (abs/0711.4825) (2007). Web SearchBibTeXDownload
70Buy-at-Bulk Network Design with Protection. Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang. FOCS 2007, 634-644. Web SearchBibTeXDownload
69Non-Cooperative Multicast and Facility Location Games. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda. IEEE Journal on Selected Areas in Communications (25): 1193-1206 (2007). Web SearchBibTeXDownload
68Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák. IPCO 2007, 182-196. Web SearchBibTeXDownload
67Hardness of robust network design. Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellŕ. Networks (50): 50-54 (2007). Web SearchBibTeXDownload
66Routing and network design with robustness to changing or uncertain traffic demands. Chandra Chekuri. SIGACT News (38): 106-129 (2007). Web SearchBibTeXDownload
65Approximation algorithms for node-weighted buy-at-bulk network design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. SODA 2007, 1265-1274. Web SearchBibTeXDownload
64An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Chandra Chekuri, Martin Pál. Theory of Computing (3): 197-209 (2007). Web SearchBibTeXDownload
2006
63Non-cooperative multicast and facility location games. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda. ACM Conference on Electronic Commerce 2006, 72-81. Web SearchBibTeXDownload
62An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Chandra Chekuri, Martin Pál. APPROX-RANDOM 2006, 95-103. Web SearchBibTeXDownload
61Design tools for transparent optical networks. 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. Bell Labs Technical Journal (11): 129-143 (2006). Web SearchBibTeXDownload
60A greedy approximation algorithm for the group Steiner problem. Chandra Chekuri, Guy Even, Guy Kortsarz. Discrete Applied Mathematics (154): 15-34 (2006). Web SearchBibTeXDownload
59Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. FOCS 2006, 677-686. Web SearchBibTeXDownload
58On average throughput and alphabet size in network coding. Chandra Chekuri, Christina Fragouli, Emina Soljanin. IEEE Transactions on Information Theory (52): 2410-2424 (2006). Web SearchBibTeXDownload
57Special Issue: FOCS 2003. Chandra Chekuri, Daniele Micciancio. J. Comput. Syst. Sci. (72): 205 (2006). Web SearchBibTeXDownload
56Embedding k-Outerplanar Graphs into l 1. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair. SIAM J. Discrete Math. (20): 119-136 (2006). Web SearchBibTeXDownload
55The Steiner k-Cut Problem. Chandra Chekuri, Sudipto Guha, Joseph Naor. SIAM J. Discrete Math. (20): 261-271 (2006). Cited by 1Web SearchBibTeXDownload
54Edge-disjoint paths in Planar graphs with constant congestion. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. STOC 2006, 757-766. Web SearchBibTeXDownload
53An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. Theory of Computing (2): 137-146 (2006). Web SearchBibTeXDownload
2005
52Building Edge-Failure Resilient Networks. Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz. Algorithmica (43): 17-41 (2005). Web SearchBibTeXDownload
51Sampling Bounds for Stochastic Optimization. Moses Charikar, Chandra Chekuri, Martin Pál. APPROX-RANDOM 2005, 257-269. Web SearchBibTeXDownload
50On a bidirected relaxation for the MULTIWAY CUT problem. Chandra Chekuri, Anupam Gupta, Amit Kumar. Discrete Applied Mathematics (150): 67-79 (2005). Web SearchBibTeXDownload
49A Recursive Greedy Algorithm for Walks in Directed Graphs. Chandra Chekuri, Martin Pál. FOCS 2005, 245-253. Web SearchBibTeXDownload
48Routing bandwidth guaranteed paths with local restoration in label switched networks. Li Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo. IEEE Journal on Selected Areas in Communications (23): 437-449 (2005). Web SearchBibTeXDownload
47A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. Chandra Chekuri, Sanjeev Khanna. SIAM J. Comput. (35): 713-728 (2005). Web SearchBibTeXDownload
46Multicommodity flow, well-linked terminals, and routing problems. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. STOC 2005, 183-192. Web SearchBibTeXDownload
2004
45Maximum Coverage Problem with Group Budget Constraints and Applications. Chandra Chekuri, Amit Kumar. APPROX-RANDOM 2004, 72-83. Web SearchBibTeXDownload
44Edge-Disjoint Paths in Planar Graphs. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. FOCS 2004, 71-80. Web SearchBibTeXDownload
43On Multidimensional Packing Problems. Chandra Chekuri, Sanjeev Khanna. SIAM J. Comput. (33): 837-851 (2004). Web SearchBibTeXDownload
42Incremental Clustering and Dynamic Information Retrieval. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. SIAM J. Comput. (33): 1417-1440 (2004). Cited by 257Web SearchBibTeXDownload
41A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin. SIAM J. Discrete Math. (18): 608-625 (2004). Web SearchBibTeXDownload
40The all-or-nothing multicommodity flow problem. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. STOC 2004, 156-165. Web SearchBibTeXDownload
39Multi-processor scheduling to minimize flow time with epsilon resource augmentation. Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar. STOC 2004, 363-372. Web SearchBibTeXDownload
2003
38Multicommodity Demand Flow in a Tree. Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. ICALP 2003, 410-425. Web SearchBibTeXDownload
37Approximating Steiner k-Cuts. Chandra Chekuri, Sudipto Guha, Joseph Naor. ICALP 2003, 189-199. Cited by 1Web SearchBibTeXDownload
36Edge disjoint paths revisited. Chandra Chekuri, Sanjeev Khanna. SODA 2003, 628-637. Web SearchBibTeXDownload
35Embedding k-outerplanar graphs into l1. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair. SODA 2003, 527-536. Web SearchBibTeXDownload
2002
34Approximation Algorithms for the Unsplittable Flow Problem. Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar. APPROX 2002, 51-66. Web SearchBibTeXDownload
33Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. Erran L. Li, Milind M. Buddhikot, Chandra Chekuri, Jinhong Katherine Guo. ICNP 2002, 110-121. Web SearchBibTeXDownload
32Building Edge-Failure Resilient Networks. Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz. IPCO 2002, 439-456. Web SearchBibTeXDownload
31Approximation schemes for preemptive weighted flow time. Chandra Chekuri, Sanjeev Khanna. STOC 2002, 297-305. Web SearchBibTeXDownload
2001
30Approximation Schemes for Preemptive Weighted Flow Time. Chandra Chekuri. Electronic Colloquium on Computational Complexity (ECCC) (8) (2001). Web SearchBibTeXDownload
29A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. Chandra Chekuri, Sanjeev Khanna. ICALP 2001, 848-861. Web SearchBibTeXDownload
28An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Chandra Chekuri, Michael A. Bender. J. Algorithms (41): 212-224 (2001). Web SearchBibTeXDownload
27Approximation Techniques for Average Completion Time Scheduling. Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein. SIAM J. Comput. (31): 146-166 (2001). Cited by 162Web SearchBibTeXDownload
26Approximation algorithms for the metric labeling problem via a new linear programming formulation. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin. SODA 2001, 109-118. Web SearchBibTeXDownload
25A deterministic algorithm for the cost-distance problem. Chandra Chekuri, Sanjeev Khanna, Joseph Naor. SODA 2001, 232-233. Web SearchBibTeXDownload
24Algorithms for minimizing weighted flow time. Chandra Chekuri, Sanjeev Khanna, An Zhu. STOC 2001, 84-93. Web SearchBibTeXDownload
2000
23Blocking probability estimates in a partitioned sector TDMA system. Chandra Chekuri, Kavita Ramanan, Philip A. Whiting, Lisa Zhang. DIAL-M 2000, 28-34. Web SearchBibTeXDownload
22Performance guarantees for the TSP with a parameterized triangle inequality. Michael A. Bender, Chandra Chekuri. Inf. Process. Lett. (73): 17-21 (2000). Web SearchBibTeXDownload
21A PTAS for the multiple knapsack problem. Chandra Chekuri, Sanjeev Khanna. SODA 2000, 213-222. Web SearchBibTeXDownload
20Conjunctive query containment revisited. Chandra Chekuri, Anand Rajaraman. Theor. Comput. Sci. (239): 211-229 (2000). Web SearchBibTeXDownload
1999
19Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. Chandra Chekuri, Rajeev Motwani. Discrete Applied Mathematics (98): 29-38 (1999). Cited by 57Web SearchBibTeXDownload
18Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 123Web SearchBibTeXDownload
17Approximation Algorithms for Directed Steiner Problems. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li. J. Algorithms (33): 73-91 (1999). Cited by 211Web SearchBibTeXDownload
16Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani. SIAM J. Comput. (28): 1167-1181 (1999). Web SearchBibTeXDownload
15On Multi-Dimensional Packing Problems. Chandra Chekuri, Sanjeev Khanna. SODA 1999, 185-194. Web SearchBibTeXDownload
14Minimizing Weighted Completion Time on a Single Machine. Chandra Chekuri, Rajeev Motwani. SODA 1999, 873-874. Cited by 3Web SearchBibTeXDownload
13Performance Guarantees for the TSP with a Parameterized Triangle Inequality. Michael A. Bender, Chandra Chekuri. WADS 1999, 80-85. Web SearchBibTeXDownload
1998
12Approximating a Finite Metric by a Small Number of Tree Metrics. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin. FOCS 1998, 379-388. Cited by 134Web SearchBibTeXDownload
11An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Chandra Chekuri, Michael A. Bender. IPCO 1998, 383-393. Web SearchBibTeXDownload
10Approximation Algorithms for Directed Steiner Problems. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li. SODA 1998, 192-200. Cited by 211Web SearchBibTeXDownload
9Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha. STOC 1998, 114-123. Cited by 114Web SearchBibTeXDownload
8Filtering with Approximate Predicates. Narayanan Shivakumar, Hector Garcia-Molina, Chandra Chekuri. VLDB 1998, 263-274. Cited by 15Web SearchBibTeX
1997
7Conjunctive Query Containment Revisited. Chandra Chekuri, Anand Rajaraman. ICDT 1997, 56-70. Web SearchBibTeXDownload
6Experimental Study of Minimum Cut Algorithms. Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein. SODA 1997, 324-333. Web SearchBibTeXDownload
5Approximation Techniques for Average Completion Time Scheduling. Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein. SODA 1997, 609-618. Cited by 162Web SearchBibTeXDownload
4Incremental Clustering and Dynamic Information Retrieval. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. STOC 1997, 626-635. Cited by 257Web SearchBibTeXDownload
1996
3Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks. Chandra Chekuri, Richard Johnson, Rajeev Motwani, B. Natarajan, B. Ramakrishna Rau, Michael S. Schlansker. MICRO 1996, 58-67. Cited by 57Web SearchBibTeXDownload
2Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). Donald Aingworth, Chandra Chekuri, Rajeev Motwani. SODA 1996, 547-553. Cited by 92Web SearchBibTeXDownload
1995
1Scheduling Problems in Parallel Query Optimization. Chandra Chekuri, Waqar Hasan, Rajeev Motwani. PODS 1995, 255-265. Cited by 54Web SearchBibTeXDownload
from DBLP and Google Scholar

Related People

Related Topics

References
1. ^ Theory Day - Friday, November 14, 2003 - NYU Computer Science Department - Retrieved 2011-04-23 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research