![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Rakesh K. Sinha 22 Funda Ergün , Rakesh K. Sinha, Lisa Zhang : An improved FPTAS for Restricted Shortest Path. Information Processing Letters 83 (5): 287-291 (2002) 21 Funda Ergün , Süleyman Cenk Sahinalp , Jonathan Sharp , Rakesh K. Sinha: Biased Skip Lists for Highly Skewed Access Patterns. ALENEX 2001 : 216-230 20 Rakesh K. Sinha, Randeep Bhatia , Chung-Min Chen : Asymptotically Optimal Declustering Schemes for Range Queries. ICDT 2001 : 144-158 19 Funda Ergün , Suvo Mittra , Süleyman Cenk Sahinalp , Jonathan Sharp , Rakesh K. Sinha: A Dynamic Lookup Scheme for Bursty Access Patterns. INFOCOM 2001 : 1444-1453 18 Chung-Min Chen , Rakesh K. Sinha, Randeep Bhatia : Efficient Disk Allocation Schemes for Parallel Retrieval of Multidimensional Grid Data. SSDBM 2001 : 213-222 17 Funda Ergün , Süleyman Cenk Sahinalp , Jonathan Sharp , Rakesh K. Sinha: Biased dictionaries with fast insert/deletes. STOC 2001 : 483-491 16 Randeep Bhatia , Rakesh K. Sinha, Chung-Min Chen : Hierarchical Declustering Schemes for Range Queries. EDBT 2000 : 525-537 15 Ruibing Hao , David Lee , Rakesh K. Sinha, Dario Vlah : Testing IP Routing Protocols - From Probabilistic Algorithms to a Software Tool. FORTE 2000 : 249-264 14 Nancy D. Griffeth , Ruibing Hao , David Lee , Rakesh K. Sinha: Integrated System Interoperability Testing with Applications to VOIP. FORTE 2000 : 69-84 13 Randeep Bhatia , Rakesh K. Sinha, Chung-Min Chen : Declustering Using Golden Ratio Sequences. ICDE 2000 : 271-280 12 Funda Ergün , Rakesh K. Sinha, Lisa Zhang : QoS Routing with Performance-Dependent Costs. INFOCOM 2000 : 137-146 11 Chung-Min Chen , Rakesh K. Sinha: Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries. TKDE 12 (5): 763-778 (2000) 10 Chung-Min Chen , Rakesh K. Sinha: Raster-Spatial Data Declustering Revisited: An Interactive Navigation Perspective. ICDE 1999 : 600-607 9 Rakesh K. Sinha: Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits. Information Processing Letters 68 (6): 275-282 (1998) 8 Paul Beame , Faith E. Fich , Rakesh K. Sinha: Separating the Power of EREW and CREW PRAMs with Small Communication Width. Information and Computation 138 (1): 89-99 (1997) 7 Rakesh K. Sinha, Jayram S. Thathachar : Efficient Oblivious Branching Programs for Threshold and Mod Functions. JCSS 55 (3): 373-384 (1997) 6 Anne Condon , Richard E. Ladner , Jordan Lampe , Rakesh K. Sinha: Complexity of Sub-Bus Mesh Computations. SIAM J. Comput. 25 (3): 520-539 (1996) 5 Rakesh K. Sinha, Jayram S. Thathachar : Efficient Oblivious Branching Programs for Threshold Functions. FOCS 1994 : 309-317 4 Akhil Kumar , Michael Rabinovich , Rakesh K. Sinha: A Performance Study of General Grid Structures for Replicated Data. ICDCS 1993 : 178-185 3 Paul Beame , Faith E. Fich , Rakesh K. Sinha: Separating the Power of EREW and CREW PRAMs with Small Communication Width. WADS 1993 : 163-174 2 Tracy Kimbrel , Rakesh K. Sinha: A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits. Information Processing Letters 45 (2): 107-110 (1993) 1 Donald D. Chinn , Rakesh K. Sinha: Bounds on Sample Space Size for Matrix Product Verification. Information Processing Letters 48 (2): 87-91 (1993) ![]() DiSC'02 © 2003 Association for Computing Machinery |