dblp.uni-trier.dewww.uni-trier.de

Sartaj Sahni Vis

Sartaj K. Sahni

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
223EEYan Li, Sanjay Ranka, Sartaj Sahni: In-advance path reservation for file transfers In e-Science applications. ISCC 2009: 176-181
222EEShibdas Bandyopadhyay, Sartaj Sahni: Sorting on a Cell Broadband Engine SPU. ISCC 2009: 218-223
221EETania Mishra, Sartaj Sahni: PETCAM-A power Efficient TCAM for forwarding tables. ISCC 2009: 224-229
220EEWencheng Lu, Sartaj Sahni: Succinct representation of static packet classifiers. IEEE/ACM Trans. Netw. 17(3): 803-816 (2009)
2008
219EEWencheng Lu, Sartaj Sahni: Low Power TCAMs for Very Large Forwarding Tables. INFOCOM 2008: 316-320
218EEXinyan Zha, Sartaj Sahni: Highly compressed Aho-Corasick automata for efficient intrusion detection. ISCC 2008: 298-303
217EEEun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni: Performance evaluation of routing and wavelength assignment algorithms for optical networks. ISCC 2008: 62-67
216EEEun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni: An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks. ISPAN 2008: 133-138
215EESartaj Sahni: Sensor Deployment and Source Localization. ISPAN 2008: 67
214EEWencheng Lu, Sartaj Sahni: Packet Classification Using Space-Efficient Pipelined Multibit Tries. IEEE Trans. Computers 57(5): 591-605 (2008)
213EEShigang Chen, Meongchul Song, Sartaj Sahni: Two techniques for fast computation of constrained shortest paths. IEEE/ACM Trans. Netw. 16(1): 105-115 (2008)
2007
212EESartaj 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
211EEWencheng Lu, Sartaj Sahni: Succinct Representation of Static Packet Forwarding Tables. ICN 2007: 78
210EESartaj Sahni, Haibin Lu: Dynamic Tree Bitmap for IP Lookup and Update. ICN 2007: 79
209EEWencheng Lu, Sartaj Sahni: Succinct Representation Of Static Packet Classifiers. ISCC 2007: 1119-1124
208EEWencheng Lu, Sartaj Sahni: Recursively Partitioned Static IP Router-Tables. ISCC 2007: 437-442
207EEKun Suk Kim, Sartaj Sahni: Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE Trans. Computers 56(1): 32-43 (2007)
206EEXiaochun Xu, Sartaj Sahni: Approximation Algorithms for Sensor Deployment. IEEE Trans. Computers 56(12): 1681-1695 (2007)
205EEHaibin Lu, Sartaj Sahni: O(logW) multidimensional packet classification. IEEE/ACM Trans. Netw. 15(2): 462-472 (2007)
2006
204 Sartaj Sahni: IASTED International Conference on Advances in Computer Science and Technology, January 23-25, 2006, Puerto Vallarta, Mexico IASTED/ACTA Press 2006
203EEJoongseok Park, Sartaj Sahni: Power Assignment For Symmetric Communication InWireless Sensor Networks. ISCC 2006: 591-596
202EEWencheng Lu, Sartaj Sahni: Packet Forwarding Using Pipelined Multibit Tries. ISCC 2006: 802-807
201EEWencheng Lu, Sartaj Sahni: Packet Classification Using Pipelined Two-Dimensional Multibit Tries. ISCC 2006: 808-813
200EEMeongchul Song, Sartaj Sahni: Approximation Algorithms for Multiconstrained Quality-of-Service Routing. IEEE Trans. Computers 55(5): 603-617 (2006)
199EEJoongseok Park, Sartaj Sahni: An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks. IEEE Trans. Computers 55(8): 1048-1056 (2006)
2005
198EEWencheng Lu, Sartaj Sahni: Packet Classification Using Two-Dimensional Multibit Tries. ISCC 2005: 849-854
197EESartaj Sahni: Data Structures and Algorithms for Packet Forwarding and Classification. ISPA 2005: 1
196EEHaibin Lu, Kun Suk Kim, Sartaj K. Sahni: Prefix and Interval-Partitioned Dynamic IP Router-Tables. IEEE Trans. Computers 54(5): 545-557 (2005)
195EEHaibin Lu, Sartaj Sahni: A B-Tree Dynamic Router-Table Design. IEEE Trans. Computers 54(7): 813-824 (2005)
194EEJoongseok Park, Sartaj Sahni: Maximum Lifetime Broadcasting in Wireless Networks. IEEE Trans. Computers 54(9): 1081-1090 (2005)
193EEXuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao: Packet classification consuming small amount of memory. IEEE/ACM Trans. Netw. 13(5): 1135-1145 (2005)
192EEHaibin Lu, Sartaj Sahni: Conflict detection and resolution in two-dimensional prefix router tables. IEEE/ACM Trans. Netw. 13(6): 1353-1363 (2005)
191EESartaj Sahni, Xiaochun Xu: Algorithms for Wireless Sensor Networks. IJDSN 1(1): 35-56 (2005)
2004
190EEXuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao: Fast Update Algorithm for IP Forwarding Table Using Independent Sets. HSNMC 2004: 324-335
189EEHaibin Lu, Sartaj K. Sahni: A B-tree dynamic router-table design. ISCC 2004: 840-845
188EEHaibin Lu, Sartaj K. Sahni: Dynamic IP router-tables using highest-priority matching. ISCC 2004: 858-863
187EEHaibin Lu, Sartaj Sahni: O(log n) Dynamic Router-Tables for Prefixes and Ranges. IEEE Trans. Computers 53(10): 1217-1230 (2004)
186EEHaibin Lu, Sartaj Sahni: Enhanced Interval Trees for Dynamic IP Router-Tables. IEEE Trans. Computers 53(12): 1615-1628 (2004)
185EESartaj Sahni, Kun Suk Kim: An O(log n) Dynamic Router-Table Design. IEEE Trans. Computers 53(3): 351-363 (2004)
184EESartaj Sahni, Kun Suk Kim: Efficient Dynamic Lookup For Bursty Access Patterns. Int. J. Found. Comput. Sci. 15(4): 567-591 (2004)
2003
183EEKun Suk Kim, Sartaj Sahni: IP Lookup By Binary Search On Prefix Length. ISCC 2003: 77-82
182EEHaibin Lu, Sartaj Sahni: O(log n) Dynamic Router-Tables For Ranges. ISCC 2003: 91-96
181EEGayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya: A blocked all-pairs shortest-paths algorithm. ACM Journal of Experimental Algorithmics 8: (2003)
180EESartaj Sahni, Kun Suk Kim: Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4): 650-662 (2003)
179EESartaj 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)
178EEHaejae Jung, Sartaj Sahni: Supernode Binary Search Trees. Int. J. Found. Comput. Sci. 14(3): 465-490 (2003)
177EEAnuj Jain, Sartaj Sahni, Jatinder Palta, James Dempsey: Partitioning 3d Phantoms Into Homogeneous Cuboids. Int. J. Found. Comput. Sci. 14(5): 905-932 (2003)
2002
176 Sartaj Sahni, Viktor K. Prasanna, Uday Shukla: High Performance Computing - HiPC 2002, 9th International Conference, Bangalore, India, December 18-21, 2002, Proceedings Springer 2002
175EESartaj Sahni: Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. COCOON 2002: 2
174EEChih-Fang Wang, Sartaj Sahni: Computational Geometry On The OTIS-Mesh Optoelectronic Computer. ICPP 2002: 501-
173EESartaj Sahni, Kun Suk Kim: O(log n) dynamic packet routing. ISCC 2002: 443-448
172EESartaj Sahni, Kun Suk Kim, Haibin Lu: Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. ISPAN 2002: 3-
171EESartaj Sahni, Kun Suk Kim: Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. SAINT 2002: 220-229
170EEEdward Y. C. Cheng, Sartaj Sahni: Gate Resizing to Reduce Power Consumption. Int. J. Found. Comput. Sci. 13(3): 405-429 (2002)
169EEKun Suk Kim, Sartaj Sahni: IP Lookup by Binary Search on Prefix Length. Journal of Interconnection Networks 3(3-4): 105-128 (2002)
2001
168EESartaj Sahni, Kun Suk Kim: Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. FTDCS 2001: 178-184
167 Sartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. IPDPS 2001: 136
166EEChih-Fang Wang, Sartaj Sahni: Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Computers 50(7): 635-646 (2001)
165 Sartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. Int. J. Found. Comput. Sci. 12(3): 249-264 (2001)
164 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)
163 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)
2000
162EESartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka: Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426
161EEGayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya: A Blocked All-Pairs Shortest-Path Algorithm. SWAT 2000: 419-432
160EEKyunrak Chong, Sartaj Sahni: Correspondence-Based Data Structures for Double-Ended Priority Queues. ACM Journal of Experimental Algorithmics 5: 2 (2000)
159EEChih-Fang Wang, Sartaj Sahni: Image Processing on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distrib. Syst. 11(2): 97-109 (2000)
158EESartaj Sahni: Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network. IEEE Trans. Parallel Distrib. Syst. 11(7): 720-728 (2000)
157EESartaj Sahni: The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations. IEEE Trans. Parallel Distrib. Syst. 11(7): 739-748 (2000)
156 Sanguthevar Rajasekaran, Sartaj Sahni: Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000)
155 Seonghun Cho, Sartaj Sahni: A New Weight Balanced Binary Search Tree. Int. J. Found. Comput. Sci. 11(3): 485-513 (2000)
1999
154 Jang-uk In, Canming Jin, Jih-Kwon Peir, Sanjay Ranka, Sartaj Sahni: A Framework for Matching Applications with Parallel Machines. HiPC 1999: 331-338
153EESartaj Sahni: Models and Algorithms for Optical and Optoelectronic Parallel Computers. ISPAN 1999: 2-9
152EESartaj Sahni, Baba C. Vemuri, F. Chen, C. Kapoor: Variable-Bit-Lengthn Coding: An Effective Coding Method. VISUAL 1999: 665-672
151EEF. Chen, Sartaj Sahni, Baba C. Vemuri: Efficient Algorithms for Lossless Compression of 2D/3D Images. VISUAL 1999: 681-688
150 Seonghun Cho, Sartaj Sahni: Mergeable Double-Ended Priority Queues. Int. J. Found. Comput. Sci. 10(1): 1-18 (1999)
1998
149EESeonghun Cho, Sartaj Sahni: Weight-Biased Leftist Trees and Modified Skip Lists. ACM Journal of Experimental Algorithmics 3: 2 (1998)
148EEChih-Fang Wang, Sartaj Sahni: Basic Operations on the OTIS-Mesh Optoelectronic Computer. IEEE Trans. Parallel Distrib. Syst. 9(12): 1226-1236 (1998)
147EESanguthevar Rajasekaran, Sartaj Sahni: Randomized Routing, Selection, and Sorting on the OTIS-Mesh. IEEE Trans. Parallel Distrib. Syst. 9(9): 833-840 (1998)
146 Sartaj Sahni, Chih-Fang Wang: BPC Permutations on the OTIS-Hypercube Optoelectronic Computer. Informatica (Slovenia) 22(3): (1998)
145 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)
1997
144EESartaj Sahni, George L. Vairaktarakis: Scheduling For Distributed Computing. FTDCS 1997: 284-289
143EEBaba C. Vemuri, S. Huang, Sartaj Sahni, Christiana Morison Leonard, C. Mohr, T. Lucas, R. L. Gilmore, J. Fitzsimmons: A Robust and Efficient Algorithm for Image Registration. IPMI 1997: 465-470
142EEJu-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)
141EESanguthevar Rajasekaran, Sartaj Sahni: Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. IEEE Trans. Parallel Distrib. Syst. 8(11): 1123-1132 (1997)
140EEAndrew Lim, Venkat Thanvantri, Sartaj Sahni: Planar topological routing. IEEE Trans. on CAD of Integrated Circuits and Systems 16(6): 651-656 (1997)
139EEDinesh 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)
138 Sanguthevar Rajasekaran, Sartaj Sahni: Determinisitic Routing on the Array with Reconfigurable Optical Buses. Parallel Processing Letters 7(3): 219-224 (1997)
1996
137 Seonghun Cho, Sartaj Sahni: Weight Biased Leftist Trees and Modified Skip Lists. COCOON 1996: 361-370
136EEVenkat Thanvantri, Sartaj Sahni: Optimal folding of standard and custom cells. ACM Trans. Design Autom. Electr. Syst. 1(1): 123-143 (1996)
135 Sartaj Sahni: Scheduling Master-Slave Multiprocessor Systems. IEEE Trans. Computers 45(10): 1195-1199 (1996)
134EEMario 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)
133 Allan Gottlieb, Kai Hwang, Sartaj Sahni: Editorial Announcement. J. Parallel Distrib. Comput. 35(1): 1 (1996)
1995
132EESartaj Sahni: Scheduling Master-Slave Multiprocessor Systems. Euro-Par 1995: 611-622
131 Sanguthevar Rajasekaran, Sartaj Sahni: Sorting and Selection on Distributed Memory Bus Computers. ICPP (3) 1995: 151-154
130EESartaj Sahni: The DMBC: Architecture and Fundamental Operations. International Conference on Supercomputing 1995: 60-66
129EEAndrew Lim, Sartaj K. Sahni, Venkat Thanvantri: A fast algorithm to test planar topological routability. VLSI Design 1995: 8-12
128EEMadhusudan Nigam, Sartaj Sahni: Sorting n2 Numbers on n×n Meshes. IEEE Trans. Parallel Distrib. Syst. 6(12): 1221-1225 (1995)
127EEVenkat Thanvantri, Sartaj Sahni: Folding a stack of equal width components. IEEE Trans. on CAD of Integrated Circuits and Systems 14(6): 775-780 (1995)
126EESeonghun Cho, Sartaj Sahni: Minimum area joining of compacted cells. IEEE Trans. on CAD of Integrated Circuits and Systems 14(7): 903-909 (1995)
125 Allan Gottlieb, Kai Hwang, Sartaj Sahni: Editorial Message. J. Parallel Distrib. Comput. 31(2): 99-100 (1995)
124 Sartaj Sahni: Data Manipulation on the Distributed Memory Bus Computer. Parallel Processing Letters 5: 3-14 (1995)
1994
123EEVenkat Thanvantri, Sartaj K. Sahni: Folding a stack of equal width components. ICCAD 1994: 432-435
122 Madhusudan Nigam, Sartaj Sahni: Triangulation on a Reconfigurable Mesh With Buses. ICPP (3) 1994: 251-257
121 Madhusudan Nigam, Sartaj Sahni: Computational Geometry on a Reconflgurable Mesh. IPPS 1994: 86-93
120 Keumog Ahn, Sartaj Sahni: Flipping Modules to Improve Circuit Performance and Routability. VLSI Design 1994: 127-132
119 Andrew Lim, Sartaj Sahni: Segmented Winner Trees. Elektronische Informationsverarbeitung und Kybernetik 30(1): 29-43 (1994)
118 Dinesh P. Mehta, Sartaj Sahni: Computing Display Conflicts in String Visualization. IEEE Trans. Computers 43(3): 350-361 (1994)
117 Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni: Deleting Vertices to Bound Path Length. IEEE Trans. Computers 43(9): 1091-1096 (1994)
116 Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Hough Transform. J. Parallel Distrib. Comput. 20(1): 69-77 (1994)
115 Madhusudan Nigam, Sartaj Sahni: Sorting n Numbers on n x n Reconfigurable Meshes with Buses. J. Parallel Distrib. Comput. 23(1): 37-48 (1994)
1993
114EEMario A. Lopez, Ravi Janardan, Sartaj K. Sahni: A fast algorithm for VLSI net extraction. ICCAD 1993: 770-774
113 Madhusudan Nigam, Sartaj Sahni: Sorting n Numbers on n x n Reconfigurable Meshes with Buses. IPPS 1993: 174-181
112 Madhusudan Nigam, Sartaj Sahni: Sorting n2 Numbers on n x n Meshes. IPPS 1993: 73-78
111 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
110 Keumog Ahn, Sartaj Sahni: NP-Hard Module Rotation Problems. IEEE Trans. Computers 42(12): 1506-1510 (1993)
109 Andrew Lim, Siu-Wing Cheng, Sartaj Sahni: Optimal Joining of Compacted Cells. IEEE Trans. Computers 42(5): 597-607 (1993)
108 Dinesh P. Mehta, Sartaj Sahni: A Data Structure for Circular String Analysis and Visualization. IEEE Trans. Computers 42(8): 992-997 (1993)
107EEJing-Fu Fu Jenq, Sartaj Sahni: Image Shrinking and Expanding on a Pyramid. IEEE Trans. Parallel Distrib. Syst. 4(11): 1291-1296 (1993)
106EEKyunrak Chong, Sartaj Sahni: Minimizing total wire length by flipping modules. IEEE Trans. on CAD of Integrated Circuits and Systems 12(1): 167-175 (1993)
105EEDoowon Paik, Sartaj Sahni: Optimal folding of bit sliced stacks. IEEE Trans. on CAD of Integrated Circuits and Systems 12(11): 1679-1685 (1993)
104EEKeumog Ahn, Sartaj Sahni: Constrained via minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 12(2): 273-282 (1993)
103EEKyunrak Chong, Sartaj Sahni: Optimal realizations of floorplans [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 12(6): 793-801 (1993)
102EEWing 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)
101EEJing-Fu Jenq, Sartaj Sahni: Histogramming on a Reconfigurable Mesh Computer. Parallel Algorithms Appl. 1(3): 179-190 (1993)
1992
100EEAndrew Lim, Sartaj Sahni: Segmented winner trees. ACM Southeast Regional Conference 1992: 157-164
99 Dinesh P. Mehta, Sartaj Sahni: Computing Display Conflicts in String and Circular String Visualization. CPM 1992: 244-261
98EEWing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni: On the Circuit Implementation Problem. DAC 1992: 478-483
97 Jing-Fu Fu Jenq, Sartaj Sahni: Image Shrinking and Expanding on a Pyramid. ICPP (3) 1992: 302-309
96 Jing-Fu Fu Jenq, Sartaj Sahni: Serial and Parallel Algorithms for the Medial Axis Transform. IPPS 1992: 326-333
95 Jing-Fu Fu Jenq, Sartaj Sahni: Histogramming on a Reconfigurable Mesh Computer. IPPS 1992: 425-432
94EEJing-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)
1991
93 Patrick C. McGeer, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Sartaj Sahni: Performance Enhancement through the Generalized Bypass Transform. ICCAD 1991: 184-187
92 Kyunrak Chong, Sartaj Sahni: Flipping Modules to Minimize Maximum Wire Length. ICCD 1991: 528-531
91 Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components. ICPP (3) 1991: 280-281
90 Jing-Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for the Hough Transform. ICPP (3) 1991: 34-41
89 Jing-Fu Fu Jenq, Sartaj Sahni: Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching. IPPS 1991: 208-215
88 Jinwoon Woo, Sartaj Sahni: Load Balancing on a Hypercube. IPPS 1991: 525-530
87EESanjay Ranka, Sartaj Sahni: Clustering on a Hypercube Multicomputer. IEEE Trans. Parallel Distrib. Syst. 2(2): 129-137 (1991)
1990
86 Madhusudan Nigam, Sartaj Sahni, Balaji Krishnamurthy: Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs. ICPP (3) 1990: 340-343
85 Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq: A Hardware Accelerator for Maze Routing. IEEE Trans. Computers 39(1): 141-145 (1990)
84EESanjay Ranka, Sartaj Sahni: Odd Even Shifts in SIMD Hypercubes. IEEE Trans. Parallel Distrib. Syst. 1(1): 77-82 (1990)
83EESanjay Ranka, Sartaj Sahni: Convolution on Mesh Connected Multicomputers. IEEE Trans. Pattern Anal. Mach. Intell. 12(3): 315-318 (1990)
82EEWing 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)
81EESan-Yuan Wu, Sartaj Sahni: Covering rectilinear polygons by rectangles. IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 377-388 (1990)
80EEWing Ning Li, Sartaj Sahni: Pull up transistor folding. IEEE Trans. on CAD of Integrated Circuits and Systems 9(5): 512-521 (1990)
79EETeofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni: Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS Journal on Computing 2(3): 219-224 (1990)
78 Sanjay Ranka, Sartaj Sahni: Image Template Matching on MIMD Hypercube Multicomputers. J. Parallel Distrib. Comput. 10(1): 79-84 (1990)
77 Sanjay Ranka, Sartaj Sahni: String Editing on an SIMD Hypercube Multicomputer. J. Parallel Distrib. Comput. 9(4): 411-418 (1990)
1989
76 Sanjay Ranka, Sartaj Sahni: Hypercube Algorithms for Image Transformations. ICPP (3) 1989: 24-31
75 Sanjay Ranka, Sartaj Sahni: Efficient Serial and Parallel Algorithms for Median Filtering. ICPP (3) 1989: 56-62
74 Jayaram Bhasker, Sartaj Sahni: Via Assignment in Single-Row Routing. IEEE Trans. Computers 38(1): 142-149 (1989)
73 Li-Shin Lin, Sartaj Sahni: Fair Edge Deletion Problems. IEEE Trans. Computers 38(5): 756-761 (1989)
72EEWing 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)
71 Kam-Hoi Cheng, Sartaj Sahni: A new VLSI system for adaptive recursive filtering. Parallel Computing 10(1): 109-115 (1989)
70 Kam-Hoi Cheng, Sartaj Sahni: VLSI architectures for back substitution. Parallel Computing 12(1): 53-69 (1989)
1988
69EEWing Ning Li, Sudhakar M. Reddy, Sartaj Sahni: On Path Selection in Combinational Logic Circuits. DAC 1988: 142-147
68 Jayaram Bhasker, Sartaj Sahni: A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. Algorithmica 3: 247-278 (1988)
67 Li-Shin Lin, Sartaj Sahni: Maximum Alignment of Interchageable Terminals. IEEE Trans. Computers 37(10): 1166-1177 (1988)
66EESartaj 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)
65EESurendra Nahar, Sartaj K. Sahni: Fast algorithm for polygon decomposition. IEEE Trans. on CAD of Integrated Circuits and Systems 7(4): 473-483 (1988)
64 Sartaj Sahni: Special Issue on Parallel Architectures and Algorithms. J. Parallel Distrib. Comput. 5(4): 331-333 (1988)
63 Jong Lee, Eugene Shragowitz, Sartaj Sahni: A Hypercube Algorithm for the 0/1 Knapsack Problem. J. Parallel Distrib. Comput. 5(4): 438-456 (1988)
1987
62EEYoungju Won, Sartaj Sahni, Yacoub M. El-Ziq: A Hardware Accelerator for Maze Routing. DAC 1987: 800-806
61 Youngju Won, Sartaj Sahni: Maze Routing on a Hypercube Multiprocessor Computer. ICPP 1987: 630-637
60 Jong Lee, Sartaj Sahni, Eugene Shragowitz: A Hypecube Algorithm for the 0/1 Knapsack Problem. ICPP 1987: 699-706
59 Jing-Fu Jenq, Sartaj Sahni: All Pairs Shortest Paths on a Hypercube Multiprocessor. ICPP 1987: 713-716
58EERajiv Kane, Sartaj K. Sahni: A Systolic Design-Rule Checker. IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 22-32 (1987)
57EESangyong Han, Sartaj K. Sahni: Layering Algorithms For Single-Row Routing. IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 95-102 (1987)
56EEKam-Hoi Cheng, Sartaj Sahni: VLSI systems for band matrix multiplication. Parallel Computing 4(3): 239-258 (1987)
1986
55EEJayaram Bhasker, Sartaj Sahni: A linear algorithm to find a rectangular dual of a planar triangulated graph. DAC 1986: 108-114
54EESurendra Nahar, Sartaj Sahni, Eugene Shragowitz: Simulated annealing and combinatorial optimization. DAC 1986: 293-299
53EESurendra Nahar, Sartaj Sahni: A time and space efficient net extractor. DAC 1986: 411-417
52 Sartaj Sahni: NTU Computer Science Program. FJCC 1986: 11-13
51EEJayaram Bhaskar, Sartaj Sahni: Via Assignment in Single Row Routing. FSTTCS 1986: 154-176
50 Kam-Hoi Cheng, Sartaj Sahni: A New VLSI System for Adaptive Recursive Filtering. ICPP 1986: 387-389
49 Kam-Hoi Cheng, Sartaj Sahni: VLSI Artchitectures for Back Substitution. IFIP Congress 1986: 373-378
48 Raghunath Raghavan, James Cohoon, Sartaj Sahni: Single Bend Wiring. J. Algorithms 7(2): 232-257 (1986)
1985
47EESangyong Han, Sartaj Sahni: Layering algorithms for single row routing. DAC 1985: 516-522
46EESurendra Nahar, Sartaj Sahni, Eugene Shragowitz: Experiments with simulated annealing. DAC 1985: 748-752
45EEKam-Hoi Cheng, Sartaj Sahni: VLSI Systems For Matrix Multiplication. FSTTCS 1985: 428-456
1984
44EERajiv Kane, Sartaj Sahni: VLSI Systems For Design Rule Checks. FSTTCS 1984: 259-278
43 Ten-Hwang Lai, Sartaj Sahni: Anomalies in Parallel Branch-and-Bound Algorithms. Commun. ACM 27(6): 594-602 (1984)
42 Sartaj Sahni: Scheduling Multipipeline and Multiprocessor Computers. IEEE Trans. Computers 33(7): 637-645 (1984)
41EESangyong Han, Sartaj Sahni: Single-Row Routing in Narrow Streets. IEEE Trans. on CAD of Integrated Circuits and Systems 3(3): 235-241 (1984)
40 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)
1983
39 Ten-Hwang Lai, Sartaj Sahni: Anomalies in Parallel Branch-and-Bound Algorithms. ICPP 1983: 183-190
38EEEliezer Dekel, Sartaj Sahni: Parallel Generation of Postfix and Tree Forms. ACM Trans. Program. Lang. Syst. 5(3): 300-317 (1983)
37 Raghunath Raghavan, Sartaj Sahni: Single Row Routing. IEEE Trans. Computers 32(3): 209-220 (1983)
36 Eliezer Dekel, Sartaj Sahni: Binary Trees and Parallel Scheduling Algorithms. IEEE Trans. Computers 32(3): 307-315 (1983)
35 Ten-Hwang Lai, Sartaj Sahni: Nearly On-Line Scheduling of Multiprocessor Systems with Memories. J. Algorithms 4(4): 353-362 (1983)
1982
34 Eliezer Dekel, Sartaj Sahni: Parallel generation of the postfix form. ICPP 1982: 171-177
33 Eliezer Dekel, Sartaj Sahni: A parallel matching algorithm for convex bipartite graphs. ICPP 1982: 178-184
32 David Nassimi, Sartaj Sahni: Parallel Algorithms to Set Up the Benes Permutation Network. IEEE Trans. Computers 31(2): 148-154 (1982)
31 David Nassimi, Sartaj Sahni: Optimal BPC Permutations on a Cube Connected SIMD Computer. IEEE Trans. Computers 31(4): 338-341 (1982)
30EEDavid Nassimi, Sartaj Sahni: Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM 29(3): 642-667 (1982)
1981
29EEEliezer Dekel, Sartaj Sahni: Binary trees and parallel scheduling algorithms. CONPAR 1981: 480-492
28 David Nassimi, Sartaj Sahni: Data Broadcasting in SIMD Computers. IEEE Trans. Computers 30(2): 101-107 (1981)
27 David Nassimi, Sartaj Sahni: A Self-Routing Benes Network and Parallel Permutation Algorithms. IEEE Trans. Computers 30(5): 332-340 (1981)
26 Eliezer Dekel, David Nassimi, Sartaj Sahni: Parallel Matrix and Graph Algorithms. SIAM J. Comput. 10(4): 657-675 (1981)
1980
25EEDavid Nassimi, Sartaj Sahni: An optimal routing algorithm for mesh-connected Parallel computers. J. ACM 27(1): 6-29 (1980)
24EESartaj Sahni, Yookun Cho: Scheduling Independent Tasks with Due Times on a Uniform Processor System. J. ACM 27(3): 550-563 (1980)
23 Yookun Cho, Sartaj Sahni: Bounds for List Schedules on Uniform Processors. SIAM J. Comput. 9(1): 91-103 (1980)
22 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)
21 David Nassimi, Sartaj Sahni: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. SIAM J. Comput. 9(4): 744-757 (1980)
1979
20 David Nassimi, Sartaj Sahni: Bitonic Sort on a Mesh-Connected Parallel Computer. IEEE Trans. Computers 28(1): 2-7 (1979)
19 Sartaj Sahni, Yookun Cho: Nearly On Line Scheduling of a Uniform Processor System with Release Times. SIAM J. Comput. 8(2): 275-285 (1979)
1978
18 Ellis Horowitz, Sartaj Sahni: Fundamentals of Computer Algorithms. Computer Science Press 1978
17EETeofilo F. Gonzalez, Sartaj Sahni: Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978)
1977
16EETeofilo 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)
15 Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni: Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977)
1976
14EESartaj Sahni: Algorithms for Scheduling Independent Tasks. J. ACM 23(1): 116-127 (1976)
13EEEllis Horowitz, Sartaj Sahni: Exact and Approximate Algorithms for Scheduling Nonidentical Processors. J. ACM 23(2): 317-327 (1976)
12EESartaj Sahni, Teofilo F. Gonzalez: P-Complete Approximation Problems. J. ACM 23(3): 555-565 (1976)
11EETeofilo F. Gonzalez, Sartaj Sahni: Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976)
10 Oscar H. Ibarra, Sartaj Sahni, Chul E. Kim: Finite Automata with Multiplication. Theor. Comput. Sci. 2(3): 271-294 (1976)
1975
9 Oscar H. Ibarra, Sartaj Sahni: Polynomially Complete Fault Detection Problems. IEEE Trans. Computers 24(3): 242-249 (1975)
8EESartaj Sahni: Approximate Algorithms for the 0/1 Knapsack Problem. J. ACM 22(1): 115-124 (1975)
7EEEllis Horowitz, Sartaj Sahni: On Computing the Exact Determinant of Matrices with Polynomial Entries. J. ACM 22(1): 38-50 (1975)
6 Oscar H. Ibarra, Sartaj Sahni: Hierarchies of Turing Machines with Restricted Tape Alphabet Size. J. Comput. Syst. Sci. 11(1): 56-67 (1975)
5 Ellis Horowitz, Sartaj Sahni: The Computation of Powers of Symbolic Polynomials. SIAM J. Comput. 4(2): 201-208 (1975)
1974
4 Sartaj Sahni, Teofilo F. Gonzalez: P-Complete Problems and Approximate Solutions FOCS 1974: 28-32
3EEEllis Horowitz, Sartaj Sahni: Computing Partitions with Applications to the Knapsack Problem. J. ACM 21(2): 277-292 (1974)
2 Sartaj Sahni: Computationally Related Problems. SIAM J. Comput. 3(4): 262-279 (1974)
1972
1 Sartaj Sahni: Some Related Problems from Network Flows, Game Theory and Integer Programming FOCS 1972: 130-138

