Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sartaj Sahni
Sartaj K. Sahni
2010 – today
- 2013
[j153]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)- 2012
- [j152]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa: Sheng Yu. Int. J. Found. Comput. Sci. 23(2) (2012)
- [j151]Tania Mishra, Sartaj Sahni: PETCAM - A Power Efficient TCAM Architecture for Forwarding Tables. IEEE Trans. Computers 61(1): 3-17 (2012)
- [j150]Tania Banerjee-Mishra, Sartaj Sahni: Consistent Updates for Packet Classifiers. IEEE Trans. Computers 61(9): 1284-1295 (2012)
- [j149]Yan Li, Sanjay Ranka, Sartaj Sahni: In-advance path reservation for file transfers in e-science applications. The Journal of Supercomputing 59(3): 1167-1187 (2012)
- [c125]
- [c124]Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran: PMS6: A fast algorithm for motif discovery. ICCABS 2012: 1-6
- [c123]Junjie Li, Sanjay Ranka, Sartaj Sahni: Pairwise sequence alignment for very long sequences on GPUs. ICCABS 2012: 1-6
- [c122]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
- [c121]Tania Banerjee-Mishra, Sartaj Sahni, Gunasekaran S. Seetharaman: PC-TRIO: An indexed TCAM architecture for packet classifiers. ISCC 2012: 325-330
- 2011
- [c120]Shibdas Bandyopadhyay, Sartaj Sahni: Sorting Large Multifield Records on a GPU. ICPADS 2011: 149-156
- [c119]Junjie Li, Sanjay Ranka, Sartaj Sahni: Strassen's Matrix Multiplication on GPUs. ICPADS 2011: 157-164
- [c118]Xinyan Zha, Daniele Paolo Scarpazza, Sartaj Sahni: Highly compressed multi-pattern string matching on the cell broadband engine. ISCC 2011: 257-264
- [c117]Tania Mishra, Sartaj Sahni, Gunasekaran S. Seetharaman: PC-DUOS: Fast TCAM lookup and update for packet classifiers. ISCC 2011: 265-270
- [c116]
- [c115]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni: Workflow scheduling in e-Science networks. ISCC 2011: 432-437
- [c114]Yan Li, Sanjay Ranka, Sartaj Sahni: Wavelength scheduling in Time-domain Wavelength Interleaved Networks. ISCC 2011: 519-524
- [c113]William Chapman, Sanjay Ranka, Sartaj Sahni, Mark 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
- [c112]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph 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 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
- [e6]Sumeet Dua, Sartaj Sahni, D. P. Goyal (Eds.): 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
- 2010
- [j148]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni: Topology Aggregation for e-Science Networks. IJNGC 1(1) (2010)
- [j147]Wencheng Lu, Sartaj Sahni: Recursively Partitioned Static IP Router Tables. IEEE Trans. Computers 59(12): 1683-1690 (2010)
- [j146]Xiaochun Xu, Nageswara S. V. Rao, Sartaj Sahni: A computational geometry method for localization using differences of distances. TOSN 6(2) (2010)
- [c111]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni: Bandwidth Allocation for Iterative Data-Dependent E-science Applications. CCGRID 2010: 233-242
- [c110]Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni: Topology Aggregation for E-science Networks. CCGRID 2010: 530-533
- [c109]Xinyan Zha, Sartaj Sahni: Fast in-Place File Carving for Digital Forensics. e-Forensics 2010: 141-158
- [c108]
- [c107]Sartaj Sahni: Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture. ICDCN 2010: 3
- [c106]Tania Mishra, Sartaj Sahni: DUOS - Simple dual TCAM architecture for routing tables with incremental update. ISCC 2010: 503-508
- [c105]
- [c104]Shibdas Bandyopadhyay, Sartaj Sahni: Sorting large records on a cell broadband engine. ISCC 2010: 939-944
- [c103]William Chapman, Sanjay Ranka, Sartaj Sahni, Mark Schmalz, Uttam K. Majumder: Parallel processing techniques for the processing of synthetic aperture radar data on FPGAs. ISSPIT 2010: 17-22
- [c102]Yan Li, Sanjay Ranka, Sartaj Sahni: First-Slot scheduling with wavelength conversion for distributed file transfers. ISSPIT 2010: 42-47
- [e5]My T. Thai, Sartaj Sahni (Eds.): 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
- [e4]Sushil K. Prasad, Harrick M. Vin, Sartaj Sahni, Mahadeo Jaiswal, Bundit Thipakorn (Eds.): 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
2000 – 2009
- 2009
- [j145]Joongseok Park, Sartaj Sahni: Power Assignment for Symmetric Communication in Wireless Sensor Networks. IJDSN 5(2): 185-200 (2009)
- [j144]Wencheng Lu, Sartaj Sahni: Efficient 2D Multibit Tries for Packet Classification. IEEE Trans. Computers 58(12): 1695-1709 (2009)
- [j143]Wencheng Lu, Sartaj Sahni: Succinct representation of static packet classifiers. IEEE/ACM Trans. Netw. 17(3): 803-816 (2009)
- [c101]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
- [c100]Yan Li, Sanjay Ranka, Sartaj Sahni, Mark Schmalz: Network Centered Multiple Resource Scheduling in e-Science Applications. GridNets 2009: 37-44
- [c99]Yan Li, Sanjay Ranka, Sartaj Sahni: In-advance path reservation for file transfers In e-Science applications. ISCC 2009: 176-181
- [c98]
- [c97]
- [c96]Sartaj Sahni: Data Structures and Algorithms for Packet Forwarding and Classification. ISPAN 2009: 3
- [e3]Sushil K. Prasad, Susmi Routray, Reema Khurana, Sartaj Sahni (Eds.): 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
- 2008
- [j142]Wencheng Lu, Sartaj Sahni: Packet Classification Using Space-Efficient Pipelined Multibit Tries. IEEE Trans. Computers 57(5): 591-605 (2008)
- [j141]Shigang Chen, Meongchul Song, Sartaj Sahni: Two techniques for fast computation of constrained shortest paths. IEEE/ACM Trans. Netw. 16(1): 105-115 (2008)
- [c95]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
- [c94]Xiaochun Xu, Sartaj Sahni, Nageswara S. V. Rao: On basic properties of localization using distance-difference measurements. FUSION 2008: 1-8
- [c93]Xiaochun Xu, Sartaj Sahni, Nageswara S. V. Rao: Minimum-cost sensor coverage of planar regions. FUSION 2008: 1-8
- [c92]
- [c91]Eun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni: Performance evaluation of routing and wavelength assignment algorithms for optical networks. ISCC 2008: 62-67
- [c90]Xinyan Zha, Sartaj Sahni: Highly compressed Aho-Corasick automata for efficient intrusion detection. ISCC 2008: 298-303
- [c89]
- [c88]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
- [j140]Kun Suk Kim, Sartaj Sahni: Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE Trans. Computers 56(1): 32-43 (2007)
- [j139]Xiaochun Xu, Sartaj Sahni: Approximation Algorithms for Sensor Deployment. IEEE Trans. Computers 56(12): 1681-1695 (2007)
- [j138]Haibin Lu, Sartaj Sahni: O(logW) multidimensional packet classification. IEEE/ACM Trans. Netw. 15(2): 462-472 (2007)
- [c87]Nageswara S. V. Rao, Xiaochun Xu, Sartaj Sahni: A computational geometry method for DTOA triangulation. FUSION 2007: 1-7
- [c86]Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath: Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks. ICN 2007: 47
- [c85]
- [c84]
- [c83]
- [c82]Wencheng Lu, Sartaj Sahni: Succinct Representation Of Static Packet Classifiers. ISCC 2007: 1119-1124
- 2006
- [j137]Meongchul Song, Sartaj Sahni: Approximation Algorithms for Multiconstrained Quality-of-Service Routing. IEEE Trans. Computers 55(5): 603-617 (2006)
- [j136]Joongseok Park, Sartaj Sahni: An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks. IEEE Trans. Computers 55(8): 1048-1056 (2006)
- [c81]Joongseok Park, Sartaj Sahni: Power Assignment For Symmetric Communication InWireless Sensor Networks. ISCC 2006: 591-596
- [c80]
- [c79]Wencheng Lu, Sartaj Sahni: Packet Classification Using Pipelined Two-Dimensional Multibit Tries. ISCC 2006: 808-813
- [e2]Sartaj Sahni (Ed.): 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
- 2005
- [j135]
- [j134]Haibin Lu, Kun Suk Kim, Sartaj K. Sahni: Prefix and Interval-Partitioned Dynamic IP Router-Tables. IEEE Trans. Computers 54(5): 545-557 (2005)
- [j133]Haibin Lu, Sartaj Sahni: A B-Tree Dynamic Router-Table Design. IEEE Trans. Computers 54(7): 813-824 (2005)
- [j132]Joongseok Park, Sartaj Sahni: Maximum Lifetime Broadcasting in Wireless Networks. IEEE Trans. Computers 54(9): 1081-1090 (2005)
- [j131]Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao: Packet classification consuming small amount of memory. IEEE/ACM Trans. Netw. 13(5): 1135-1145 (2005)
- [j130]Haibin Lu, Sartaj Sahni: Conflict detection and resolution in two-dimensional prefix router tables. IEEE/ACM Trans. Netw. 13(6): 1353-1363 (2005)
- [c78]Wencheng Lu, Sartaj Sahni: Packet Classification Using Two-Dimensional Multibit Tries. ISCC 2005: 849-854
- [c77]
- 2004
- [j129]Sartaj Sahni, Kun Suk Kim: Efficient Dynamic Lookup For Bursty Access Patterns. Int. J. Found. Comput. Sci. 15(4): 567-591 (2004)
- [j128]Sartaj Sahni, Kun Suk Kim: An O(log n) Dynamic Router-Table Design. IEEE Trans. Computers 53(3): 351-363 (2004)
- [j127]Haibin Lu, Sartaj Sahni: O(log n) Dynamic Router-Tables for Prefixes and Ranges. IEEE Trans. Computers 53(10): 1217-1230 (2004)
- [j126]Haibin Lu, Sartaj Sahni: Enhanced Interval Trees for Dynamic IP Router-Tables. IEEE Trans. Computers 53(12): 1615-1628 (2004)
- [c76]Shigang Chen, Meongchul Song, Sartaj Sahni: Two techniques for fast computation of constrained shortest paths. GLOBECOM 2004: 1348-1352
- [c75]Haibin Lu, Kun Suk Kim, Sartaj Sahni: Prefix- and interval-partitioned router-tables [IP routing]. GLOBECOM 2004: 1590-1594
- [c74]Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao: Fast Update Algorithm for IP Forwarding Table Using Independent Sets. HSNMC 2004: 324-335
- [c73]
- [c72]
- 2003
- [j125]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)
- [j124]Haejae Jung, Sartaj Sahni: Supernode Binary Search Trees. Int. J. Found. Comput. Sci. 14(3): 465-490 (2003)
- [j123]Anuj Jain, Sartaj Sahni, Jatinder Palta, James Dempsey: Partitioning 3d Phantoms Into Homogeneous Cuboids. Int. J. Found. Comput. Sci. 14(5): 905-932 (2003)
- [j122]Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya: A blocked all-pairs shortest-paths algorithm. ACM Journal of Experimental Algorithmics 8 (2003)
- [j121]Sartaj Sahni, Kun Suk Kim: Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4): 650-662 (2003)
- [c71]
- [c70]
- 2002
- [j120]Edward Y. C. Cheng, Sartaj Sahni: Gate Resizing to Reduce Power Consumption. Int. J. Found. Comput. Sci. 13(3): 405-429 (2002)
- [j119]Kun Suk Kim, Sartaj Sahni: IP Lookup by Binary Search on Prefix Length. Journal of Interconnection Networks 3(3-4): 105-128 (2002)
- [c69]Sartaj Sahni: Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. COCOON 2002: 2
- [c68]Chih-Fang Wang, Sartaj Sahni: Computational Geometry On The OTIS-Mesh Optoelectronic Computer. ICPP 2002: 501-
- [c67]
- [c66]Sartaj Sahni, Kun Suk Kim, Haibin Lu: Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. ISPAN 2002: 3-
- [c65]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 (Eds.): 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
- 2001
- [j118]Sartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. Int. J. Found. Comput. Sci. 12(3): 249-264 (2001)
- [j117]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)
- [j116]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)
- [j115]Chih-Fang Wang, Sartaj Sahni: Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Computers 50(7): 635-646 (2001)
- [c64]Sartaj Sahni, Kun Suk Kim: Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. FTDCS 2001: 178-184
- [c63]Sartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. IPDPS 2001: 136
- 2000
- [j114]Sanguthevar Rajasekaran, Sartaj Sahni: Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000)
- [j113]Seonghun Cho, Sartaj Sahni: A New Weight Balanced Binary Search Tree. Int. J. Found. Comput. Sci. 11(3): 485-513 (2000)
- [j112]Kyunrak Chong, Sartaj Sahni: Correspondence-Based Data Structures for Double-Ended Priority Queues. ACM Journal of Experimental Algorithmics 5: 2 (2000)
- [j111]Chih-Fang Wang, Sartaj Sahni: Image Processing on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distrib. Syst. 11(2): 97-109 (2000)
- [j110]Sartaj Sahni: Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network. IEEE Trans. Parallel Distrib. Syst. 11(7): 720-728 (2000)
- [j109]Sartaj Sahni: The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations. IEEE Trans. Parallel Distrib. Syst. 11(7): 739-748 (2000)
- [c62]Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka: Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426
- [c61]Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya: A Blocked All-Pairs Shortest-Path Algorithm. SWAT 2000: 419-432
1990 – 1999
- 1999
- [j108]Seonghun Cho, Sartaj Sahni: Mergeable Double-Ended Priority Queues. Int. J. Found. Comput. Sci. 10(1): 1-18 (1999)
- [c60]Jang-uk In, Canming Jin, Jih-Kwon Peir, Sanjay Ranka, Sartaj Sahni: A Framework for Matching Applications with Parallel Machines. HiPC 1999: 331-338
- [c59]Sartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. ISPAN 1999: 2-9
- [c58]Sartaj Sahni, Baba C. Vemuri, F. Chen, C. Kapoor: Variable-Bit-Lengthn Coding: An Effective Coding Method. VISUAL 1999: 665-672
- [c57]F. Chen, Sartaj Sahni, Baba C. Vemuri: Efficient Algorithms for Lossless Compression of 2D/3D Images. VISUAL 1999: 681-688
- 1998
- [j107]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)
- [j106]Sartaj Sahni, Chih-Fang Wang: BPC Permutations on the OTIS-Hypercube Optoelectronic Computer. Informatica (Slovenia) 22(3) (1998)
- [j105]Seonghun Cho, Sartaj Sahni: Weight-Biased Leftist Trees and Modified Skip Lists. ACM Journal of Experimental Algorithmics 3: 2 (1998)
- [j104]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 Analysis 2(1): 79-98 (1998)
- [j103]Sanguthevar Rajasekaran, Sartaj Sahni: Randomized Routing, Selection, and Sorting on the OTIS-Mesh. IEEE Trans. Parallel Distrib. Syst. 9(9): 833-840 (1998)
- [j102]Chih-Fang Wang, Sartaj Sahni: Basic Operations on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distrib. Syst. 9(12): 1226-1236 (1998)
- 1997
- [j101]Dinesh P. Mehta, Sartaj K. Sahni: Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects. Journal of Systems and Software 39(3): 201-221 (1997)
- [j100]Sanguthevar Rajasekaran, Sartaj Sahni: Determinisitic Routing on the Array with Reconfigurable Optical Buses. Parallel Processing Letters 7(3): 219-224 (1997)
- [j99]Andrew Lim, Venkat Thanvantri, Sartaj Sahni: Planar topological routing. IEEE Trans. on CAD of Integrated Circuits and Systems 16(6): 651-656 (1997)
- [j98]Ju-wook Jang, Madhusudan Nigam, Viktor K. Prasanna, Sartaj Sahni: Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh. IEEE Trans. Parallel Distrib. Syst. 8(1): 1-12 (1997)
- [j97]Sanguthevar Rajasekaran, Sartaj Sahni: Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. IEEE Trans. Parallel Distrib. Syst. 8(11): 1123-1132 (1997)
- [c56]
- [c55]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
- [j96]Allan Gottlieb, Kai Hwang, Sartaj Sahni: Editorial Announcement. J. Parallel Distrib. Comput. 35(1): 1 (1996)
- [j95]Sartaj Sahni: Scheduling Master-Slave Multiprocessor Systems. IEEE Trans. Computers 45(10): 1195-1199 (1996)
- [j94]Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni: Efficient net extraction for restricted orientation designs [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 15(9): 1151-1159 (1996)
- [j93]Venkat Thanvantri, Sartaj Sahni: Optimal folding of standard and custom cells. ACM Trans. Design Autom. Electr. Syst. 1(1): 123-143 (1996)
- [c54]Seonghun Cho, Sartaj Sahni: Weight Biased Leftist Trees and Modified Skip Lists. COCOON 1996: 361-370
- 1995
- [j92]Allan Gottlieb, Kai Hwang, Sartaj Sahni: Editorial Message. J. Parallel Distrib. Comput. 31(2): 99-100 (1995)
- [j91]
- [j90]Sartaj Sahni: Data Manipulation on the Distributed Memory Bus Computer. Parallel Processing Letters 5: 3-14 (1995)
- [j89]Venkat Thanvantri, Sartaj Sahni: Folding a stack of equal width components. IEEE Trans. on CAD of Integrated Circuits and Systems 14(6): 775-780 (1995)
- [j88]Seonghun Cho, Sartaj Sahni: Minimum area joining of compacted cells. IEEE Trans. on CAD of Integrated Circuits and Systems 14(7): 903-909 (1995)
- [j87]Madhusudan Nigam, Sartaj Sahni: Sorting n2 Numbers on n×n Meshes. IEEE Trans. Parallel Distrib. Syst. 6(12): 1221-1225 (1995)
- [c53]
- [c52]Sanguthevar Rajasekaran, Sartaj Sahni: Sorting and Selection on Distributed Memory Bus Computers. ICPP (3) 1995: 151-154
- [c51]Sartaj Sahni: The DMBC: Architecture and Fundamental Operations. International Conference on Supercomputing 1995: 60-66
- [c50]Andrew Lim, Sartaj K. Sahni, Venkat Thanvantri: A fast algorithm to test planar topological routability. VLSI Design 1995: 8-12
- 1994
- [b4]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
- [j86]Andrew Lim, Sartaj Sahni: Segmented Winner Trees. Elektronische Informationsverarbeitung und Kybernetik 30(1): 29-43 (1994)
- [j85]Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Hough Transform. J. Parallel Distrib. Comput. 20(1): 69-77 (1994)
- [j84]Madhusudan Nigam, Sartaj Sahni: Sorting n Numbers on n x n Reconfigurable Meshes with Buses. J. Parallel Distrib. Comput. 23(1): 37-48 (1994)
- [j83]Dinesh P. Mehta, Sartaj Sahni: Computing Display Conflicts in String Visualization. IEEE Trans. Computers 43(3): 350-361 (1994)
- [j82]Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni: Deleting Vertices to Bound Path Length. IEEE Trans. Computers 43(9): 1091-1096 (1994)
- [c49]
- [c48]Madhusudan Nigam, Sartaj Sahni: Triangulation on a Reconfigurable Mesh With Buses. ICPP (3) 1994: 251-257
- [c47]
- [c46]Keumog Ahn, Sartaj Sahni: Flipping Modules to Improve Circuit Performance and Routability. VLSI Design 1994: 127-132
- 1993
- [b3]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
- [j81]Jing-Fu Jenq, Sartaj Sahni: Histogramming on a Reconfigurable Mesh Computer. Parallel Algorithms Appl. 1(3): 179-190 (1993)
- [j80]Andrew Lim, Siu-Wing Cheng, Sartaj Sahni: Optimal Joining of Compacted Cells. IEEE Trans. Computers 42(5): 597-607 (1993)
- [j79]Dinesh P. Mehta, Sartaj Sahni: A Data Structure for Circular String Analysis and Visualization. IEEE Trans. Computers 42(8): 992-997 (1993)
- [j78]Keumog Ahn, Sartaj Sahni: NP-Hard Module Rotation Problems. IEEE Trans. Computers 42(12): 1506-1510 (1993)
- [j77]Kyunrak Chong, Sartaj Sahni: Minimizing total wire length by flipping modules. IEEE Trans. on CAD of Integrated Circuits and Systems 12(1): 167-175 (1993)
- [j76]Keumog Ahn, Sartaj Sahni: Constrained via minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 12(2): 273-282 (1993)
- [j75]Kyunrak Chong, Sartaj Sahni: Optimal realizations of floorplans [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 12(6): 793-801 (1993)
- [j74]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni: On the circuit implementation problem. IEEE Trans. on CAD of Integrated Circuits and Systems 12(8): 1147-1156 (1993)
- [j73]Doowon Paik, Sartaj Sahni: Optimal folding of bit sliced stacks. IEEE Trans. on CAD of Integrated Circuits and Systems 12(11): 1679-1685 (1993)
- [j72]Jing-Fu Fu Jenq, Sartaj Sahni: Image Shrinking and Expanding on a Pyramid. IEEE Trans. Parallel Distrib. Syst. 4(11): 1291-1296 (1993)
- [c45]Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni: A fast algorithm for VLSI net extraction. ICCAD 1993: 770-774
- [c44]
- [c43]Madhusudan Nigam, Sartaj Sahni: Sorting n Numbers on n x n Reconfigurable Meshes with Buses. IPPS 1993: 174-181
- [c42]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
- [j71]Jing-Fu Fu Jenq, Sartaj Sahni: Serial and Parallel Algorithms for the Medial Axis Transform. IEEE Trans. Pattern Anal. Mach. Intell. 14(12): 1218-1224 (1992)
- [c41]
- [c40]Dinesh P. Mehta, Sartaj Sahni: Computing Display Conflicts in String and Circular String Visualization. CPM 1992: 244-261
- [c39]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni: On the Circuit Implementation Problem. DAC 1992: 478-483
- [c38]
- [c37]Jing-Fu Fu Jenq, Sartaj Sahni: Serial and Parallel Algorithms for the Medial Axis Transform. IPPS 1992: 326-333
- [c36]
- 1991
- [j70]Jinwoon Woo, Sartaj Sahni: Computing biconnected components on a hypercube. The Journal of Supercomputing 5(1): 73-87 (1991)
- [j69]Sanjay Ranka, Sartaj Sahni: Clustering on a Hypercube Multicomputer. IEEE Trans. Parallel Distrib. Syst. 2(2): 129-137 (1991)
- [j68]Sanjay Ranka, Sartaj Sahni: Efficient serial and parallel algorithms for median filtering. IEEE Transactions on Signal Processing 39(6): 1462-1466 (1991)
- [c35]Patrick C. McGeer, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Sartaj Sahni: Performance Enhancement through the Generalized Bypass Transform. ICCAD 1991: 184-187
- [c34]
- [c33]Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Hough Transform. ICPP (3) 1991: 34-41
- [c32]Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components. ICPP (3) 1991: 280-281
- [c31]Jing-Fu Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching. IPPS 1991: 208-215
- [c30]
- 1990
- [j67]Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni: Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS Journal on Computing 2(3): 219-224 (1990)
- [j66]Sanjay Ranka, Sartaj Sahni: String Editing on an SIMD Hypercube Multicomputer. J. Parallel Distrib. Comput. 9(4): 411-418 (1990)
- [j65]Sanjay Ranka, Sartaj Sahni: Image Template Matching on MIMD Hypercube Multicomputers. J. Parallel Distrib. Comput. 10(1): 79-84 (1990)
- [j64]Sanjay Ranka, Sartaj Sahni: Convolution on Mesh Connected Multicomputers. IEEE Trans. Pattern Anal. Mach. Intell. 12(3): 315-318 (1990)
- [j63]Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq: A Hardware Accelerator for Maze Routing. IEEE Trans. Computers 39(1): 141-145 (1990)
- [j62]San-Yuan Wu, Sartaj Sahni: Covering rectilinear polygons by rectangles. IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 377-388 (1990)
- [j61]Wing Ning Li, Sartaj Sahni: Pull up transistor folding. IEEE Trans. on CAD of Integrated Circuits and Systems 9(5): 512-521 (1990)
- [j60]Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni: Long and short covering edges in combination logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 9(12): 1245-1253 (1990)
- [j59]Sanjay Ranka, Sartaj Sahni: Computing Hough transforms on hypercube multicomputers. The Journal of Supercomputing 4(2): 169-190 (1990)
- [j58]Sanjay Ranka, Sartaj Sahni: Odd Even Shifts in SIMD Hypercubes. IEEE Trans. Parallel Distrib. Syst. 1(1): 77-82 (1990)
- [c29]Madhusudan Nigam, Sartaj Sahni, Balaji Krishnamurthy: Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs. ICPP (3) 1990: 340-343
1980 – 1989
- 1989
- [j57]Kam-Hoi Cheng, Sartaj Sahni: A new VLSI system for adaptive recursive filtering. Parallel Computing 10(1): 109-115 (1989)
- [j56]Kam-Hoi Cheng, Sartaj Sahni: VLSI architectures for back substitution. Parallel Computing 12(1): 53-69 (1989)
- [j55]Jayaram Bhasker, Sartaj Sahni: Via Assignment in Single-Row Routing. IEEE Trans. Computers 38(1): 142-149 (1989)
- [j54]
- [j53]Wing Ning Li, Sudhakar M. Reddy, Sartaj K. Sahni: On path selection in combinational logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 8(1): 56-63 (1989)
- [j52]Youngju Won, Sartaj Sahni: Hypercube-to-host sorting. The Journal of Supercomputing 3(1): 41-61 (1989)
- [j51]Jinwoon Woo, Sartaj Sahni: Hypercube computing: Connected components. The Journal of Supercomputing 3(3): 209-234 (1989)
- [c28]
- [c27]Sanjay Ranka, Sartaj Sahni: Efficient Serial and Parallel Algorithms for Median Filtering. ICPP (3) 1989: 56-62
- 1988
- [j50]Jayaram Bhasker, Sartaj Sahni: A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. Algorithmica 3: 247-278 (1988)
- [j49]Sartaj Sahni: Special Issue on Parallel Architectures and Algorithms. J. Parallel Distrib. Comput. 5(4): 331-333 (1988)
- [j48]Jong Lee, Eugene Shragowitz, Sartaj Sahni: A Hypercube Algorithm for the 0/1 Knapsack Problem. J. Parallel Distrib. Comput. 5(4): 438-456 (1988)
- [j47]Sanjay Ranka, Youngju Won, Sartaj Sahni: Programming a Hypercube Multicomputer. IEEE Software 5(5): 69-77 (1988)
- [j46]Li-Shin Lin, Sartaj Sahni: Maximum Alignment of Interchageable Terminals. IEEE Trans. Computers 37(10): 1166-1177 (1988)
- [j45]Sartaj K. Sahni, San-Yuan Wu: Two NP-hard interchangeable terminal problems. IEEE Trans. on CAD of Integrated Circuits and Systems 7(4): 467-472 (1988)
- [j44]Surendra Nahar, Sartaj K. Sahni: Fast algorithm for polygon decomposition. IEEE Trans. on CAD of Integrated Circuits and Systems 7(4): 473-483 (1988)
- [j43]Youngju Won, Sartaj Sahni: Maze routing on a hypercube multicomputer. The Journal of Supercomputing 2(1): 55-79 (1988)
- [j42]Youngju Won, Sartaj Sahni: A balanced bin sort for hypercube multicomputers. The Journal of Supercomputing 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
- [j41]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)
- [j40]Kam-Hoi Cheng, Sartaj Sahni: VLSI systems for band matrix multiplication. Parallel Computing 4(3): 239-258 (1987)
- [j39]Rajiv Kane, Sartaj K. Sahni: A Systolic Design-Rule Checker. IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 22-32 (1987)
- [j38]Sangyong Han, Sartaj K. Sahni: Layering Algorithms For Single-Row Routing. IEEE Trans. on CAD of Integrated Circuits and Systems 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]
- [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
- [j37]Raghunath Raghavan, James Cohoon, Sartaj Sahni: Single Bend Wiring. J. Algorithms 7(2): 232-257 (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]
- [c18]
- [c17]
- [c16]
- [c15]
- 1985
- [c14]
- [c13]Surendra Nahar, Sartaj Sahni, Eugene Shragowitz: Experiments with simulated annealing. DAC 1985: 748-752
- [c12]
- 1984
- [j36]Ten-Hwang Lai, Sartaj Sahni: Anomalies in Parallel Branch-and-Bound Algorithms. Commun. ACM 27(6): 594-602 (1984)
- [j35]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)
- [j34]Sartaj Sahni: Scheduling Multipipeline and Multiprocessor Computers. IEEE Trans. Computers 33(7): 637-645 (1984)
- [j33]Sangyong Han, Sartaj Sahni: Single-Row Routing in Narrow Streets. IEEE Trans. on CAD of Integrated Circuits and Systems 3(3): 235-241 (1984)
- [c11]
- [c10]
- 1983
- [j32]Ten-Hwang Lai, Sartaj Sahni: Nearly On-Line Scheduling of Multiprocessor Systems with Memories. J. Algorithms 4(4): 353-362 (1983)
- [j31]
- [j30]Eliezer Dekel, Sartaj Sahni: Binary Trees and Parallel Scheduling Algorithms. IEEE Trans. Computers 32(3): 307-315 (1983)
- [j29]Eliezer Dekel, Sartaj Sahni: Parallel Generation of Postfix and Tree Forms. ACM Trans. Program. Lang. Syst. 5(3): 300-317 (1983)
- [c9]
- [c8]
- 1982
- [j28]David Nassimi, Sartaj Sahni: Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM 29(3): 642-667 (1982)
- [j27]David Nassimi, Sartaj Sahni: Parallel Algorithms to Set Up the Benes Permutation Network. IEEE Trans. Computers 31(2): 148-154 (1982)
- [j26]David Nassimi, Sartaj Sahni: Optimal BPC Permutations on a Cube Connected SIMD Computer. IEEE Trans. Computers 31(4): 338-341 (1982)
- [c7]
- [c6]
- [c5]Eliezer Dekel, Sartaj Sahni: A parallel matching algorithm for convex bipartite graphs. ICPP 1982: 178-184
- 1981
- [b2]Ellis Horowitz, Sartaj Sahni: Algorithmen - Entwurf und Analyse. Springer 1981, ISBN 978-3-540-10743-9, pp. I-XIV, 1-770
- [j25]Eliezer Dekel, David Nassimi, Sartaj Sahni: Parallel Matrix and Graph Algorithms. SIAM J. Comput. 10(4): 657-675 (1981)
- [j24]David Nassimi, Sartaj Sahni: Data Broadcasting in SIMD Computers. IEEE Trans. Computers 30(2): 101-107 (1981)
- [j23]David Nassimi, Sartaj Sahni: A Self-Routing Benes Network and Parallel Permutation Algorithms. IEEE Trans. Computers 30(5): 332-340 (1981)
- [c4]
- 1980
- [j22]David Nassimi, Sartaj Sahni: An optimal routing algorithm for mesh-connected Parallel computers. J. ACM 27(1): 6-29 (1980)
- [j21]Sartaj Sahni, Yookun Cho: Scheduling Independent Tasks with Due Times on a Uniform Processor System. J. ACM 27(3): 550-563 (1980)
- [j20]Yookun Cho, Sartaj Sahni: Bounds for List Schedules on Uniform Processors. SIAM J. Comput. 9(1): 91-103 (1980)
- [j19]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)
- [j18]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]
1970 – 1979
- 1979
- [j17]Sartaj Sahni, Yookun Cho: Nearly On Line Scheduling of a Uniform Processor System with Release Times. SIAM J. Comput. 8(2): 275-285 (1979)
- [j16]David Nassimi, Sartaj Sahni: Bitonic Sort on a Mesh-Connected Parallel Computer. IEEE Trans. Computers 28(1): 2-7 (1979)
- 1978
- [b1]
- [j15]Teofilo F. Gonzalez, Sartaj Sahni: Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978)
- 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]
- [j11]Ellis Horowitz, Sartaj Sahni: Exact and Approximate Algorithms for Scheduling Nonidentical Processors. J. ACM 23(2): 317-327 (1976)
- [j10]
- [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]
- [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]
- [c2]Sartaj Sahni, Teofilo F. Gonzalez: P-Complete Problems and Approximate Solutions. SWAT (FOCS) 1974: 28-32
- 1972
- [c1]Sartaj Sahni: Some Related Problems from Network Flows, Game Theory and Integer Programming. SWAT (FOCS) 1972: 130-138
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:12 CEST by the dblp team