The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gabriel Robins: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  49. Performance-oriented placement and routing for field-programmable gate arrays. [Citation Graph (, )][DBLP]


  50. An architecture-independent approach to FPGA routing based on multi-weighted graphs. [Citation Graph (, )][DBLP]


  51. Physically Unclonable Function-Based Security and Privacy in RFID Systems. [Citation Graph (, )][DBLP]


  52. The Practicality of Multi-Tag RFID Systems. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002