default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Robins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j29]Ritambhara Singh
, Jack Lanchantin, Gabriel Robins, Yanjun Qi:
Transfer String Kernel for Cross-Context DNA-Protein Binding Prediction. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5): 1524-1536 (2019)- 2018
- [j28]Kirti Chawla, Christopher McFarland, Gabriel Robins, Wil Thomason:
An accurate real-time RFID-based location system. Int. J. Radio Freq. Identif. Technol. Appl. 5(1): 48-76 (2018) - 2016
- [j27]Ritambhara Singh, Jack Lanchantin, Gabriel Robins, Yanjun Qi:
DeepChrome: deep-learning for predicting gene expression from histone modifications. Bioinform. 32(17): 639-648 (2016) - 2013
- [j26]Ryan M. Layer, Kevin Skadron, Gabriel Robins, Ira M. Hall, Aaron R. Quinlan:
Binary Interval Search: a scalable algorithm for counting interval intersections. Bioinform. 29(1): 1-7 (2013) - 2011
- [j25]Kirti Chawla, Gabriel Robins:
An RFID-based object localisation framework. Int. J. Radio Freq. Identif. Technol. Appl. 3(1/2): 2-30 (2011) - 2007
- [j24]Leonid Bolotnyy, Gabriel Robins:
Multi-tag RFID systems. Int. J. Internet Protoc. Technol. 2(3/4): 218-231 (2007) - 2005
- [j23]Gabriel Robins, Alexander Zelikovsky:
Tighter Bounds for Graph Steiner Tree Approximation. SIAM J. Discret. Math. 19(1): 122-134 (2005) - [j22]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng:
Compressible area fill synthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(8): 1169-1187 (2005) - 2003
- [j21]Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
The moving-target traveling salesman problem. J. Algorithms 49(1): 153-174 (2003) - 2002
- [j20]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky:
Area fill synthesis for uniform layout density. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(10): 1132-1147 (2002) - 2001
- [j19]Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
An improved approximation scheme for the Group Steiner Problem. Networks 37(1): 8-20 (2001) - 2000
- [j18]Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
New approximation algorithms for routing with multiport terminals. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(10): 1118-1128 (2000) - 1999
- [j17]Gabriel Robins, Brian L. Robinson, Bhupinder S. Sethi:
On Detecting Spatial Regularity in Noisy Images. Inf. Process. Lett. 69(4): 189-195 (1999) - [j16]Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky:
Filling algorithms and analyses for layout density control. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(4): 445-462 (1999) - 1998
- [j15]Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup:
How to test a tree. Networks 32(3): 189-197 (1998) - [j14]Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins:
Placement and Routing for Performance-Oriented FPGA Layout. VLSI Design 7(1): 97-110 (1998) - 1996
- [j13]William R. Pearson, Gabriel Robins, Dallas E. Wrege, Tongtong Zhang:
On the Primer Selection Problem in Polymerase Chain Reaction Experiments. Discret. Appl. Math. 71(1-3): 231-246 (1996) - [j12]Michael J. Alexander, Gabriel Robins:
New performance-driven FPGA routing algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12): 1505-1517 (1996) - 1995
- [j11]Gabriel Robins, Jeffrey S. Salowe:
Low-Degree Minimum Spanning Trees. Discret. Comput. Geom. 14(2): 151-165 (1995) - [j10]Bernard A. McCoy, Gabriel Robins:
Non-tree routing [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(6): 780-784 (1995) - [j9]Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins:
Near-optimal critical sink routing tree constructions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(12): 1417-1436 (1995) - 1994
- [j8]Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang:
Closing the gap: near-optimal Steiner trees in polynomial time. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(11): 1351-1365 (1994) - [j7]Charles J. Alpert, Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh:
On the Minimum Density Interconnection Tree Problem. VLSI Design 2(2): 157-169 (1994) - 1993
- [j6]Jason Cong, Andrew B. Kahng, Gabriel Robins:
Matching-based methods for high-performance clock routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(8): 1157-1169 (1993) - [j5]T. C. Hu, Andrew B. Kahng, Gabriel Robins:
Optimal robust path planning in general environments. IEEE Trans. Robotics Autom. 9(6): 775-784 (1993) - 1992
- [j4]Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, Chak-Kuen Wong:
Provably good performance-driven global routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(6): 739-752 (1992) - [j3]Andrew B. Kahng, Gabriel Robins:
A new class of iterative Steiner tree heuristics with good performance. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(7): 893-902 (1992) - [j2]Andrew B. Kahng, Gabriel Robins:
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(11): 1462-1465 (1992) - 1991
- [j1]Andrew B. Kahng, Gabriel Robins:
Optimal algorithms for extracting spatial regularity in images. Pattern Recognit. Lett. 12(12): 757-764 (1991)
Conference and Workshop Papers
- 2016
- [c43]Jack Wadden, Nathan Brunelle, Ke Wang, Mohamed El-Hadedy, Gabriel Robins, Mircea Stan, Kevin Skadron:
Generating efficient and high-quality pseudo-random behavior on Automata Processors. ICCD 2016: 622-629 - [c42]Jack Wadden, Vinh Dang, Nathan Brunelle, Tommy Tracy II, Deyuan Guo, Elaheh Sadredini, Ke Wang, Chunkun Bo, Gabriel Robins, Mircea Stan, Kevin Skadron:
ANMLzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures. IISWC 2016: 105-166 - 2015
- [c41]Nathan Brunelle, Gabriel Robins, Abhi Shelat:
Compression-Aware Algorithms for Massive Datasets. DCC 2015: 441 - [c40]Andrew B. Kahng, Mulong Luo, Gi-Joon Nam, Siddhartha Nath, David Z. Pan, Gabriel Robins:
Toward Metrics of Design Automation Research Impact. ICCAD 2015: 263-270 - 2013
- [c39]Nathan Brunelle, Gabriel Robins, Abhi Shelat:
Algorithms for Compressed Inputs. DCC 2013: 478 - [c38]Kirti Chawla, Christopher McFarland, Gabriel Robins, Connor Shope:
Real-time RFID localization using RSS. ICL-GNSS 2013: 1-6 - 2012
- [c37]Jiawei Huang, John C. Lach, Gabriel Robins:
A methodology for energy-quality tradeoff using imprecise hardware. DAC 2012: 504-509 - 2010
- [c36]Kirti Chawla, Gabriel Robins, Liuyi Zhang:
Efficient RFID-based mobile object localization. WiMob 2010: 683-690 - 2007
- [c35]Leonid Bolotnyy, Scott Krize, Gabriel Robins:
The Practicality of Multi-Tag RFID Systems. IWRT 2007: 100-116 - [c34]Leonid Bolotnyy, Gabriel Robins:
Physically Unclonable Function-Based Security and Privacy in RFID Systems. PerCom 2007: 211-220 - 2006
- [c33]Leonid Bolotnyy, Gabriel Robins:
Generalized "Yoking-Proofs" for a Group of RFID Tags. MobiQuitous 2006: 1-4 - 2005
- [c32]Leonid Bolotnyy, Gabriel Robins:
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification. AutoID 2005: 43-48 - [c31]Leonid Bolotnyy, Gabriel Robins:
Multi-Tag Radio Frequency Identification Systems. AutoID 2005: 83-88 - 2004
- [c30]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng:
Evaluation of the new OASIS format for layout fill compression. ICECS 2004: 377-382 - 2003
- [c29]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng:
Area Fill Generation With Inherent Data Volume Reduction. DATE 2003: 10868-10875 - 2002
- [c28]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky:
Closing the smoothness and uniformity gap in area fill synthesis. ISPD 2002: 137-142 - 2001
- [c27]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky:
Hierarchical dummy fill for process uniformity. ASP-DAC 2001: 139-144 - 2000
- [c26]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky:
Monte-Carlo algorithms for layout density control. ASP-DAC 2000: 523-528 - [c25]Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky:
Practical iterated fill synthesis for CMP uniformity. DAC 2000: 671-674 - [c24]Gabriel Robins, Alexander Zelikovsky:
Improved Steiner tree approximation in graphs. SODA 2000: 770-779 - 1999
- [c23]Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky:
New Multilevel and Hierarchical Algorithms for Layout Density Control. ASP-DAC 1999: 221-224 - [c22]Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky:
New and Exact Filling Algorithms for Layout Density Control. VLSI Design 1999: 106-110 - 1998
- [c21]Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
Improved Approximation Bounds for the Group Steiner Problem. DATE 1998: 406-413 - [c20]Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
Moving-Target TSP and Related Problems. ESA 1998: 453-464 - [c19]Andrew B. Kahng, Gabriel Robins, Anish Singh, Huijuan Wang, Alexander Zelikovsky:
Filling and slotting: analysis and algorithms. ISPD 1998: 95-102 - 1997
- [c18]C. Douglass Bateman, Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
Provably good routing tree construction with multi-port terminals. ISPD 1997: 96-102 - 1995
- [c17]Michael J. Alexander, Gabriel Robins:
New Performance-Driven FPGA Routing Algorithms. DAC 1995: 562-567 - [c16]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 - [c15]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 - 1994
- [c14]Gabriel Robins, Jeffrey S. Salowe:
On the Maximum Degree of Minimum Spanning Trees. SCG 1994: 250-258 - [c13]Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins:
Rectilinear Steiner Trees with Minimum Elmore Delay. DAC 1994: 381-386 - [c12]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 - [c11]Bernard A. McCoy, Gabriel Robins:
Non-Tree Routing. EDAC-ETC-EUROASIC 1994: 430-434 - [c10]Todd D. Hodes, Bernard A. McCoy, Gabriel Robins:
Dynamically-Wiresized Elmore-Based Routing Constructions. ISCAS 1994: 463-466 - 1993
- [c9]Kenneth D. Boese, Andrew B. Kahng, Gabriel Robins:
High-Performance Routing Trees With Identified Critical Sinks. DAC 1993: 182-187 - [c8]Tim Barrera, Jeff Griffith, Sally A. McKee, Gabriel Robins, Tongtong Zhang:
Toward a Steiner engine: enhanced serial and parallel implementations of the iterated 1-Steiner MRST algorithm. Great Lakes Symposium on VLSI 1993: 90-94 - [c7]Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins:
Fidelity and Near-Optimality of Elmore-Based Routing Constructions. ICCD 1993: 81-84 - [c6]Charles J. Alpert, Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh:
Minimum Density Interconneciton Trees. ISCAS 1993: 1865-1868 - 1991
- [c5]Andrew B. Kahng, Jason Cong, Gabriel Robins:
High-Performance Clock Routing Based on Recursive Geometric Aatching. DAC 1991: 322-327 - [c4]Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, C. K. Wong:
Performance-Driven Global Routing for Cell Based ICs. ICCD 1991: 170-173 - 1990
- [c3]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
- [c2]Gabriel Robins:
Signal Constellation Design Tool: A Case Study in User Interface Synthesis. ICCAL 1989: 452-467 - 1986
- [c1]Thomas Kaczmarek, Raymond Bates, Gabriel Robins:
Recent Developments in NIKL. AAAI 1986: 978-985
Reference Works
- 2008
- [r2]Jiang Hu, Gabriel Robins, Cliff C. N. Sze:
Timing-Driven Interconnect Synthesis. Handbook of Algorithms for Physical Design Automation 2008 - [r1]Gabriel Robins, Alexander Zelikovsky:
Minimum Steiner Tree Construction. Handbook of Algorithms for Physical Design Automation 2008
Informal and Other Publications
- 2016
- [i2]Ritambhara Singh, Jack Lanchantin, Gabriel Robins, Yanjun Qi:
DeepChrome: Deep-learning for predicting gene expression from histone modifications. CoRR abs/1607.02078 (2016) - [i1]Ritambhara Singh, Jack Lanchantin, Gabriel Robins, Yanjun Qi:
Transfer String Kernel for Cross-Context DNA-Protein Binding Prediction. CoRR abs/1609.03490 (2016)
Coauthor Index
aka: Alexander Zelikovsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