Coauthor Index

1Prathima Agrawal [98] [102]
2Keumog Ahn [104] [110] [120]
3Shibdas Bandyopadhyay [222]
4Jayaram Bhaskar [51]
5Jayaram Bhasker [55] [68] [74]
6Robert K. Brayton [93]
7F. Chen [151] [152]
8Shigang Chen [213]
9Edward Y. C. Cheng [170]
10Kam-Hoi Cheng [45] [49] [50] [56] [70] [71]
11Siu-Wing Cheng [109]
12Seonghun Cho [126] [137] [149] [150] [155]
13Yookun Cho [19] [23] [24]
14Kyunrak Chong [92] [103] [106] [160]
15James Cohoon [48]
16Robert L. Constable [22]
17Timothy A. Davis [162]
18Eliezer Dekel [26] [29] [33] [34] [36] [38]
19James Dempsey [177]
20Yacoub M. El-Ziq [62] [85]
21J. Fitzsimmons [143]
22William R. Franta [16]
23R. L. Gilmore [143]
24Teofilo F. Gonzalez [4] [11] [12] [15] [16] [17] [79]
25Allan Gottlieb [125] [133]
26Sang-Yong Han (Sangyong Han) [41] [47] [57]
27Ellis Horowitz [3] [5] [7] [13] [18]
28Y. Hu [163]
29S. Huang [143]
30Harry B. Hunt III [22]
31Kai Hwang [125] [133]
32Oscar H. Ibarra [6] [9] [10] [15]
33Jang-uk In [154]
34Anuj Jain [177]
35Ravi Janardan [114] [134]
36Ju-wook Jang [142]
37Jing-Fu Jenq [59] [90] [91] [101] [116]
38Jing-Fu Fu Jenq [89] [94] [95] [96] [97] [107]
39Canming Jin [154]
40Eun-Sung Jung [212] [216] [217]
41Haejae Jung [178]
42Nara Kamath [212]
43Rajiv Kane [44] [58]
44C. Kapoor [152]
45Chul E. Kim [10]
46Kun Suk Kim [168] [169] [171] [172] [173] [179] [180] [183] [184] [185] [196] [207]
47Balaji Krishnamurthy [86]
48Ten-Hwang Lai [35] [39] [40] [43]
49Eugene L. Lawler [79]
50Jong Lee [60] [63]
51Christiana Morison Leonard [143]
52Wing Ning Li [69] [72] [80] [82] [98] [102]
53Yan Li [212] [216] [217] [223]
54Andrew Lim [98] [100] [102] [109] [119] [129] [140]
55Li-Shin Lin [67] [73]
56Mario A. Lopez (Mario Alberto López) [114] [134]
57Haibin Lu [172] [179] [182] [186] [187] [188] [189] [192] [195] [196] [205] [210]
58Wencheng Lu [198] [201] [202] [208] [209] [211] [214] [219] [220]
59T. Lucas [143]
60Jun Luo [163]
61Patrick C. McGeer [93]
62Dinesh P. Mehta [99] [108] [118] [139]
63Tania Mishra [221]
64C. Mohr [143]
65Srabani Mukhopadhyaya [161] [181]
66Surendra Nahar [46] [53] [54] [65]
67David Nassimi [20] [21] [25] [26] [27] [28] [30] [31] [32]
68H. Nick [163] [164]
69Madhusudan Nigam [86] [112] [113] [115] [121] [122] [128] [142]
70Doowon Paik [105] [111] [117] [145]
71Jatinder Palta [177]
72Panos M. Pardalos [163] [164]
73Joongseok Park [194] [199] [203]
74Jih-Kwon Peir [154]
75Viktor K. Prasanna (V. K. Prasanna Kumar) [142] [176]
76Raghunath Raghavan [37] [48]
77Sanguthevar Rajasekaran [131] [138] [141] [147] [156] [162] [163] [164]
78Sanjay Ranka [75] [76] [77] [78] [83] [84] [87] [154] [162] [212] [216] [217] [223]
79Nageshwara Rao [212]
80Sudhakar M. Reddy [69] [72] [82] [111] [117] [145]
81Alberto L. Sangiovanni-Vincentelli [93]
82G. Shaw [163] [164]
83Eugene Shragowitz [46] [54] [60] [63]
84Uday Shukla [176]
85Meongchul Song [200] [213]
86Xuehong Sun [190] [193]
87Venkat Thanvantri [123] [127] [129] [136] [140]
88George L. Vairaktarakis [144]
89Baba C. Vemuri [143] [151] [152]
90Gayathri Venkataraman [161] [181]
91Chih-Fang Wang [146] [148] [159] [166] [174]
92Youngju Won [61] [62] [85]
93Jinwoon Woo [88]
94San-Yuan Wu [66] [81]
95Xiaochun Xu [191] [206]
96Xinyan Zha [218]
97Yiqiang Q. Zhao [190] [193]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)