Gabriel Robins

	2007
53		Leonid Bolotnyy, Scott Krize, Gabriel Robins: The Practicality of Multi-Tag RFID Systems. IWRT 2007: 100-116
52		Leonid Bolotnyy, Gabriel Robins: Physically Unclonable Function-Based Security and Privacy in RFID Systems. PerCom 2007: 211-220
51		Leonid Bolotnyy, Gabriel Robins: Multi-tag RFID systems. IJIPT 2(3/4): 218-231 (2007)
	2005
50		Leonid Bolotnyy, Gabriel Robins: Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification. AutoID 2005: 43-48
49		Leonid Bolotnyy, Gabriel Robins: Multi-Tag Radio Frequency Identification Systems. AutoID 2005: 83-88
48		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng: Compressible area fill synthesis. IEEE Trans. on CAD of Integrated Circuits and Systems 24(8): 1169-1187 (2005)
47		Gabriel Robins, Alexander Zelikovsky: Tighter Bounds for Graph Steiner Tree Approximation. SIAM J. Discrete Math. 19(1): 122-134 (2005)
	2003
46		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng: Area Fill Generation With Inherent Data Volume Reduction. DATE 2003: 10868-10875
45		Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: The moving-target traveling salesman problem. J. Algorithms 49(1): 153-174 (2003)
	2002
44		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky: Closing the smoothness and uniformity gap in area fill synthesis. ISPD 2002: 137-142
43		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky: Area fill synthesis for uniform layout density. IEEE Trans. on CAD of Integrated Circuits and Systems 21(10): 1132-1147 (2002)
	2001
42		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky: Hierarchical dummy fill for process uniformity. ASP-DAC 2001: 139-144
41		Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: An improved approximation scheme for the Group Steiner Problem. Networks 37(1): 8-20 (2001)
	2000
40		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky: Monte-Carlo algorithms for layout density control. ASP-DAC 2000: 523-528
39		Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky: Practical iterated fill synthesis for CMP uniformity. DAC 2000: 671-674
38		Gabriel Robins, Alexander Zelikovsky: Improved Steiner tree approximation in graphs. SODA 2000: 770-779
37		Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: New approximation algorithms for routing with multiport terminals. IEEE Trans. on CAD of Integrated Circuits and Systems 19(10): 1118-1128 (2000)
	1999
36		Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky: New Multilevel and Hierarchical Algorithms for Layout Density Control. ASP-DAC 1999: 221-224
35		Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky: New and Exact Filling Algorithms for Layout Density Control. VLSI Design 1999: 106-110
34		Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky: Filling algorithms and analyses for layout density control. IEEE Trans. on CAD of Integrated Circuits and Systems 18(4): 445-462 (1999)
33		Gabriel Robins, Brian L. Robinson, Bhupinder S. Sethi: On Detecting Spatial Regularity in Noisy Images. Inf. Process. Lett. 69(4): 189-195 (1999)
	1998
32		Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: Improved Approximation Bounds for the Group Steiner Problem. DATE 1998: 406-413
31		Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: Moving-Target TSP and Related Problems. ESA 1998: 453-464
30		Andrew B. Kahng, Gabriel Robins, Anish Singh, Huijuan Wang, Alexander Zelikovsky: Filling and slotting: analysis and algorithms. ISPD 1998: 95-102
29		Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup: How to test a tree. Networks 32(3): 189-197 (1998)
	1997
28		C. Douglass Bateman, Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky: Provably good routing tree construction with multi-port terminals. ISPD 1997: 96-102
	1996
27		William R. Pearson, Gabriel Robins, Dallas E. Wrege, Tongtong Zhang: On the Primer Selection Problem in Polymerase Chain Reaction Experiments. Discrete Applied Mathematics 71(1-3): 231-246 (1996)
26		Michael J. Alexander, Gabriel Robins: New performance-driven FPGA routing algorithms. IEEE Trans. on CAD of Integrated Circuits and Systems 15(12): 1505-1517 (1996)
	1995
