Rakesh K. Sinha

2008
28	EE	Kostas N. Oikonomou, Rakesh K. Sinha: Techniques for Probabilistic Multi-Layer Network Analysis. GLOBECOM 2008: 1534-1538
2007
27	EE	Kostas N. Oikonomou, K. K. Ramakrishnan, Robert D. Doverspike, Angela L. Chiu, M. Martinez-Heath, Rakesh K. Sinha: Performability Analysis of Multi-layer Restoration in a Satellite Network. International Teletraffic Congress 2007: 77-91
2004
26	EE	Ruibing Hao, David Lee, Rakesh K. Sinha, Nancy D. Griffeth: Integrated system interoperability testing with applications to VoIP. IEEE/ACM Trans. Netw. 12(5): 823-836 (2004)
2003
25	EE	Randeep Bhatia, Rakesh K. Sinha, Chung-Min Chen: A Hierarchical Technique for Constructing Efficient Declustering Schemes for Range Queries. Comput. J. 46(4): 358-377 (2003)
24	EE	Chung-Min Chen, Randeep Bhatia, Rakesh K. Sinha: Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences. IEEE Trans. Knowl. Data Eng. 15(3): 659-670 (2003)
23	EE	Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen: Asymptotically optimal declustering schemes for 2-dim range queries. Theor. Comput. Sci. 296(3): 511-534 (2003)
2002
22	EE	Funda Ergün, Rakesh K. Sinha, Lisa Zhang: An improved FPTAS for Restricted Shortest Path. Inf. Process. Lett. 83(5): 287-291 (2002)
2001
21	EE	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	EE	Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen: Asymptotically Optimal Declustering Schemes for Range Queries. ICDT 2001: 144-158
19	EE	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	EE	Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: Biased dictionaries with fast insert/deletes. STOC 2001: 483-491
2000
16	EE	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	EE	Randeep Bhatia, Rakesh K. Sinha, Chung-Min Chen: Declustering Using Golden Ratio Sequences. ICDE 2000: 271-280
12	EE	Funda Ergün, Rakesh K. Sinha, Lisa Zhang: QoS Routing with Performance-Dependent Costs. INFOCOM 2000: 137-146
11	EE	Chung-Min Chen, Rakesh K. Sinha: Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries. IEEE Trans. Knowl. Data Eng. 12(5): 763-778 (2000)
1999
10	EE	Chung-Min Chen, Rakesh K. Sinha: Raster-Spatial Data Declustering Revisited: An Interactive Navigation Perspective. ICDE 1999: 600-607
1998
9	EE	Rakesh K. Sinha: Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits. Inf. Process. Lett. 68(6): 275-282 (1998)
1997
8		Paul Beame, Faith E. Fich, Rakesh K. Sinha: Separating the Power of EREW and CREW PRAMs with Small Communication Width. Inf. Comput. 138(1): 89-99 (1997)
7		Rakesh K. Sinha, Jayram S. Thathachar: Efficient Oblivious Branching Programs for Threshold and Mod Functions. J. Comput. Syst. Sci. 55(3): 373-384 (1997)
1996
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)
1994
5		Rakesh K. Sinha, Jayram S. Thathachar: Efficient Oblivious Branching Programs for Threshold Functions FOCS 1994: 309-317
1993
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. Inf. Process. Lett. 45(2): 107-110 (1993)
1		Donald D. Chinn, Rakesh K. Sinha: Bounds on Sample Space Size for Matrix Product Verification. Inf. Process. Lett. 48(2): 87-91 (1993)

Coauthor Index

1	Paul Beame	[3] [8]
2	Randeep Bhatia	[13] [16] [18] [20] [23] [24] [25]
3	Chung-Min Chen	[10] [11] [13] [16] [18] [20] [23] [24] [25]
4	Donald D. Chinn	[1]
5	Angela L. Chiu	[27]
6	Anne Condon	[6]
7	Robert D. Doverspike	[27]
8	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[3] [8]
9	Funda Ergün	[12] [17] [19] [21] [22]
10	Nancy D. Griffeth	[14] [26]
11	Ruibing Hao	[14] [15] [26]
12	T. S. Jayram (Jayram S. Thathachar)	[5] [7]
13	Tracy Kimbrel	[2]
14	Akhil Kumar	[4]
15	Richard E. Ladner	[6]
16	Jordan Lampe	[6]
17	David Lee	[14] [15] [26]
18	M. Martinez-Heath	[27]
19	Suvo Mittra	[19]
20	Kostas N. Oikonomou	[27] [28]
21	Michael Rabinovich	[4]
22	K. K. Ramakrishnan (Kadangode K. Ramakrishnan)	[27]
23	Süleyman Cenk Sahinalp	[17] [19] [21]
24	Jonathan Sharp	[17] [19] [21]
25	Dario Vlah	[15]
26	Lisa Zhang	[12] [22]

Colors in the list of coauthors