default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSartaj Sahni
Sartaj K. Sahni
Person information
- affiliation: University of Florida, Gainesville, USA
- award (2003): W. Wallace McDowell Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j197]Sanaz Gheibi, Tania Banerjee
, Sanjay Ranka, Sartaj Sahni:
Path Algorithms for Contact Sequence Temporal Graphs. Algorithms 17(4): 148 (2024)- 2023
- [c165]Joyanta Basak, Sartaj Sahni, Sanguthevar Rajasekaran:
SuperBlocking: An Efficient Blocking Technique for Record Linkage. IEEE Big Data 2023: 498-503 - [c164]Joyanta Basak, Ahmed Soliman, Nachiket Deo, Kenneth Haase, Anup Mathur, Krista Park, Rebecca C. Steorts, Daniel Weinberg, Sartaj Sahni, Sanguthevar Rajasekaran:
On Computing the Jaro Similarity Between Two Strings. ISBRA 2023: 31-44 - [c163]Anuj Jain, Sartaj Sahni:
Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle. ISCC 2023: 392-398 - 2022
- [j196]Anuj Jain, Sartaj Sahni:
Foremost Walks and Paths in Interval Temporal Graphs. Algorithms 15(10): 361 (2022) - [j195]Anuj Jain, Sartaj K. Sahni:
Algorithms for optimal min hop and foremost paths in interval temporal graphs. Appl. Netw. Sci. 7(1): 60 (2022) - [c162]Anuj Jain, Sartaj Sahni:
Min-Hop Foremost Paths in Interval Temporal Graphs. IC3 2022: 646-652 - 2021
- [j194]Sartaj Sahni, Albert Y. Zomaya:
In Memoriam Eliezer Dekel (1948-2020). ACM Comput. Surv. 53(2): 23:1-23:2 (2021) - [j193]Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 32(7): 825 (2021) - [j192]Soham Das, Sartaj Sahni:
Two-Aggregator Topology Optimization Using Single Paths in Data Center Networks. IEEE Trans. Cloud Comput. 9(2): 807-820 (2021) - [c161]Sanaz Gheibi, Tania Banerjee, Sanjay Ranka, Sartaj Sahni:
An Effective Data Structure for Contact Sequence Temporal Graphs. ISCC 2021: 1-8 - [c160]Anuj Jain, Sartaj Sahni:
Min Hop and Foremost Paths in Interval Temporal Graphs. ISCC 2021: 1-7 - 2020
- [j191]Chunchun Zhao, Sartaj Sahni:
Linear space string correction algorithm using the Damerau-Levenshtein distance. BMC Bioinform. 21-S(1): 4 (2020) - [j190]Anuj Jain, Sartaj Sahni:
Cache efficient Value Iteration using clustering and annealing. Comput. Commun. 159: 186-197 (2020) - [j189]Adeesha Wijayasiri, Tania Banerjee, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Multiobjective Optimization of SAR Reconstruction on Hybrid Multicore Systems. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 13: 4674-4688 (2020) - [c159]Chunchun Zhao, Sartaj Sahni:
Efficient Computation of RNA Partition Functions Using McCaskill's Algorithm. FedCSIS 2020: 449-452 - [c158]Sanaz Gheibi, Tania Banerjee, Sanjay Ranka, Sartaj Sahni:
Cache Efficient Louvain with Local RCM. ISCC 2020: 1-6 - [c157]Anuj Jain, Sartaj Sahni:
Value Iteration on Multicore Processors. ISSPIT 2020: 1-7
2010 – 2019
- 2019
- [j188]Chunchun Zhao, Sartaj Sahni:
String correction using the Damerau-Levenshtein distance. BMC Bioinform. 20-S(11): 277:1-277:28 (2019) - [j187]Soham Das, Sartaj Sahni:
Two-Aggregator Topology Optimization Using Multiple Paths in Data Center Networks. IEEE Trans. Cloud Comput. 7(4): 1139-1151 (2019) - [c156]Anuj Jain, Sartaj Sahni:
Cache Efficient Value Iteration. ISCC 2019: 1-6 - [c155]Sanaz Gheibi, Tania Banerjee, Sanjay Ranka, Sartaj Sahni:
Multilevel Approaches to Fine Tune Performance of Linear Algebra Libraries. ISSPIT 2019: 1-6 - 2018
- [j186]Adeesha Wijayasiri, Tania Banerjee, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Dynamic Data-Driven SAR Image Reconstruction Using Multiple GPUs. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 11(11): 4326-4338 (2018) - [c154]Adeesha Wijayasiri, Tania Banerjee, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Performance and Energy Evaluation of SAR Reconstruction on Intel Knights Landing. IGSC 2018: 1-8 - [c153]Adeesha Wijayasiri, Sanjay Ranka, Sartaj Sahni:
Dynamic Data Driven SAR Reconstruction on Hybrid Multicore systems. IGSC 2018: 1-2 - [c152]Chunchun Zhao, Sartaj Sahni:
Linear Space String Correction Algorithm Using The Damerau-Levenshtein Distance. ICCABS 2018: 1 - [p1]Sartaj Sahni:
Rounding, Interval Partitioning and Separation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 157-172 - 2017
- [j185]Chunchun Zhao, Sartaj Sahni:
Cache and energy efficient algorithms for Nussinov's RNA Folding. BMC Bioinform. 18(15): 15-30 (2017) - [j184]Anshu Ranjan, Pramod P. Khargonekar, Sartaj Sahni:
Offline first-fit decreasing height scheduling of power loads. J. Sched. 20(5): 527-542 (2017) - [c151]Adeesha Wijayasiri, Tania Banerjee, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Parallel Dynamic Data Driven Approaches for Synthetic Aperture Radar. HiPC 2017: 193-202 - [c150]Chunchun Zhao, Sartaj Sahni:
Efficient computation of the Damerau-Levenshtein distance between biological sequences. ICCABS 2017: 1 - [c149]Chunchun Zhao, Sartaj Sahni:
Efficient RNA folding using Zuker's method. ICCABS 2017: 1-6 - [c148]Abdur R. Shahid, Liz Jeukeng, Wei Zeng, Niki Pissinou, S. S. Iyengar, Sartaj Sahni, Maite Varela-Conover:
PPVC: Privacy Preserving Voronoi Cell for location-based services. ICNC 2017: 351-355 - [c147]Soham Das, Sartaj Sahni:
Two-aggregator topology optimization without splitting in data center networks. ISCC 2017: 310-315 - 2016
- [j183]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 27(8): 895-896 (2016) - [c146]Chunchun Zhao, Sartaj Sahni:
Cache and energy efficient algorithms for Nussinov RNA folding. ICCABS 2016: 1 - [c145]Anshu Ranjan, Pramod P. Khargonekar, Sartaj Sahni:
Smart grid power scheduling via bottom left decreasing height packing. ISCC 2016: 1128-1133 - [c144]Adeesha Wijayasiri, Tania Banerjee, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Dynamic data driven image reconstruction using multiple GPUs. ISSPIT 2016: 241-246 - 2015
- [j182]Arto Salomaa, Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni:
Alberto Apostolico. Int. J. Found. Comput. Sci. 26(5) (2015) - [j181]Soham Das, Sartaj Sahni:
Network topology optimisation for data aggregation using multiple paths. Int. J. Metaheuristics 4(2): 115-140 (2015) - [j180]Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni:
Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics. JOCN 7(6): 540-553 (2015) - [j179]Tania Banerjee, Sartaj Sahni, Gunasekaran S. Seetharaman:
PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers. IEEE Trans. Computers 64(4): 1104-1118 (2015) - [j178]Tania Banerjee-Mishra, Sartaj Sahni:
Pubsub: An Efficient Publish/Subscribe System. IEEE Trans. Computers 64(4): 1119-1132 (2015) - [j177]Mahathir Almashor, Ibrahim Khalil, Zahir Tari, Albert Y. Zomaya, Sartaj Sahni:
Enhancing Availability in Content Delivery Networks for Mobile Platforms. IEEE Trans. Parallel Distributed Syst. 26(8): 2247-2257 (2015) - [c143]Chunchun Zhao, Sartaj Sahni:
Cache and energy efficient alignment of very long sequences. ICCABS 2015: 1-6 - [c142]Soham Das, Sartaj Sahni:
Two-aggregator network topology optimization with splitting. ISCC 2015: 683-688 - [c141]Anshu Ranjan, Pramod P. Khargonekar, Sartaj Sahni:
Offline first fit scheduling in smart grids. ISCC 2015: 758-763 - [e9]Jaime Lloret Mauri, Sabu M. Thampi, Michal Wozniak, Oge Marques, Dilip Krishnaswamy, Sartaj Sahni, Christian Callegari, Hideyuki Takagi, Zoran S. Bojkovic, Vinod M., Neeli R. Prasad, José M. Alcaraz Calero, Joal Rodrigues, Xinyu Que, Natarajan Meghanathan, Ravi S. Sandhu, Edward Au:
2015 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2015, Kochi, India, August 10-13, 2015. IEEE 2015, ISBN 978-1-4799-8790-0 [contents] - 2014
- [j176]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Multicore and GPU algorithms for Nussinov RNA folding. BMC Bioinform. 15(S-8): S1 (2014) - [j175]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Pairwise sequence alignment for very long sequences on GPUs. Int. J. Bioinform. Res. Appl. 10(4/5): 345-368 (2014) - [j174]Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran:
PMS6: a fast algorithm for motif discovery. Int. J. Bioinform. Res. Appl. 10(4/5): 369-383 (2014) - [j173]Tachun Lin, Zhili Zhou, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni:
Unified Mathematical Programming Frameworks for Survivable Logical Topology Routing in IP-over-WDM Optical Networks. JOCN 6(2): 190-203 (2014) - [j172]Tania Banerjee-Mishra, Sartaj Sahni, Gunasekaran S. Seetharaman:
PC-DUOS+: A TCAM Architecture for Packet Classifiers. IEEE Trans. Computers 63(6): 1527-1540 (2014) - [c140]Soham Das, Sartaj Sahni:
Network Topology Optimization for Data Aggregation. CCGRID 2014: 493-501 - [c139]Rui L. Aguiar, Sartaj Sahni:
Message from the general co-chairs. ISCC 2014: 1 - [c138]William Chapman, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz, Linda Moore, Bracy Elton:
A framework for rendering high resolution synthetic aperture radar images on heterogeneous architectures. ISCC 2014: 1-6 - [c137]Anshu Ranjan, Pramod P. Khargonekar, Sartaj Sahni:
Offline preemptive scheduling of power demands to minimize peak power in smart grids. ISCC 2014: 1-6 - [c136]Soham Das, Sartaj Sahni:
Network topology optimization for data aggregation with splitting. ISSPIT 2014: 398-403 - 2013
- [j171]Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran:
PMS6MC: A Multicore Algorithm for Motif Discovery. Algorithms 6(4): 805-823 (2013) - [j170]Xinyan Zha, Sartaj Sahni:
GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU. IEEE Trans. Computers 62(6): 1156-1169 (2013) - [c135]Guna Seetharaman, Eric T. Hayden, Mark S. Schmalz, William Chapman, Sanjay Ranka, Sartaj K. Sahni:
Dynamic multistatic synthetic aperture radar (DMSAR) with image reconstruction algorithms and analysis. AIPR 2013: 1-9 - [c134]Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran:
PMS6MC: A multicore algorithm for motif discovery. ICCABS 2013: 1-5 - [c133]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Multicore and GPU algorithms for nussinov RNA folding. ICCABS 2013: 1-2 - [c132]Tania Banerjee-Mishra, Sartaj Sahni:
PUBSUB: An efficient publish/subscribe system. ISCC 2013: 606-611 - [c131]Sartaj Sahni, Begoña García Zapirain, Kostas Berberidis, Ioannis Krikidis:
IEEE ISSPIT 2013: Message from the TPC chairs. ISSPIT 2013: 163 - 2012
- [j169]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa:
Sheng Yu. Int. J. Found. Comput. Sci. 23(2) (2012) - [j168]Tania Mishra, Sartaj Sahni:
PETCAM - A Power Efficient TCAM Architecture for Forwarding Tables. IEEE Trans. Computers 61(1): 3-17 (2012) - [j167]Tania Banerjee-Mishra, Sartaj Sahni:
Consistent Updates for Packet Classifiers. IEEE Trans. Computers 61(9): 1284-1295 (2012) - [j166]Yan Li, Sanjay Ranka, Sartaj Sahni:
In-advance path reservation for file transfers in e-science applications. J. Supercomput. 59(3): 1167-1187 (2012) - [c130]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Parallel syntenic alignment on GPUs. BCB 2012: 266-273 - [c129]Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran:
PMS6: A fast algorithm for motif discovery. ICCABS 2012: 1-6 - [c128]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Pairwise sequence alignment for very long sequences on GPUs. ICCABS 2012: 1-6 - [c127]Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni:
Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. ICUMT 2012: 650-656 - [c126]Tania Banerjee-Mishra, Sartaj Sahni, Gunasekaran S. Seetharaman:
PC-TRIO: An indexed TCAM architecture for packet classifiers. ISCC 2012: 325-330 - [c125]Eric T. Hayden, Mark S. Schmalz, William Chapman, Sanjay Ranka, Sartaj Sahni, Gunasekara Seetharaman:
Techniques for mapping synthetic aperture radar processing algorithms to multi-GPU clusters. ISSPIT 2012: 13-18 - [e8]James J. Park, Albert Y. Zomaya, Sang-Soo Yeo, Sartaj Sahni:
Network and Parallel Computing, 9th IFIP International Conference, NPC 2012, Gwangju, Korea, September 6-8, 2012. Proceedings. Lecture Notes in Computer Science 7513, Springer 2012, ISBN 978-3-642-35605-6 [contents] - [r9]Tania Mishra, Sartaj Sahni:
Green TCAM-Based Internet Routers. Handbook of Energy-Aware and Green Computing 2012: 283-308 - 2011
- [c124]Shibdas Bandyopadhyay, Sartaj Sahni:
Sorting Large Multifield Records on a GPU. ICPADS 2011: 149-156 - [c123]Junjie Li, Sanjay Ranka, Sartaj Sahni:
Strassen's Matrix Multiplication on GPUs. ICPADS 2011: 157-164 - [c122]Xinyan Zha, Daniele Paolo Scarpazza, Sartaj Sahni:
Highly compressed multi-pattern string matching on the cell broadband engine. ISCC 2011: 257-264 - [c121]Tania Mishra, Sartaj Sahni, Gunasekaran S. Seetharaman:
PC-DUOS: Fast TCAM lookup and update for packet classifiers. ISCC 2011: 265-270 - [c120]Xinyan Zha, Sartaj Sahni:
Multipattern string matching on a GPU. ISCC 2011: 277-282 - [c119]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni:
Workflow scheduling in e-Science networks. ISCC 2011: 432-437 - [c118]Yan Li, Sanjay Ranka, Sartaj Sahni:
Wavelength scheduling in Time-domain Wavelength Interleaved Networks. ISCC 2011: 519-524 - [c117]William Chapman, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz, Uttam K. Majumder, Linda Moore, Bracy Elton:
Parallel processing techniques for the processing of synthetic aperture radar data on GPUs. ISSPIT 2011: 573-580 - [c116]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph F. JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz A. Shirazi, Alan Sussman, Charles C. Weems, Jie Wu:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618 - [e7]Sumeet Dua, Sartaj Sahni, D. P. Goyal:
Information Intelligence, Systems, Technology and Management - 5th International Conference, ICISTM 2011, Gurgaon, India, March 10-12, 2011. Proceedings. Communications in Computer and Information Science 141, Springer 2011, ISBN 978-3-642-19422-1 [contents] - 2010
- [j165]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni:
Topology Aggregation for e-Science Networks. Int. J. Next Gener. Comput. 1(1) (2010) - [j164]Wencheng Lu, Sartaj Sahni:
Recursively Partitioned Static IP Router Tables. IEEE Trans. Computers 59(12): 1683-1690 (2010) - [j163]Wencheng Lu, Sartaj Sahni:
Low-Power TCAMs for Very Large Forwarding Tables. IEEE/ACM Trans. Netw. 18(3): 948-959 (2010) - [j162]Xiaochun Xu, Nageswara S. V. Rao, Sartaj Sahni:
A computational geometry method for localization using differences of distances. ACM Trans. Sens. Networks 6(2): 10:1-10:25 (2010) - [c115]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni:
Bandwidth Allocation for Iterative Data-Dependent E-science Applications. CCGRID 2010: 233-242 - [c114]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni:
Topology Aggregation for E-science Networks. CCGRID 2010: 530-533 - [c113]Xinyan Zha, Sartaj Sahni:
Fast in-Place File Carving for Digital Forensics. e-Forensics 2010: 141-158 - [c112]Shibdas Bandyopadhyay, Sartaj Sahni:
GRS - GPU radix sort for multifield records. HiPC 2010: 1-10 - [c111]Sartaj Sahni:
Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture. ICDCN 2010: 3 - [c110]Tania Mishra, Sartaj Sahni:
DUOS - Simple dual TCAM architecture for routing tables with incremental update. ISCC 2010: 503-508 - [c109]Tania Mishra, Sartaj Sahni:
CONSIST-Consistent Internet route updates. ISCC 2010: 509-514 - [c108]Shibdas Bandyopadhyay, Sartaj Sahni:
Sorting large records on a cell broadband engine. ISCC 2010: 939-944 - [c107]William Chapman, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz, Uttam K. Majumder:
Parallel processing techniques for the processing of synthetic aperture radar data on FPGAs. ISSPIT 2010: 17-22 - [c106]Yan Li, Sanjay Ranka, Sartaj Sahni:
First-Slot scheduling with wavelength conversion for distributed file transfers. ISSPIT 2010: 42-47 - [e6]My T. Thai, Sartaj Sahni:
Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings. Lecture Notes in Computer Science 6196, Springer 2010, ISBN 978-3-642-14030-3 [contents] - [e5]Sushil K. Prasad, Harrick M. Vin, Sartaj Sahni, Mahadeo Jaiswal, Bundit Thipakorn:
Information Systems, Technology and Management - 4th International Conference, ICISTM 2010, Bangkok, Thailand, March 11-13, 2010. Proceedings. Communications in Computer and Information Science 54, Springer 2010, ISBN 978-3-642-12034-3 [contents]
2000 – 2009
- 2009
- [j161]Joongseok Park, Sartaj Sahni:
Power Assignment for Symmetric Communication in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 5(2): 185-200 (2009) - [j160]Wencheng Lu, Sartaj Sahni:
Efficient 2D Multibit Tries for Packet Classification. IEEE Trans. Computers 58(12): 1695-1709 (2009) - [j159]Wencheng Lu, Sartaj Sahni:
Succinct representation of static packet classifiers. IEEE/ACM Trans. Netw. 17(3): 803-816 (2009) - [c105]Nageswara S. V. Rao, Charles W. Glover, Mallikarjun Shankar, Jren-Chit Chin, David K. Y. Yau, Chris Y. T. Ma, Yong Yang, Sartaj Sahni:
Improved SPRT detection using localization with application to radiation sources. FUSION 2009: 633-640 - [c104]Yan Li, Sanjay Ranka, Sartaj Sahni, Mark S. Schmalz:
Network Centered Multiple Resource Scheduling in e-Science Applications. GridNets 2009: 37-44 - [c103]Yan Li, Sanjay Ranka, Sartaj Sahni:
In-advance path reservation for file transfers In e-Science applications. ISCC 2009: 176-181 - [c102]Shibdas Bandyopadhyay, Sartaj Sahni:
Sorting on a Cell Broadband Engine SPU. ISCC 2009: 218-223 - [c101]Tania Mishra, Sartaj Sahni:
PETCAM-A power Efficient TCAM for forwarding tables. ISCC 2009: 224-229 - [c100]Sartaj Sahni:
Data Structures and Algorithms for Packet Forwarding and Classification. ISPAN 2009: 3 - [e4]Sushil K. Prasad, Susmi Routray, Reema Khurana, Sartaj Sahni:
Information Systems, Technology and Management - Third International Conference, ICISTM 2009, Ghaziabad, India, March 12-13, 2009. Proceedings. Communications in Computer and Information Science 31, Springer 2009, ISBN 978-3-642-00404-9 [contents] - 2008
- [j158]Wencheng Lu, Sartaj Sahni:
Packet Classification Using Space-Efficient Pipelined Multibit Tries. IEEE Trans. Computers 57(5): 591-605 (2008) - [j157]Shigang Chen, Meongchul Song, Sartaj Sahni:
Two techniques for fast computation of constrained shortest paths. IEEE/ACM Trans. Netw. 16(1): 105-115 (2008) - [c99]Nageswara S. V. Rao, Mallikarjun Shankar, Jren-Chit Chin, David K. Y. Yau, Chris Y. T. Ma, Yong Yang, Jennifer C. Hou, Xiaochun Xu, Sartaj Sahni:
Localization under random measurements with application to radiation sources. FUSION 2008: 1-8 - [c98]Xiaochun Xu, Sartaj Sahni, Nageswara S. V. Rao:
On basic properties of localization using distance-difference measurements. FUSION 2008: 1-8 - [c97]Xiaochun Xu, Sartaj Sahni, Nageswara S. V. Rao:
Minimum-cost sensor coverage of planar regions. FUSION 2008: 1-8 - [c96]Wencheng Lu, Sartaj Sahni:
Low Power TCAMs for Very Large Forwarding Tables. INFOCOM 2008: 316-320 - [c95]Eun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni:
Performance evaluation of routing and wavelength assignment algorithms for optical networks. ISCC 2008: 62-67 - [c94]Xinyan Zha, Sartaj Sahni:
Highly compressed Aho-Corasick automata for efficient intrusion detection. ISCC 2008: 298-303 - [c93]Sartaj Sahni:
Sensor Deployment and Source Localization. ISPAN 2008: 67 - [c92]Eun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni:
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks. ISPAN 2008: 133-138 - 2007
- [j156]Kun Suk Kim, Sartaj Sahni:
Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE Trans. Computers 56(1): 32-43 (2007) - [j155]Xiaochun Xu, Sartaj Sahni:
Approximation Algorithms for Sensor Deployment. IEEE Trans. Computers 56(12): 1681-1695 (2007) - [j154]Haibin Lu, Sartaj Sahni:
O(logW) multidimensional packet classification. IEEE/ACM Trans. Netw. 15(2): 462-472 (2007) - [c91]Nageswara S. V. Rao, Xiaochun Xu, Sartaj Sahni:
A computational geometry method for DTOA triangulation. FUSION 2007: 1-7 - [c90]Sartaj Sahni, Nageswara S. V. Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath:
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks. ICN 2007: 47 - [c89]Wencheng Lu, Sartaj Sahni:
Succinct Representation of Static Packet Forwarding Tables. ICN 2007: 78 - [c88]Sartaj Sahni, Haibin Lu:
Dynamic Tree Bitmap for IP Lookup and Update. ICN 2007: 79 - [c87]Wencheng Lu, Sartaj Sahni:
Recursively Partitioned Static IP Router-Tables. ISCC 2007: 437-442 - [c86]Wencheng Lu, Sartaj Sahni:
Succinct Representation Of Static Packet Classifiers. ISCC 2007: 1119-1124 - [r8]Sartaj Sahni:
Rounding, Interval Partitioning, and Separation. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r7]Chih-Fang Wang, Sartaj Sahni:
Optical Transpose Systems. Handbook of Parallel Computing 2007 - 2006
- [j153]Meongchul Song, Sartaj Sahni:
Approximation Algorithms for Multiconstrained Quality-of-Service Routing. IEEE Trans. Computers 55(5): 603-617 (2006) - [j152]Joongseok Park, Sartaj Sahni:
An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks. IEEE Trans. Computers 55(8): 1048-1056 (2006) - [c85]Joongseok Park, Sartaj Sahni:
Power Assignment For Symmetric Communication InWireless Sensor Networks. ISCC 2006: 591-596 - [c84]Wencheng Lu, Sartaj Sahni:
Packet Forwarding Using Pipelined Multibit Tries. ISCC 2006: 802-807 - [c83]Wencheng Lu, Sartaj Sahni:
Packet Classification Using Pipelined Two-Dimensional Multibit Tries. ISCC 2006: 808-813 - [e3]Sartaj Sahni:
IASTED International Conference on Advances in Computer Science and Technology, January 23-25, 2006, Puerto Vallarta, Mexico. IASTED/ACTA Press 2006, ISBN 0-88986-547-7 [contents] - 2005
- [j151]Sartaj Sahni, Xiaochun Xu:
Algorithms for Wireless Sensor Networks. Int. J. Distributed Sens. Networks 1(1): 35-56 (2005) - [j150]Haibin Lu, Kun Suk Kim, Sartaj K. Sahni:
Prefix and Interval-Partitioned Dynamic IP Router-Tables. IEEE Trans. Computers 54(5): 545-557 (2005) - [j149]Haibin Lu, Sartaj Sahni:
A B-Tree Dynamic Router-Table Design. IEEE Trans. Computers 54(7): 813-824 (2005) - [j148]Joongseok Park, Sartaj Sahni:
Maximum Lifetime Broadcasting in Wireless Networks. IEEE Trans. Computers 54(9): 1081-1090 (2005) - [j147]Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao:
Packet classification consuming small amount of memory. IEEE/ACM Trans. Netw. 13(5): 1135-1145 (2005) - [j146]Haibin Lu, Sartaj Sahni:
Conflict detection and resolution in two-dimensional prefix router tables. IEEE/ACM Trans. Netw. 13(6): 1353-1363 (2005) - [c82]Joongseok Park, Sartaj Sahni:
Maximum lifetime broadcasting in wireless networks. AICCSA 2005: 8 - [c81]Wencheng Lu, Sartaj Sahni:
Packet Classification Using Two-Dimensional Multibit Tries. ISCC 2005: 849-854 - [c80]Sartaj Sahni:
Data Structures and Algorithms for Packet Forwarding and Classification. ISPA 2005: 1 - 2004
- [j145]Sartaj Sahni, Kun Suk Kim:
Efficient Dynamic Lookup For Bursty Access Patterns. Int. J. Found. Comput. Sci. 15(4): 567-591 (2004) - [j144]Sartaj Sahni, Kun Suk Kim:
An O(log n) Dynamic Router-Table Design. IEEE Trans. Computers 53(3): 351-363 (2004) - [j143]Haibin Lu, Sartaj Sahni:
O(log n) Dynamic Router-Tables for Prefixes and Ranges. IEEE Trans. Computers 53(10): 1217-1230 (2004) - [j142]Haibin Lu, Sartaj Sahni:
Enhanced Interval Trees for Dynamic IP Router-Tables. IEEE Trans. Computers 53(12): 1615-1628 (2004) - [c79]Shigang Chen, Meongchul Song, Sartaj Sahni:
Two techniques for fast computation of constrained shortest paths. GLOBECOM 2004: 1348-1352 - [c78]Haibin Lu, Kun Suk Kim, Sartaj Sahni:
Prefix- and interval-partitioned router-tables [IP routing]. GLOBECOM 2004: 1590-1594 - [c77]Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao:
Fast Update Algorithm for IP Forwarding Table Using Independent Sets. HSNMC 2004: 324-335 - [c76]Haibin Lu, Sartaj K. Sahni:
A B-tree dynamic router-table design. ISCC 2004: 840-845 - [c75]Haibin Lu, Sartaj K. Sahni:
Dynamic IP router-tables using highest-priority matching. ISCC 2004: 858-863 - [e2]Dinesh P. Mehta, Sartaj Sahni:
Handbook of Data Structures and Applications. Chapman and Hall/CRC 2004, ISBN 978-1-58488-435-4 [contents] - [r6]Sartaj Sahni:
Analysis of Algorithms. Handbook of Data Structures and Applications 2004 - [r5]Sartaj Sahni:
Leftist Trees. Handbook of Data Structures and Applications 2004 - [r4]Sartaj Sahni:
Double-Ended Priority Queues. Handbook of Data Structures and Applications 2004 - [r3]Sartaj Sahni:
Tries. Handbook of Data Structures and Applications 2004 - [r2]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
IP Router Tables. Handbook of Data Structures and Applications 2004 - [r1]Sartaj Sahni, George L. Vairaktarakis:
The Master-Slave Scheduling Model. Handbook of Scheduling 2004 - 2003
- [j141]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. Int. J. Found. Comput. Sci. 14(3): 337-358 (2003) - [j140]Haejae Jung, Sartaj Sahni:
Supernode Binary Search Trees. Int. J. Found. Comput. Sci. 14(3): 465-490 (2003) - [j139]Anuj Jain, Sartaj Sahni, Jatinder Palta, James Dempsey:
Partitioning 3d Phantoms Into Homogeneous Cuboids. Int. J. Found. Comput. Sci. 14(5): 905-932 (2003) - [j138]Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya:
A blocked all-pairs shortest-paths algorithm. ACM J. Exp. Algorithmics 8 (2003) - [j137]Sartaj Sahni, Kun Suk Kim:
Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4): 650-662 (2003) - [c74]Kun Suk Kim, Sartaj Sahni:
IP Lookup By Binary Search On Prefix Length. ISCC 2003: 77-82 - [c73]Haibin Lu, Sartaj Sahni:
O(log n) Dynamic Router-Tables For Ranges. ISCC 2003: 91-96 - 2002
- [j136]Edward Y. C. Cheng, Sartaj Sahni:
Gate Resizing to Reduce Power Consumption. Int. J. Found. Comput. Sci. 13(3): 405-429 (2002) - [j135]Kun Suk Kim, Sartaj Sahni:
IP Lookup by Binary Search on Prefix Length. J. Interconnect. Networks 3(3-4): 105-128 (2002) - [c72]Sartaj Sahni:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. COCOON 2002: 2 - [c71]Chih-Fang Wang, Sartaj Sahni:
Computational Geometry On The OTIS-Mesh Optoelectronic Computer. ICPP 2002: 501-510 - [c70]Sartaj Sahni, Kun Suk Kim:
O(log n) dynamic packet routing. ISCC 2002: 443-448 - [c69]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. ISPAN 2002: 3- - [c68]Sartaj Sahni, Kun Suk Kim:
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. SAINT 2002: 220-229 - [e1]Sartaj Sahni, Viktor K. Prasanna, Uday Shukla:
High Performance Computing - HiPC 2002, 9th International Conference, Bangalore, India, December 18-21, 2002, Proceedings. Lecture Notes in Computer Science 2552, Springer 2002, ISBN 3-540-00303-7 [contents] - 2001
- [j134]Sartaj Sahni:
Models and Algorithms for Optical and Optoelectronic Parallel Computers. Int. J. Found. Comput. Sci. 12(3): 249-264 (2001) - [j133]Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Local Alignment Search. J. Comb. Optim. 5(1): 117-124 (2001) - [j132]Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Similarity Search. J. Comb. Optim. 5(1): 125-132 (2001) - [j131]Chih-Fang Wang, Sartaj Sahni:
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Computers 50(7): 635-646 (2001) - [j130]Edward Y. C. Cheng, Sartaj K. Sahni:
A Fast Algorithm for Transistor Folding. VLSI Design 12(1): 53-60 (2001) - [c67]Sartaj Sahni, Kun Suk Kim:
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. FTDCS 2001: 178-184 - [c66]Sartaj Sahni:
Models and Algorithms for Optical and Optoelectronic Parallel Computers. IPDPS 2001: 136 - 2000
- [j129]Sanguthevar Rajasekaran, Sartaj Sahni:
Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000) - [j128]Seonghun Cho, Sartaj Sahni:
A New Weight Balanced Binary Search Tree. Int. J. Found. Comput. Sci. 11(3): 485-513 (2000) - [j127]Kyunrak Chong, Sartaj Sahni:
Correspondence-Based Data Structures for Double-Ended Priority Queues. ACM J. Exp. Algorithmics 5: 2 (2000) - [j126]Chih-Fang Wang, Sartaj Sahni:
Image Processing on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distributed Syst. 11(2): 97-109 (2000) - [j125]Sartaj Sahni:
Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network. IEEE Trans. Parallel Distributed Syst. 11(7): 720-728 (2000) - [j124]Sartaj Sahni:
The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations. IEEE Trans. Parallel Distributed Syst. 11(7): 739-748 (2000) - [c65]Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka:
Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426 - [c64]Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya:
A Blocked All-Pairs Shortest-Path Algorithm. SWAT 2000: 419-432
1990 – 1999
- 1999
- [j123]Seonghun Cho, Sartaj Sahni:
Mergeable Double-Ended Priority Queues. Int. J. Found. Comput. Sci. 10(1): 1-18 (1999) - [j122]Edward Y. C. Cheng, Sartaj Sahni:
A Fast Algorithm for Performance-Driven Module Implementation Selection. VLSI Design 10(2): 237-247 (1999) - [c63]Jang-uk In, Canming Jin, Jih-Kwon Peir, Sanjay Ranka, Sartaj Sahni:
A Framework for Matching Applications with Parallel Machines. HiPC 1999: 331-338 - [c62]Sartaj Sahni:
Models and Algorithms for Optical and Optoelectronic Parallel Computers. ISPAN 1999: 2-9 - [c61]Sartaj Sahni, Baba C. Vemuri, F. Chen, C. Kapoor:
Variable-Bit-Lengthn Coding: An Effective Coding Method. VISUAL 1999: 665-672 - [c60]F. Chen, Sartaj Sahni, Baba C. Vemuri:
Efficient Algorithms for Lossless Compression of 2D/3D Images. VISUAL 1999: 681-688 - 1998
- [j121]Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni:
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits. Int. J. Found. Comput. Sci. 9(4): 377-398 (1998) - [j120]Sartaj Sahni, Chih-Fang Wang:
BPC Permutations on the OTIS-Hypercube Optoelectronic Computer. Informatica (Slovenia) 22(3) (1998) - [j119]Seonghun Cho, Sartaj Sahni:
Weight-Biased Leftist Trees and Modified Skip Lists. ACM J. Exp. Algorithmics 3: 2 (1998) - [j118]Baba C. Vemuri, Shuangying Huang, Sartaj Sahni, Christiana Morison Leonard, Cecile Mohr, Robin L. Gilmore, Jeffrey Fitzsimmons:
An efficient motion estimator with application to medical image registration. Medical Image Anal. 2(1): 79-98 (1998) - [j117]Sanguthevar Rajasekaran, Sartaj Sahni:
Randomized Routing, Selection, and Sorting on the OTIS-Mesh. IEEE Trans. Parallel Distributed Syst. 9(9): 833-840 (1998) - [j116]Chih-Fang Wang, Sartaj Sahni:
Basic Operations on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distributed Syst. 9(12): 1226-1236 (1998) - 1997
- [j115]Dinesh P. Mehta, Sartaj K. Sahni:
Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects. J. Syst. Softw. 39(3): 201-221 (1997) - [j114]Sanguthevar Rajasekaran, Sartaj Sahni:
Determinisitic Routing on the Array with Reconfigurable Optical Buses. Parallel Process. Lett. 7(3): 219-224 (1997) - [j113]Andrew Lim, Venkat Thanvantri, Sartaj Sahni:
Planar topological routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(6): 651-656 (1997) - [j112]Ju-wook Jang, Madhusudan Nigam, Viktor K. Prasanna, Sartaj Sahni:
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh. IEEE Trans. Parallel Distributed Syst. 8(1): 1-12 (1997) - [j111]Sanguthevar Rajasekaran, Sartaj Sahni:
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. IEEE Trans. Parallel Distributed Syst. 8(11): 1123-1132 (1997) - [c59]Sartaj Sahni, George L. Vairaktarakis:
Scheduling For Distributed Computing. FTDCS 1997: 284-289 - [c58]Baba C. Vemuri, Shuangying Huang, Sartaj Sahni, Christiana Morison Leonard, Cecile Mohr, T. Lucas, Robin L. Gilmore, Jeffrey Fitzsimmons:
A Robust and Efficient Algorithm for Image Registration. IPMI 1997: 465-470 - 1996
- [j110]Sartaj Sahni, Venkat Thanvantri:
Performance metrics: keeping the focus on runtime. IEEE Parallel Distributed Technol. Syst. Appl. 4(1): 43-56 (1996) - [j109]Sartaj Sahni, George L. Vairaktarakis:
The master-slave paradigm in parallel computer and industrial settings. J. Glob. Optim. 9(3-4): 357-377 (1996) - [j108]Allan Gottlieb, Kai Hwang, Sartaj Sahni:
Editorial Announcement. J. Parallel Distributed Comput. 35(1): 1 (1996) - [j107]Sanguthevar Rajasekaran, Sartaj Sahni:
Sorting and Selection on Distributed Memory Bus Computers. Parallel Algorithms Appl. 8(3-4): 179-193 (1996) - [j106]Sartaj Sahni:
Scheduling Master-Slave Multiprocessor Systems. IEEE Trans. Computers 45(10): 1195-1199 (1996) - [j105]Mario Alberto López, Ravi Janardan, Sartaj K. Sahni:
Efficient net extraction for restricted orientation designs [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(9): 1151-1159 (1996) - [j104]Venkat Thanvantri, Sartaj Sahni:
Optimal folding of standard and custom cells. ACM Trans. Design Autom. Electr. Syst. 1(1): 123-143 (1996) - [c57]Seonghun Cho, Sartaj Sahni:
Weight Biased Leftist Trees and Modified Skip Lists. COCOON 1996: 361-370 - 1995
- [j103]Allan Gottlieb, Kai Hwang, Sartaj Sahni:
Editorial Message. J. Parallel Distributed Comput. 31(2): 99-100 (1995) - [j102]Doowon Paik, Sartaj Sahni:
Network upgrading problems. Networks 26(1): 45-58 (1995) - [j101]Sartaj Sahni:
Data Manipulation on the Distributed Memory Bus Computer. Parallel Process. Lett. 5: 3-14 (1995) - [j100]Venkat Thanvantri, Sartaj Sahni:
Folding a stack of equal width components. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(6): 775-780 (1995) - [j99]Seonghun Cho, Sartaj Sahni:
Minimum area joining of compacted cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(7): 903-909 (1995) - [j98]Madhusudan Nigam, Sartaj Sahni:
Sorting n2 Numbers on n×n Meshes. IEEE Trans. Parallel Distributed Syst. 6(12): 1221-1225 (1995) - [j97]Kyunrak Chong, Sartaj Sahni:
Flipping Modules to Minimize Maximum Wire Length. VLSI Design 3(1): 37-41 (1995) - [c56]Sartaj Sahni:
Scheduling Master-Slave Multiprocessor Systems. Euro-Par 1995: 611-622 - [c55]Sanguthevar Rajasekaran, Sartaj Sahni:
Sorting and Selection on Distributed Memory Bus Computers. ICPP (3) 1995: 151-154 - [c54]Sartaj Sahni:
The DMBC: Architecture and Fundamental Operations. International Conference on Supercomputing 1995: 60-66 - [c53]Andrew Lim, Sartaj K. Sahni, Venkat Thanvantri:
A fast algorithm to test planar topological routability. VLSI Design 1995: 8-12 - 1994
- [b5]Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed:
Grundlagen von Datenstrukturen in C. Informatik Lehrbuch-Reihe, International Thomson 1994, ISBN 978-3-929821-00-0, pp. I-XVII, 1-617 - [j96]Andrew Lim, Sartaj Sahni:
Segmented Winner Trees. J. Inf. Process. Cybern. 30(1): 29-43 (1994) - [j95]Jing-Fu Jenq, Sartaj Sahni:
Reconfigurable Mesh Algorithms for the Hough Transform. J. Parallel Distributed Comput. 20(1): 69-77 (1994) - [j94]Madhusudan Nigam, Sartaj Sahni:
Sorting n Numbers on n x n Reconfigurable Meshes with Buses. J. Parallel Distributed Comput. 23(1): 37-48 (1994) - [j93]Dinesh P. Mehta, Sartaj Sahni:
Computing Display Conflicts in String Visualization. IEEE Trans. Computers 43(3): 350-361 (1994) - [j92]Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni:
Deleting Vertices to Bound Path Length. IEEE Trans. Computers 43(9): 1091-1096 (1994) - [j91]San-Yuan Wu, Sartaj Sahni:
Fast Algorithms to Partition Simple Rectilinear Polygons. VLSI Design 1(3): 193-215 (1994) - [c52]Venkat Thanvantri, Sartaj K. Sahni:
Folding a stack of equal width components. ICCAD 1994: 432-435 - [c51]Madhusudan Nigam, Sartaj Sahni:
Triangulation on a Reconfigurable Mesh With Buses. ICPP (3) 1994: 251-257 - [c50]Madhusudan Nigam, Sartaj Sahni:
Computational Geometry on a Reconflgurable Mesh. IPPS 1994: 86-93 - [c49]Keumog Ahn, Sartaj Sahni:
Flipping Modules to Improve Circuit Performance and Routability. VLSI Design 1994: 127-132 - 1993
- [b4]Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed:
Fundamentals of data structures in C. Computer Science Press 1993, ISBN 978-0-7167-8250-6, pp. I-XVII, 1-585 - [j90]Jing-Fu Jenq, Sartaj Sahni:
Histogramming on a Reconfigurable Mesh Computer. Parallel Algorithms Appl. 1(3): 179-190 (1993) - [j89]Andrew Lim, Siu-Wing Cheng, Sartaj Sahni:
Optimal Joining of Compacted Cells. IEEE Trans. Computers 42(5): 597-607 (1993) - [j88]Dinesh P. Mehta, Sartaj Sahni:
A Data Structure for Circular String Analysis and Visualization. IEEE Trans. Computers 42(8): 992-997 (1993) - [j87]Keumog Ahn, Sartaj Sahni:
NP-Hard Module Rotation Problems. IEEE Trans. Computers 42(12): 1506-1510 (1993) - [j86]Kyunrak Chong, Sartaj Sahni:
Minimizing total wire length by flipping modules. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(1): 167-175 (1993) - [j85]Keumog Ahn, Sartaj Sahni:
Constrained via minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(2): 273-282 (1993) - [j84]Kyunrak Chong, Sartaj Sahni:
Optimal realizations of floorplans [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(6): 793-801 (1993) - [j83]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the circuit implementation problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(8): 1147-1156 (1993) - [j82]Doowon Paik, Sartaj Sahni:
Optimal folding of bit sliced stacks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(11): 1679-1685 (1993) - [j81]Jing-Fu Jenq, Sartaj Sahni:
Image Shrinking and Expanding on a Pyramid. IEEE Trans. Parallel Distributed Syst. 4(11): 1291-1296 (1993) - [c48]Mario Alberto López, Ravi Janardan, Sartaj K. Sahni:
A fast algorithm for VLSI net extraction. ICCAD 1993: 770-774 - [c47]Madhusudan Nigam, Sartaj Sahni:
Sorting n2 Numbers on n x n Meshes. IPPS 1993: 73-78 - [c46]Madhusudan Nigam, Sartaj Sahni:
Sorting n Numbers on n x n Reconfigurable Meshes with Buses. IPPS 1993: 174-181 - [c45]Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni:
Heuristics for the Placement of Flip-Flops in Partial Scan Designs and the Placement of Signal Boosters in Lossy Circuits. VLSI Design 1993: 45-50 - 1992
- [j80]Jing-Fu Jenq, Sartaj Sahni:
Serial and Parallel Algorithms for the Medial Axis Transform. IEEE Trans. Pattern Anal. Mach. Intell. 14(12): 1218-1224 (1992) - [c44]Andrew Lim, Sartaj Sahni:
Segmented winner trees. ACM Southeast Regional Conference 1992: 157-164 - [c43]Dinesh P. Mehta, Sartaj Sahni:
Computing Display Conflicts in String and Circular String Visualization. CPM 1992: 244-261 - [c42]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the Circuit Implementation Problem. DAC 1992: 478-483 - [c41]Jing-Fu Jenq, Sartaj Sahni:
Image Shrinking and Expanding on a Pyramid. ICPP (3) 1992: 302-309 - [c40]Jing-Fu Jenq, Sartaj Sahni:
Serial and Parallel Algorithms for the Medial Axis Transform. IPPS 1992: 326-333 - [c39]Jing-Fu Jenq, Sartaj Sahni:
Histogramming on a Reconfigurable Mesh Computer. IPPS 1992: 425-432 - [c38]Dinesh P. Mehta, Sartaj Sahni:
Models and techniques for the visualization of labeled discrete objects. SAC 1992: 1224-1233 - [c37]Kyunrak Chong, Sartaj Sahni:
Minimizing Total Wire Length By Flipping Modules. VLSI Design 1992: 25-30 - 1991
- [j79]Jinwoon Woo, Sartaj Sahni:
Computing biconnected components on a hypercube. J. Supercomput. 5(1): 73-87 (1991) - [j78]Sanjay Ranka, Sartaj Sahni:
Clustering on a Hypercube Multicomputer. IEEE Trans. Parallel Distributed Syst. 2(2): 129-137 (1991) - [j77]Sanjay Ranka, Sartaj Sahni:
Efficient serial and parallel algorithms for median filtering. IEEE Trans. Signal Process. 39(6): 1462-1466 (1991) - [c36]Patrick C. McGeer, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Sartaj Sahni:
Performance Enhancement through the Generalized Bypass Transform. ICCAD 1991: 184-187 - [c35]Kyunrak Chong, Sartaj Sahni:
Flipping Modules to Minimize Maximum Wire Length. ICCD 1991: 528-531 - [c34]Jing-Fu Jenq, Sartaj Sahni:
Reconfigurable Mesh Algorithms for the Hough Transform. ICPP (3) 1991: 34-41 - [c33]Jing-Fu Jenq, Sartaj Sahni:
Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components. ICPP (3) 1991: 280-281 - [c32]Jing-Fu Jenq, Sartaj Sahni:
Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching. IPPS 1991: 208-215 - [c31]Jinwoon Woo, Sartaj Sahni:
Load Balancing on a Hypercube. IPPS 1991: 525-530 - 1990
- [j76]Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni:
Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. 2(3): 219-224 (1990) - [j75]Sanjay Ranka, Sartaj Sahni:
String Editing on an SIMD Hypercube Multicomputer. J. Parallel Distributed Comput. 9(4): 411-418 (1990) - [j74]Sanjay Ranka, Sartaj Sahni:
Image Template Matching on MIMD Hypercube Multicomputers. J. Parallel Distributed Comput. 10(1): 79-84 (1990) - [j73]Sanjay Ranka, Sartaj Sahni:
Convolution on Mesh Connected Multicomputers. IEEE Trans. Pattern Anal. Mach. Intell. 12(3): 315-318 (1990) - [j72]Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq:
A Hardware Accelerator for Maze Routing. IEEE Trans. Computers 39(1): 141-145 (1990) - [j71]San-Yuan Wu, Sartaj Sahni:
Covering rectilinear polygons by rectangles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(4): 377-388 (1990) - [j70]Wing Ning Li, Sartaj Sahni:
Pull up transistor folding. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(5): 512-521 (1990) - [j69]Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni:
Long and short covering edges in combination logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(12): 1245-1253 (1990) - [j68]Sanjay Ranka, Sartaj Sahni:
Computing Hough transforms on hypercube multicomputers. J. Supercomput. 4(2): 169-190 (1990) - [j67]Sanjay Ranka, Sartaj Sahni:
Odd Even Shifts in SIMD Hypercubes. IEEE Trans. Parallel Distributed Syst. 1(1): 77-82 (1990) - [c30]Madhusudan Nigam, Sartaj Sahni, Balaji Krishnamurthy:
Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs. ICPP (3) 1990: 340-343 - [c29]Sanjay Ranka, Sartaj Sahni:
Clustering on a hypercube multicomputer. ICPR (2) 1990: 532-536
1980 – 1989
- 1989
- [j66]Kam-Hoi Cheng, Sartaj Sahni:
A new VLSI system for adaptive recursive filtering. Parallel Comput. 10(1): 109-115 (1989) - [j65]Kam-Hoi Cheng, Sartaj Sahni:
VLSI architectures for back substitution. Parallel Comput. 12(1): 53-69 (1989) - [j64]Jayaram Bhasker, Sartaj Sahni:
Via Assignment in Single-Row Routing. IEEE Trans. Computers 38(1): 142-149 (1989) - [j63]Li-Shin Lin, Sartaj Sahni:
Fair Edge Deletion Problems. IEEE Trans. Computers 38(5): 756-761 (1989) - [j62]Wing Ning Li, Sudhakar M. Reddy, Sartaj K. Sahni:
On path selection in combinational logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(1): 56-63 (1989) - [j61]Youngju Won, Sartaj Sahni:
Hypercube-to-host sorting. J. Supercomput. 3(1): 41-61 (1989) - [j60]Jinwoon Woo, Sartaj Sahni:
Hypercube computing: Connected components. J. Supercomput. 3(3): 209-234 (1989) - [c28]Sanjay Ranka, Sartaj Sahni:
Hypercube Algorithms for Image Transformations. ICPP (3) 1989: 24-31 - [c27]Sanjay Ranka, Sartaj Sahni:
Efficient Serial and Parallel Algorithms for Median Filtering. ICPP (3) 1989: 56-62 - 1988
- [j59]Jayaram Bhasker, Sartaj Sahni:
A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. Algorithmica 3: 247-278 (1988) - [j58]Sartaj Sahni:
Special Issue on Parallel Architectures and Algorithms. J. Parallel Distributed Comput. 5(4): 331-333 (1988) - [j57]Jong Lee, Eugene Shragowitz, Sartaj Sahni:
A Hypercube Algorithm for the 0/1 Knapsack Problem. J. Parallel Distributed Comput. 5(4): 438-456 (1988) - [j56]Sanjay Ranka, Youngju Won, Sartaj Sahni:
Programming a Hypercube Multicomputer. IEEE Softw. 5(5): 69-77 (1988) - [j55]Li-Shin Lin, Sartaj Sahni:
Maximum Alignment of Interchageable Terminals. IEEE Trans. Computers 37(10): 1166-1177 (1988) - [j54]Sartaj K. Sahni, San-Yuan Wu:
Two NP-hard interchangeable terminal problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(4): 467-472 (1988) - [j53]Surendra Nahar, Sartaj K. Sahni:
Fast algorithm for polygon decomposition. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(4): 473-483 (1988) - [j52]Youngju Won, Sartaj Sahni:
Maze routing on a hypercube multicomputer. J. Supercomput. 2(1): 55-79 (1988) - [j51]Youngju Won, Sartaj Sahni:
A balanced bin sort for hypercube multicomputers. J. Supercomput. 2(4): 435-448 (1988) - [c26]Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni:
On Path Selection in Combinational Logic Circuits. DAC 1988: 142-147 - 1987
- [j50]Jayaram Bhasker, Sartaj Sahni:
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17(3): 307-317 (1987) - [j49]Kam-Hoi Cheng, Sartaj Sahni:
VLSI systems for band matrix multiplication. Parallel Comput. 4(3): 239-258 (1987) - [j48]Rajiv Kane, Sartaj K. Sahni:
A Systolic Design-Rule Checker. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(1): 22-32 (1987) - [j47]Sangyong Han, Sartaj K. Sahni:
Layering Algorithms For Single-Row Routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(1): 95-102 (1987) - [c25]Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq:
A Hardware Accelerator for Maze Routing. DAC 1987: 800-806 - [c24]Youngju Won, Sartaj Sahni:
Maze Routing on a Hypercube Multiprocessor Computer. ICPP 1987: 630-637 - [c23]Jong Lee, Sartaj Sahni, Eugene Shragowitz:
A Hypecube Algorithm for the 0/1 Knapsack Problem. ICPP 1987: 699-706 - [c22]Jing-Fu Jenq, Sartaj Sahni:
All Pairs Shortest Paths on a Hypercube Multiprocessor. ICPP 1987: 713-716 - 1986
- [j46]Raghunath Raghavan, James Cohoon, Sartaj Sahni:
Single Bend Wiring. J. Algorithms 7(2): 232-257 (1986) - [j45]Kam Cheng, Sartaj K. Sahni:
VLSI Architectures for the Finite Impulse Response Filter. IEEE J. Sel. Areas Commun. 4(1): 92-99 (1986) - [c21]Jayaram Bhasker, Sartaj Sahni:
A linear algorithm to find a rectangular dual of a planar triangulated graph. DAC 1986: 108-114 - [c20]Surendra Nahar, Sartaj Sahni, Eugene Shragowitz:
Simulated annealing and combinatorial optimization. DAC 1986: 293-299 - [c19]Surendra Nahar, Sartaj Sahni:
A time and space efficient net extractor. DAC 1986: 411-417 - [c18]Sartaj Sahni:
NTU Computer Science Program. FJCC 1986: 11-13 - [c17]Jayaram Bhasker, Sartaj Sahni:
Via Assignment in Single Row Routing. FSTTCS 1986: 154-176 - [c16]Kam-Hoi Cheng, Sartaj Sahni:
A New VLSI System for Adaptive Recursive Filtering. ICPP 1986: 387-389 - [c15]Kam-Hoi Cheng, Sartaj Sahni:
VLSI Artchitectures for Back Substitution. IFIP Congress 1986: 373-378 - 1985
- [c14]Sangyong Han, Sartaj Sahni:
Layering algorithms for single row routing. DAC 1985: 516-522 - [c13]Surendra Nahar, Sartaj Sahni, Eugene Shragowitz:
Experiments with simulated annealing. DAC 1985: 748-752 - [c12]Kam-Hoi Cheng, Sartaj Sahni:
VLSI Systems For Matrix Multiplication. FSTTCS 1985: 428-456 - 1984
- [j44]Ten-Hwang Lai, Sartaj Sahni:
Anomalies in Parallel Branch-and-Bound Algorithms. Commun. ACM 27(6): 594-602 (1984) - [j43]Eliezer Dekel, Sartaj Sahni:
A parallel matching algorithm for convex bipartite graphs and applications to scheduling. J. Parallel Distributed Comput. 1(2): 185-205 (1984) - [j42]Ten-Hwang Lai, Sartaj Sahni:
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness. SIAM J. Comput. 13(4): 690-704 (1984) - [j41]Sartaj Sahni:
Scheduling Multipipeline and Multiprocessor Computers. IEEE Trans. Computers 33(7): 637-645 (1984) - [j40]Sangyong Han, Sartaj Sahni:
Single-Row Routing in Narrow Streets. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3(3): 235-241 (1984) - [c11]Rajiv Kane, Sartaj Sahni:
A systolic design rule checker. DAC 1984: 243-250 - [c10]Rajiv Kane, Sartaj Sahni:
VLSI Systems For Design Rule Checks. FSTTCS 1984: 259-278 - 1983
- [j39]Eliezer Dekel, Sartaj Sahni:
Parallel Scheduling Algorithms. Oper. Res. 31(1): 24-49 (1983) - [j38]Ten-Hwang Lai, Sartaj Sahni:
Nearly On-Line Scheduling of Multiprocessor Systems with Memories. J. Algorithms 4(4): 353-362 (1983) - [j37]Raghunath Raghavan, Sartaj Sahni:
Single Row Routing. IEEE Trans. Computers 32(3): 209-220 (1983) - [j36]Eliezer Dekel, Sartaj Sahni:
Binary Trees and Parallel Scheduling Algorithms. IEEE Trans. Computers 32(3): 307-315 (1983) - [j35]Eliezer Dekel, Sartaj Sahni:
Parallel Generation of Postfix and Tree Forms. ACM Trans. Program. Lang. Syst. 5(3): 300-317 (1983) - [c9]James Cohoon, Sartaj Sahni:
Heuristics for the Circuit Realization Problem. DAC 1983: 560-566 - [c8]Ten-Hwang Lai, Sartaj Sahni:
Anomalies in Parallel Branch-and-Bound Algorithms. ICPP 1983: 183-190 - 1982
- [j34]David Nassimi, Sartaj Sahni:
Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM 29(3): 642-667 (1982) - [j33]David Nassimi, Sartaj Sahni:
Parallel Algorithms to Set Up the Benes Permutation Network. IEEE Trans. Computers 31(2): 148-154 (1982) - [j32]David Nassimi, Sartaj Sahni:
Optimal BPC Permutations on a Cube Connected SIMD Computer. IEEE Trans. Computers 31(4): 338-341 (1982) - [c7]Raghunath Raghavan, Sartaj Sahni:
Optimal single row router. DAC 1982: 38-45 - [c6]Eliezer Dekel, Sartaj Sahni:
Parallel generation of the postfix form. ICPP 1982: 171-177 - [c5]Eliezer Dekel, Sartaj Sahni:
A parallel matching algorithm for convex bipartite graphs. ICPP 1982: 178-184 - 1981
- [b3]Ellis Horowitz, Sartaj Sahni:
Algorithmen - Entwurf und Analyse. Springer 1981, ISBN 978-3-540-10743-9, pp. I-XIV, 1-770 - [j31]Yookun Cho, Sartaj Sahni:
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops. Oper. Res. 29(3): 511-522 (1981) - [j30]Eliezer Dekel, David Nassimi, Sartaj Sahni:
Parallel Matrix and Graph Algorithms. SIAM J. Comput. 10(4): 657-675 (1981) - [j29]David Nassimi, Sartaj Sahni:
Data Broadcasting in SIMD Computers. IEEE Trans. Computers 30(2): 101-107 (1981) - [j28]David Nassimi, Sartaj Sahni:
A Self-Routing Benes Network and Parallel Permutation Algorithms. IEEE Trans. Computers 30(5): 332-340 (1981) - [c4]Eliezer Dekel, Sartaj Sahni:
Binary trees and parallel scheduling algorithms. CONPAR 1981: 480-492 - 1980
- [j27]David Nassimi, Sartaj Sahni:
An optimal routing algorithm for mesh-connected Parallel computers. J. ACM 27(1): 6-29 (1980) - [j26]Sartaj Sahni, Yookun Cho:
Scheduling Independent Tasks with Due Times on a Uniform Processor System. J. ACM 27(3): 550-563 (1980) - [j25]Yookun Cho, Sartaj Sahni:
Bounds for List Schedules on Uniform Processors. SIAM J. Comput. 9(1): 91-103 (1980) - [j24]Harry B. Hunt III, Robert L. Constable, Sartaj Sahni:
On the Computational Complexity of Program Scheme Equivalence. SIAM J. Comput. 9(2): 396-416 (1980) - [j23]David Nassimi, Sartaj Sahni:
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. SIAM J. Comput. 9(4): 744-757 (1980) - [c3]Sartaj Sahni, Atul Bhatt:
The complexity of design automation problems. DAC 1980: 402-411
1970 – 1979
- 1979
- [j22]Sartaj Sahni:
Preemptive Scheduling with Due Dates. Oper. Res. 27(5): 925-934 (1979) - [j21]Sartaj Sahni, Yookun Cho:
Complexity of Scheduling Shops with No Wait in Process. Math. Oper. Res. 4(4): 448-457 (1979) - [j20]Sartaj Sahni, Yookun Cho:
Nearly On Line Scheduling of a Uniform Processor System with Release Times. SIAM J. Comput. 8(2): 275-285 (1979) - [j19]David Nassimi, Sartaj Sahni:
Bitonic Sort on a Mesh-Connected Parallel Computer. IEEE Trans. Computers 28(1): 2-7 (1979) - 1978
- [b2]Ellis Horowitz, Sartaj Sahni:
Fundamentals of Computer Algorithms. Computer Science Press 1978 - [j18]Teofilo F. Gonzalez, Sartaj Sahni:
Flowshop and Jobshop Schedules: Complexity and Approximation. Oper. Res. 26(1): 36-52 (1978) - [j17]Sartaj Sahni, Ellis Horowitz:
Combinatorial Problems: Reductibility and Approximation. Oper. Res. 26(5): 718-759 (1978) - [j16]Teofilo F. Gonzalez, Sartaj Sahni:
Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978) - 1977
- [j15]Sartaj Sahni:
General Techniques for Combinatorial Approximation. Oper. Res. 25(6): 920-936 (1977) - [j14]Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni:
Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977) - [j13]Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta:
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. ACM Trans. Math. Softw. 3(1): 60-64 (1977) - 1976
- [j12]Sartaj Sahni:
Algorithms for Scheduling Independent Tasks. J. ACM 23(1): 116-127 (1976) - [j11]Ellis Horowitz, Sartaj Sahni:
Exact and Approximate Algorithms for Scheduling Nonidentical Processors. J. ACM 23(2): 317-327 (1976) - [j10]Sartaj Sahni, Teofilo F. Gonzalez:
P-Complete Approximation Problems. J. ACM 23(3): 555-565 (1976) - [j9]Teofilo F. Gonzalez, Sartaj Sahni:
Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976) - [j8]Oscar H. Ibarra, Sartaj Sahni, Chul E. Kim:
Finite Automata with Multiplication. Theor. Comput. Sci. 2(3): 271-294 (1976) - 1975
- [j7]Ellis Horowitz, Sartaj Sahni:
On Computing the Exact Determinant of Matrices with Polynomial Entries. J. ACM 22(1): 38-50 (1975) - [j6]Sartaj Sahni:
Approximate Algorithms for the 0/1 Knapsack Problem. J. ACM 22(1): 115-124 (1975) - [j5]Oscar H. Ibarra, Sartaj Sahni:
Hierarchies of Turing Machines with Restricted Tape Alphabet Size. J. Comput. Syst. Sci. 11(1): 56-67 (1975) - [j4]Ellis Horowitz, Sartaj Sahni:
The Computation of Powers of Symbolic Polynomials. SIAM J. Comput. 4(2): 201-208 (1975) - [j3]Oscar H. Ibarra, Sartaj Sahni:
Polynomially Complete Fault Detection Problems. IEEE Trans. Computers 24(3): 242-249 (1975) - 1974
- [j2]Ellis Horowitz, Sartaj Sahni:
Computing Partitions with Applications to the Knapsack Problem. J. ACM 21(2): 277-292 (1974) - [j1]Sartaj Sahni:
Computationally Related Problems. SIAM J. Comput. 3(4): 262-279 (1974) - [c2]Sartaj Sahni, Teofilo F. Gonzalez:
P-Complete Problems and Approximate Solutions. SWAT 1974: 28-32 - 1973
- [b1]Sartaj Sahni:
On The Knapsack And Other Computationally Related Problems. Cornell University, USA, 1973 - 1972
- [c1]Sartaj Sahni:
Some Related Problems from Network Flows, Game Theory and Integer Programming. SWAT 1972: 130-138
Coauthor Index
[j197] [c161] [j189] [c158] [c155] [j186] [c154] [c153] [c151] [c144] [j176] [j175] [c138] [c135] [c133] [j166] [c130] [c128] [c125] [c123] [c119] [c118] [c117] [j165] [c115] [c114] [c107] [c106] [c104] [c103] [c95] [c92] [c90] [c65] [c63] [j78] [j77] [j75] [j74] [j73] [j68] [j67] [c29] [c28] [c27] [j56]
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-06-03 01:03 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:
