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

Sartaj Sahni

Sartaj K. Sahni

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

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

Colors in the list of coauthors

Copyright © Wed May 28 02:56:03 2008 by Michael Ley (ley@uni-trier.de)