2007 |
53 | | Leonid Bolotnyy,
Scott Krize,
Gabriel Robins:
The Practicality of Multi-Tag RFID Systems.
IWRT 2007: 100-116 |
52 | EE | Leonid Bolotnyy,
Gabriel Robins:
Physically Unclonable Function-Based Security and Privacy in RFID Systems.
PerCom 2007: 211-220 |
51 | EE | Leonid Bolotnyy,
Gabriel Robins:
Multi-tag RFID systems.
IJIPT 2(3/4): 218-231 (2007) |
2005 |
50 | EE | Leonid Bolotnyy,
Gabriel Robins:
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification.
AutoID 2005: 43-48 |
49 | EE | Leonid Bolotnyy,
Gabriel Robins:
Multi-Tag Radio Frequency Identification Systems.
AutoID 2005: 83-88 |
48 | EE | 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 | EE | Gabriel Robins,
Alexander Zelikovsky:
Tighter Bounds for Graph Steiner Tree Approximation.
SIAM J. Discrete Math. 19(1): 122-134 (2005) |
2003 |
46 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky,
Yuhong Zheng:
Area Fill Generation With Inherent Data Volume Reduction.
DATE 2003: 10868-10875 |
45 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
The moving-target traveling salesman problem.
J. Algorithms 49(1): 153-174 (2003) |
2002 |
44 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Closing the smoothness and uniformity gap in area fill synthesis.
ISPD 2002: 137-142 |
43 | EE | 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 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Hierarchical dummy fill for process uniformity.
ASP-DAC 2001: 139-144 |
41 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
An improved approximation scheme for the Group Steiner Problem.
Networks 37(1): 8-20 (2001) |
2000 |
40 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Monte-Carlo algorithms for layout density control.
ASP-DAC 2000: 523-528 |
39 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Practical iterated fill synthesis for CMP uniformity.
DAC 2000: 671-674 |
38 | EE | Gabriel Robins,
Alexander Zelikovsky:
Improved Steiner tree approximation in graphs.
SODA 2000: 770-779 |
37 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Improved Approximation Bounds for the Group Steiner Problem.
DATE 1998: 406-413 |
31 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Moving-Target TSP and Related Problems.
ESA 1998: 453-464 |
30 | EE | Andrew B. Kahng,
Gabriel Robins,
Anish Singh,
Huijuan Wang,
Alexander Zelikovsky:
Filling and slotting: analysis and algorithms.
ISPD 1998: 95-102 |
29 | EE | Andrew B. Kahng,
Gabriel Robins,
Elizabeth A. Walkup:
How to test a tree.
Networks 32(3): 189-197 (1998) |
1997 |
28 | EE | 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 | EE | 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 | EE | 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 | EE | Michael J. Alexander,
Gabriel Robins:
New Performance-Driven FPGA Routing Algorithms.
DAC 1995: 562-567 |
24 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Gabriel Robins,
Jeffrey S. Salowe:
On the Maximum Degree of Minimum Spanning Trees.
Symposium on Computational Geometry 1994: 250-258 |
14 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 |