25		Michael J. Alexander, Gabriel Robins: New Performance-Driven FPGA Routing Algorithms. DAC 1995: 562-567
24		Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins: Performance-oriented placement and routing for field-programmable gate arrays. EURO-DAC 1995: 80-85
23		William R. Pearson, Gabriel Robins, Dallas E. Wrege, Tongtong Zhang: A New Approach to Primer Selection in Polymerase Chain Reaction Experiments. ISMB 1995: 285-291
22		Gabriel Robins, Jeffrey S. Salowe: Low-Degree Minimum Spanning Trees. Discrete & Computational Geometry 14(2): 151-165 (1995)
21		Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins: Near-optimal critical sink routing tree constructions. IEEE Trans. on CAD of Integrated Circuits and Systems 14(12): 1417-1436 (1995)
20		Bernard A. McCoy, Gabriel Robins: Non-tree routing [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 14(6): 780-784 (1995)
	1994
19		Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins: Rectilinear Steiner Trees with Minimum Elmore Delay. DAC 1994: 381-386
18		Bernard A. McCoy, Gabriel Robins: Non-Tree Routing. EDAC-ETC-EUROASIC 1994: 430-434
17		Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins: An architecture-independent approach to FPGA routing based on multi-weighted graphs. EURO-DAC 1994: 259-264
16		Todd D. Hodes, Bernard A. McCoy, Gabriel Robins: Dynamically-Wiresized Elmore-Based Routing Constructions. ISCAS 1994: 463-466
15		Gabriel Robins, Jeffrey S. Salowe: On the Maximum Degree of Minimum Spanning Trees. Symposium on Computational Geometry 1994: 250-258
14		Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang: Closing the gap: near-optimal Steiner trees in polynomial time. IEEE Trans. on CAD of Integrated Circuits and Systems 13(11): 1351-1365 (1994)
	1993
13		Kenneth D. Boese, Andrew B. Kahng, Gabriel Robins: High-Performance Routing Trees With Identified Critical Sinks. DAC 1993: 182-187
12		Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins: Fidelity and Near-Optimality of Elmore-Based Routing Constructions. ICCD 1993: 81-84
11		Charles J. Alpert, Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh: Minimum Density Interconneciton Trees. ISCAS 1993: 1865-1868
10		Jason Cong, Andrew B. Kahng, Gabriel Robins: Matching-based methods for high-performance clock routing. IEEE Trans. on CAD of Integrated Circuits and Systems 12(8): 1157-1169 (1993)
	1992
9		Andrew B. Kahng, Gabriel Robins: On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension. IEEE Trans. on CAD of Integrated Circuits and Systems 11(11): 1462-1465 (1992)
8		Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, Chak-Kuen Wong: Provably good performance-driven global routing. IEEE Trans. on CAD of Integrated Circuits and Systems 11(6): 739-752 (1992)
7		Andrew B. Kahng, Gabriel Robins: A new class of iterative Steiner tree heuristics with good performance. IEEE Trans. on CAD of Integrated Circuits and Systems 11(7): 893-902 (1992)
	1991
6		Andrew B. Kahng, Jason Cong, Gabriel Robins: High-Performance Clock Routing Based on Recursive Geometric Aatching. DAC 1991: 322-327
5		Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, C. K. Wong: Performance-Driven Global Routing for Cell Based ICs. ICCD 1991: 170-173
4		Andrew B. Kahng, Gabriel Robins: Optimal algorithms for extracting spatial regularity in images. Pattern Recognition Letters 12(12): 757-764 (1991)
	1990
3		Andrew B. Kahng, Gabriel Robins: A New Class of Steiner Trees Heuristics with Good Performance: The Iterated 1-Steiner-Approach. ICCAD 1990: 428-431
	1989
2		Gabriel Robins: Signal Constellation Design Tool: A Case Study in User Interface Synthesis. ICCAL 1989: 452-467
	1986
1		Thomas Kaczmarek, Raymond Bates, Gabriel Robins: Recent Developments in NIKL. AAAI 1986: 978-985

Coauthor Index

1	Michael J. Alexander	[17] [24] [25] [26]
2	Charles J. Alpert	[11]
3	C. Douglass Bateman	[28]
4	Raymond Bates	[1]
5	Kenneth D. Boese	[12] [13] [19] [21]
6	Leonid Bolotnyy	[49] [50] [51] [52] [53]
7	Yu Chen	[39] [40] [42] [43] [44] [46] [48]
8	James P. Cohoon	[17] [24]
9	Jason Cong	[5] [6] [8] [10] [11]
10	Joseph L. Ganley	[17] [24]
11	Jeff Griffith	[14]
12	Christopher S. Helvig	[28] [31] [32] [37] [41] [45]
13	Todd D. Hodes	[16]
14	Thomas Kaczmarek	[1]
15	Andrew B. Kahng	[3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [19] [21] [29] [30] [34] [35] [36] [39] [40] [42] [43] [44] [46] [48]
16	Scott Krize	[53]
17	Bernard A. McCoy	[12] [16] [18] [19] [20] [21]
18	William R. Pearson	[23] [27]
19	Brian L. Robinson	[33]
20	Jeffrey S. Salowe	[14] [15] [22]
21	Majid Sarrafzadeh	[5] [8] [11]
22	Bhupinder S. Sethi	[33]
23	Anish Singh	[30] [34] [35] [36]
24	Elizabeth A. Walkup	[29]
25	Huijuan Wang	[30]
26	Chak-Kuen Wong (C. K. Wong)	[5] [8]
27	Dallas E. Wrege	[23] [27]
28	Alexander Zelikovsky	[28] [30] [31] [32] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48]
29	Tongtong Zhang	[14] [23] [27]
30	Yuhong Zheng	[46] [48]

Colors in the list of coauthors