The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sartaj Sahni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sartaj Sahni
    Approximate Algorithms for the 0/1 Knapsack Problem. [Citation Graph (3, 0)][DBLP]
    J. ACM, 1975, v:22, n:1, pp:115-124 [Journal]
  2. David Nassimi, Sartaj Sahni
    Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:744-757 [Journal]
  3. Sartaj Sahni
    Some Related Problems from Network Flows, Game Theory and Integer Programming [Citation Graph (1, 0)][DBLP]
    FOCS, 1972, pp:130-138 [Conf]
  4. Ellis Horowitz, Sartaj Sahni
    Exact and Approximate Algorithms for Scheduling Nonidentical Processors. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1976, v:23, n:2, pp:317-327 [Journal]
  5. Oscar H. Ibarra, Sartaj Sahni
    Polynomially Complete Fault Detection Problems. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1975, v:24, n:3, pp:242-249 [Journal]
  6. Andrew Lim, Sartaj Sahni
    Segmented winner trees. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 1992, pp:157-164 [Conf]
  7. Seonghun Cho, Sartaj Sahni
    Weight Biased Leftist Trees and Modified Skip Lists. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:361-370 [Conf]
  8. Sartaj Sahni
    Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:2- [Conf]
  9. Eliezer Dekel, Sartaj Sahni
    Binary trees and parallel scheduling algorithms. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1981, pp:480-492 [Conf]
  10. Dinesh P. Mehta, Sartaj Sahni
    Computing Display Conflicts in String and Circular String Visualization. [Citation Graph (0, 0)][DBLP]
    CPM, 1992, pp:244-261 [Conf]
  11. Jayaram Bhasker, Sartaj Sahni
    A linear algorithm to find a rectangular dual of a planar triangulated graph. [Citation Graph (0, 0)][DBLP]
    DAC, 1986, pp:108-114 [Conf]
  12. Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni
    On the Circuit Implementation Problem. [Citation Graph (0, 0)][DBLP]
    DAC, 1992, pp:478-483 [Conf]
  13. Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni
    On Path Selection in Combinational Logic Circuits. [Citation Graph (0, 0)][DBLP]
    DAC, 1988, pp:142-147 [Conf]
  14. Surendra Nahar, Sartaj Sahni
    A time and space efficient net extractor. [Citation Graph (0, 0)][DBLP]
    DAC, 1986, pp:411-417 [Conf]
  15. Surendra Nahar, Sartaj Sahni, Eugene Shragowitz
    Simulated annealing and combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    DAC, 1986, pp:293-299 [Conf]
  16. Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq
    A Hardware Accelerator for Maze Routing. [Citation Graph (0, 0)][DBLP]
    DAC, 1987, pp:800-806 [Conf]
  17. Surendra Nahar, Sartaj Sahni, Eugene Shragowitz
    Experiments with simulated annealing. [Citation Graph (0, 0)][DBLP]
    DAC, 1985, pp:748-752 [Conf]
  18. Sangyong Han, Sartaj Sahni
    Layering algorithms for single row routing. [Citation Graph (0, 0)][DBLP]
    DAC, 1985, pp:516-522 [Conf]
  19. Sartaj Sahni
    Scheduling Master-Slave Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1995, pp:611-622 [Conf]
  20. Sartaj Sahni
    NTU Computer Science Program. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:11-13 [Conf]
  21. Sartaj Sahni, Teofilo F. Gonzalez
    P-Complete Problems and Approximate Solutions [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:28-32 [Conf]
  22. Jayaram Bhaskar, Sartaj Sahni
    Via Assignment in Single Row Routing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:154-176 [Conf]
  23. Kam-Hoi Cheng, Sartaj Sahni
    VLSI Systems For Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:428-456 [Conf]
  24. Rajiv Kane, Sartaj Sahni
    VLSI Systems For Design Rule Checks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:259-278 [Conf]
  25. Sartaj Sahni, Kun Suk Kim
    Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. [Citation Graph (0, 0)][DBLP]
    FTDCS, 2001, pp:178-184 [Conf]
  26. Sartaj Sahni, George L. Vairaktarakis
    Scheduling For Distributed Computing. [Citation Graph (0, 0)][DBLP]
    FTDCS, 1997, pp:284-289 [Conf]
  27. Jang-uk In, Canming Jin, Jih-Kwon Peir, Sanjay Ranka, Sartaj Sahni
    A Framework for Matching Applications with Parallel Machines. [Citation Graph (0, 0)][DBLP]
    HiPC, 1999, pp:331-338 [Conf]
  28. Patrick C. McGeer, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Sartaj Sahni
    Performance Enhancement through the Generalized Bypass Transform. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:184-187 [Conf]
  29. Kyunrak Chong, Sartaj Sahni
    Flipping Modules to Minimize Maximum Wire Length. [Citation Graph (0, 0)][DBLP]
    ICCD, 1991, pp:528-531 [Conf]
  30. Wencheng Lu, Sartaj Sahni
    Succinct Representation of Static Packet Forwarding Tables. [Citation Graph (0, 0)][DBLP]
    ICN, 2007, pp:78- [Conf]
  31. Sartaj Sahni, Haibin Lu
    Dynamic Tree Bitmap for IP Lookup and Update. [Citation Graph (0, 0)][DBLP]
    ICN, 2007, pp:79- [Conf]
  32. Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath
    Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks. [Citation Graph (0, 0)][DBLP]
    ICN, 2007, pp:47- [Conf]
  33. Kam-Hoi Cheng, Sartaj Sahni
    A New VLSI System for Adaptive Recursive Filtering. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:387-389 [Conf]
  34. Jing-Fu Jenq, Sartaj Sahni
    All Pairs Shortest Paths on a Hypercube Multiprocessor. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:713-716 [Conf]
  35. Jjing-Fu Jenq, Sartaj Sahni
    Reconfigurable Mesh Algorithms for the Hough Transform. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:34-41 [Conf]
  36. Jing-Fu Jenq, Sartaj Sahni
    Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:280-281 [Conf]
  37. Jing-Fu Fu Jenq, Sartaj Sahni
    Image Shrinking and Expanding on a Pyramid. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:302-309 [Conf]
  38. Ten-Hwang Lai, Sartaj Sahni
    Anomalies in Parallel Branch-and-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 1983, pp:183-190 [Conf]
  39. Jong Lee, Sartaj Sahni, Eugene Shragowitz
    A Hypecube Algorithm for the 0/1 Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:699-706 [Conf]
  40. Madhusudan Nigam, Sartaj Sahni
    Triangulation on a Reconfigurable Mesh With Buses. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:251-257 [Conf]
  41. Madhusudan Nigam, Sartaj Sahni, Balaji Krishnamurthy
    Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1990, pp:340-343 [Conf]
  42. Sanjay Ranka, Sartaj Sahni
    Efficient Serial and Parallel Algorithms for Median Filtering. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:56-62 [Conf]
  43. Sanjay Ranka, Sartaj Sahni
    Hypercube Algorithms for Image Transformations. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:24-31 [Conf]
  44. Sanguthevar Rajasekaran, Sartaj Sahni
    Sorting and Selection on Distributed Memory Bus Computers. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1995, pp:151-154 [Conf]
  45. Chih-Fang Wang, Sartaj Sahni
    Computational Geometry On The OTIS-Mesh Optoelectronic Computer. [Citation Graph (0, 0)][DBLP]
    ICPP, 2002, pp:501-0 [Conf]
  46. Youngju Won, Sartaj Sahni
    Maze Routing on a Hypercube Multiprocessor Computer. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:630-637 [Conf]
  47. Sartaj Sahni
    The DMBC: Architecture and Fundamental Operations. [Citation Graph (0, 0)][DBLP]
    International Conference on Supercomputing, 1995, pp:60-66 [Conf]
  48. Kam-Hoi Cheng, Sartaj Sahni
    VLSI Artchitectures for Back Substitution. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:373-378 [Conf]
  49. 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. [Citation Graph (0, 0)][DBLP]
    IPMI, 1997, pp:465-470 [Conf]
  50. Jing-Fu Fu Jenq, Sartaj Sahni
    Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching. [Citation Graph (0, 0)][DBLP]
    IPPS, 1991, pp:208-215 [Conf]
  51. Jing-Fu Fu Jenq, Sartaj Sahni
    Serial and Parallel Algorithms for the Medial Axis Transform. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:326-333 [Conf]
  52. Jing-Fu Fu Jenq, Sartaj Sahni
    Histogramming on a Reconfigurable Mesh Computer. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:425-432 [Conf]
  53. Madhusudan Nigam, Sartaj Sahni
    Sorting n2 Numbers on n x n Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:73-78 [Conf]
  54. Madhusudan Nigam, Sartaj Sahni
    Sorting n Numbers on n x n Reconfigurable Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:174-181 [Conf]
  55. Madhusudan Nigam, Sartaj Sahni
    Computational Geometry on a Reconflgurable Mesh. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:86-93 [Conf]
  56. Sartaj Sahni
    Models and Algorithms for Optical and Optoelectronic Parallel Computers. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:136- [Conf]
  57. Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka
    Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:423-426 [Conf]
  58. Jinwoon Woo, Sartaj Sahni
    Load Balancing on a Hypercube. [Citation Graph (0, 0)][DBLP]
    IPPS, 1991, pp:525-530 [Conf]
  59. Haibin Lu, Sartaj Sahni
    O(log n) Dynamic Router-Tables For Ranges. [Citation Graph (0, 0)][DBLP]
    ISCC, 2003, pp:91-96 [Conf]
  60. Wencheng Lu, Sartaj Sahni
    Packet Classification Using Two-Dimensional Multibit Tries. [Citation Graph (0, 0)][DBLP]
    ISCC, 2005, pp:849-854 [Conf]
  61. Wencheng Lu, Sartaj Sahni
    Packet Forwarding Using Pipelined Multibit Tries. [Citation Graph (0, 0)][DBLP]
    ISCC, 2006, pp:802-807 [Conf]
  62. Kun Suk Kim, Sartaj Sahni
    IP Lookup By Binary Search On Prefix Length. [Citation Graph (0, 0)][DBLP]
    ISCC, 2003, pp:77-82 [Conf]
  63. Wencheng Lu, Sartaj Sahni
    Packet Classification Using Pipelined Two-Dimensional Multibit Tries. [Citation Graph (0, 0)][DBLP]
    ISCC, 2006, pp:808-813 [Conf]
  64. Joongseok Park, Sartaj Sahni
    Power Assignment For Symmetric Communication InWireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ISCC, 2006, pp:591-596 [Conf]
  65. Sartaj Sahni, Kun Suk Kim
    O(log n) dynamic packet routing. [Citation Graph (0, 0)][DBLP]
    ISCC, 2002, pp:443-448 [Conf]
  66. Sartaj Sahni
    Data Structures and Algorithms for Packet Forwarding and Classification. [Citation Graph (0, 0)][DBLP]
    ISPA, 2005, pp:1- [Conf]
  67. Sartaj Sahni
    Models and Algorithms for Optical and Optoelectronic Parallel Computers. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:2-9 [Conf]
  68. Sartaj Sahni, Kun Suk Kim, Haibin Lu
    Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:3-0 [Conf]
  69. Sartaj Sahni, Kun Suk Kim
    Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. [Citation Graph (0, 0)][DBLP]
    SAINT, 2002, pp:220-229 [Conf]
  70. Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya
    A Blocked All-Pairs Shortest-Path Algorithm. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:419-432 [Conf]
  71. F. Chen, Sartaj Sahni, Baba C. Vemuri
    Efficient Algorithms for Lossless Compression of 2D/3D Images. [Citation Graph (0, 0)][DBLP]
    VISUAL, 1999, pp:681-688 [Conf]
  72. Sartaj Sahni, Baba C. Vemuri, F. Chen, C. Kapoor
    Variable-Bit-Lengthn Coding: An Effective Coding Method. [Citation Graph (0, 0)][DBLP]
    VISUAL, 1999, pp:665-672 [Conf]
  73. Keumog Ahn, Sartaj Sahni
    Flipping Modules to Improve Circuit Performance and Routability. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1994, pp:127-132 [Conf]
  74. 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. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1993, pp:45-50 [Conf]
  75. Jayaram Bhasker, Sartaj Sahni
    A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:247-278 [Journal]
  76. Ten-Hwang Lai, Sartaj Sahni
    Anomalies in Parallel Branch-and-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:6, pp:594-602 [Journal]
  77. Andrew Lim, Sartaj Sahni
    Segmented Winner Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:1, pp:29-43 [Journal]
  78. Edward Y. C. Cheng, Sartaj Sahni
    Gate Resizing to Reduce Power Consumption. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:405-429 [Journal]
  79. Seonghun Cho, Sartaj Sahni
    A New Weight Balanced Binary Search Tree. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:485-513 [Journal]
  80. Seonghun Cho, Sartaj Sahni
    Mergeable Double-Ended Priority Queues. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:1-18 [Journal]
  81. Anuj Jain, Sartaj Sahni, Jatinder Palta, James Dempsey
    Partitioning 3d Phantoms Into Homogeneous Cuboids. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:905-932 [Journal]
  82. Haejae Jung, Sartaj Sahni
    Supernode Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:3, pp:465-490 [Journal]
  83. Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
    Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:4, pp:377-398 [Journal]
  84. Sanguthevar Rajasekaran, Sartaj Sahni
    Special Issue on Randomized Computing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:205- [Journal]
  85. Sartaj Sahni
    Models and Algorithms for Optical and Optoelectronic Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2001, v:12, n:3, pp:249-264 [Journal]
  86. Sartaj Sahni, Kun Suk Kim
    Efficient Dynamic Lookup For Bursty Access Patterns. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:567-591 [Journal]
  87. Sartaj Sahni, Kun Suk Kim, Haibin Lu
    Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:3, pp:337-358 [Journal]
  88. Sartaj Sahni, Chih-Fang Wang
    BPC Permutations on the OTIS-Hypercube Optoelectronic Computer. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 1998, v:22, n:3, pp:- [Journal]
  89. Teofilo F. Gonzalez, Sartaj Sahni
    Open Shop Scheduling to Minimize Finish Time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:4, pp:665-679 [Journal]
  90. Teofilo F. Gonzalez, Sartaj Sahni
    Preemptive Scheduling of Uniform Processor Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:92-101 [Journal]
  91. Ellis Horowitz, Sartaj Sahni
    Computing Partitions with Applications to the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:2, pp:277-292 [Journal]
  92. Ellis Horowitz, Sartaj Sahni
    On Computing the Exact Determinant of Matrices with Polynomial Entries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:1, pp:38-50 [Journal]
  93. David Nassimi, Sartaj Sahni
    An optimal routing algorithm for mesh-connected Parallel computers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:6-29 [Journal]
  94. David Nassimi, Sartaj Sahni
    Parallel permutation and sorting algorithms and a new generalized connection network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:642-667 [Journal]
  95. Sartaj Sahni
    Algorithms for Scheduling Independent Tasks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:116-127 [Journal]
  96. Sartaj Sahni, Yookun Cho
    Scheduling Independent Tasks with Due Times on a Uniform Processor System. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:550-563 [Journal]
  97. Sartaj Sahni, Teofilo F. Gonzalez
    P-Complete Approximation Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:555-565 [Journal]
  98. Ten-Hwang Lai, Sartaj Sahni
    Nearly On-Line Scheduling of Multiprocessor Systems with Memories. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:353-362 [Journal]
  99. Raghunath Raghavan, James Cohoon, Sartaj Sahni
    Single Bend Wiring. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:232-257 [Journal]
  100. Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Similarity Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:125-132 [Journal]
  101. Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Local Alignment Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:117-124 [Journal]
  102. Oscar H. Ibarra, Sartaj Sahni
    Hierarchies of Turing Machines with Restricted Tape Alphabet Size. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:11, n:1, pp:56-67 [Journal]
  103. Seonghun Cho, Sartaj Sahni
    Weight-Biased Leftist Trees and Modified Skip Lists. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:2- [Journal]
  104. Kyunrak Chong, Sartaj Sahni
    Correspondence-Based Data Structures for Double-Ended Priority Queues. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:2- [Journal]
  105. Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya
    A blocked all-pairs shortest-paths algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
  106. Kun Suk Kim, Sartaj Sahni
    IP Lookup by Binary Search on Prefix Length. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:105-128 [Journal]
  107. Allan Gottlieb, Kai Hwang, Sartaj Sahni
    Editorial Message. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:31, n:2, pp:99-100 [Journal]
  108. Allan Gottlieb, Kai Hwang, Sartaj Sahni
    Editorial Announcement. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:35, n:1, pp:1- [Journal]
  109. Jing-Fu Jenq, Sartaj Sahni
    Reconfigurable Mesh Algorithms for the Hough Transform. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:1, pp:69-77 [Journal]
  110. Jong Lee, Eugene Shragowitz, Sartaj Sahni
    A Hypercube Algorithm for the 0/1 Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1988, v:5, n:4, pp:438-456 [Journal]
  111. Madhusudan Nigam, Sartaj Sahni
    Sorting n Numbers on n x n Reconfigurable Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:37-48 [Journal]
  112. Sartaj Sahni
    Special Issue on Parallel Architectures and Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1988, v:5, n:4, pp:331-333 [Journal]
  113. Sanjay Ranka, Sartaj Sahni
    Image Template Matching on MIMD Hypercube Multicomputers. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:10, n:1, pp:79-84 [Journal]
  114. Sanjay Ranka, Sartaj Sahni
    String Editing on an SIMD Hypercube Multicomputer. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:9, n:4, pp:411-418 [Journal]
  115. Jing-Fu Fu Jenq, Sartaj Sahni
    Serial and Parallel Algorithms for the Medial Axis Transform. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1992, v:14, n:12, pp:1218-1224 [Journal]
  116. Sanjay Ranka, Sartaj Sahni
    Convolution on Mesh Connected Multicomputers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1990, v:12, n:3, pp:315-318 [Journal]
  117. Kam-Hoi Cheng, Sartaj Sahni
    VLSI systems for band matrix multiplication. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1987, v:4, n:3, pp:239-258 [Journal]
  118. Kam-Hoi Cheng, Sartaj Sahni
    VLSI architectures for back substitution. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:12, n:1, pp:53-69 [Journal]
  119. Kam-Hoi Cheng, Sartaj Sahni
    A new VLSI system for adaptive recursive filtering. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:10, n:1, pp:109-115 [Journal]
  120. Sanguthevar Rajasekaran, Sartaj Sahni
    Determinisitic Routing on the Array with Reconfigurable Optical Buses. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:3, pp:219-224 [Journal]
  121. Sartaj Sahni
    Data Manipulation on the Distributed Memory Bus Computer. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:3-14 [Journal]
  122. Yookun Cho, Sartaj Sahni
    Bounds for List Schedules on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:91-103 [Journal]
  123. Eliezer Dekel, David Nassimi, Sartaj Sahni
    Parallel Matrix and Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:657-675 [Journal]
  124. Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni
    Bounds for LPT Schedules on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:155-166 [Journal]
  125. Ellis Horowitz, Sartaj Sahni
    The Computation of Powers of Symbolic Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:2, pp:201-208 [Journal]
  126. Harry B. Hunt III, Robert L. Constable, Sartaj Sahni
    On the Computational Complexity of Program Scheme Equivalence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:396-416 [Journal]
  127. Ten-Hwang Lai, Sartaj Sahni
    Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:690-704 [Journal]
  128. Sartaj Sahni
    Computationally Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:4, pp:262-279 [Journal]
  129. Sartaj Sahni, Yookun Cho
    Nearly On Line Scheduling of a Uniform Processor System with Release Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:275-285 [Journal]
  130. Keumog Ahn, Sartaj Sahni
    NP-Hard Module Rotation Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:12, pp:1506-1510 [Journal]
  131. Jayaram Bhasker, Sartaj Sahni
    Via Assignment in Single-Row Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:1, pp:142-149 [Journal]
  132. Eliezer Dekel, Sartaj Sahni
    Binary Trees and Parallel Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:3, pp:307-315 [Journal]
  133. Andrew Lim, Siu-Wing Cheng, Sartaj Sahni
    Optimal Joining of Compacted Cells. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:5, pp:597-607 [Journal]
  134. Li-Shin Lin, Sartaj Sahni
    Maximum Alignment of Interchageable Terminals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:10, pp:1166-1177 [Journal]
  135. Lishin Lin, Sartaj Sahni
    Fair Edge Deletion Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:5, pp:756-761 [Journal]
  136. Haibin Lu, Sartaj Sahni
    O(log n) Dynamic Router-Tables for Prefixes and Ranges. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:10, pp:1217-1230 [Journal]
  137. Haibin Lu, Sartaj Sahni
    Enhanced Interval Trees for Dynamic IP Router-Tables. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:12, pp:1615-1628 [Journal]
  138. Haibin Lu, Sartaj Sahni
    A B-Tree Dynamic Router-Table Design. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:7, pp:813-824 [Journal]
  139. Dinesh P. Mehta, Sartaj Sahni
    A Data Structure for Circular String Analysis and Visualization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:8, pp:992-997 [Journal]
  140. Dinesh P. Mehta, Sartaj Sahni
    Computing Display Conflicts in String Visualization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:3, pp:350-361 [Journal]
  141. David Nassimi, Sartaj Sahni
    Bitonic Sort on a Mesh-Connected Parallel Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:1, pp:2-7 [Journal]
  142. David Nassimi, Sartaj Sahni
    Data Broadcasting in SIMD Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:2, pp:101-107 [Journal]
  143. David Nassimi, Sartaj Sahni
    A Self-Routing Benes Network and Parallel Permutation Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:5, pp:332-340 [Journal]
  144. David Nassimi, Sartaj Sahni
    Parallel Algorithms to Set Up the Benes Permutation Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:2, pp:148-154 [Journal]
  145. David Nassimi, Sartaj Sahni
    Optimal BPC Permutations on a Cube Connected SIMD Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:4, pp:338-341 [Journal]
  146. Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
    Deleting Vertices to Bound Path Length. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:9, pp:1091-1096 [Journal]
  147. Joongseok Park, Sartaj Sahni
    Maximum Lifetime Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:9, pp:1081-1090 [Journal]
  148. Joongseok Park, Sartaj Sahni
    An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:8, pp:1048-1056 [Journal]
  149. Raghunath Raghavan, Sartaj Sahni
    Single Row Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:3, pp:209-220 [Journal]
  150. Sartaj Sahni
    Scheduling Multipipeline and Multiprocessor Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:7, pp:637-645 [Journal]
  151. Sartaj Sahni
    Scheduling Master-Slave Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:10, pp:1195-1199 [Journal]
  152. Sartaj Sahni, Kun Suk Kim
    An O(log n) Dynamic Router-Table Design. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:3, pp:351-363 [Journal]
  153. Meongchul Song, Sartaj Sahni
    Approximation Algorithms for Multiconstrained Quality-of-Service Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:5, pp:603-617 [Journal]
  154. Chih-Fang Wang, Sartaj Sahni
    Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:7, pp:635-646 [Journal]
  155. Youngju Won, Sartaj Sahni, Yacoub M. El-Ziq
    A Hardware Accelerator for Maze Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:1, pp:141-145 [Journal]
  156. Kun Suk Kim, Sartaj Sahni
    Efficient Construction of Pipelined Multibit-Trie Router-Tables. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:1, pp:32-43 [Journal]
  157. Keumog Ahn, Sartaj Sahni
    Constrained via minimization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:2, pp:273-282 [Journal]
  158. Seonghun Cho, Sartaj Sahni
    Minimum area joining of compacted cells. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:7, pp:903-909 [Journal]
  159. Kyunrak Chong, Sartaj Sahni
    Minimizing total wire length by flipping modules. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:1, pp:167-175 [Journal]
  160. Kyunrak Chong, Sartaj Sahni
    Optimal realizations of floorplans [VLSI layout]. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:6, pp:793-801 [Journal]
  161. Sangyong Han, Sartaj Sahni
    Single-Row Routing in Narrow Streets. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1984, v:3, n:3, pp:235-241 [Journal]
  162. Wing Ning Li, Sartaj Sahni
    Pull up transistor folding. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:5, pp:512-521 [Journal]
  163. Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni
    On the circuit implementation problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:8, pp:1147-1156 [Journal]
  164. Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni
    Long and short covering edges in combination logic circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:12, pp:1245-1253 [Journal]
  165. Andrew Lim, Venkat Thanvantri, Sartaj Sahni
    Planar topological routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1997, v:16, n:6, pp:651-656 [Journal]
  166. Doowon Paik, Sartaj Sahni
    Optimal folding of bit sliced stacks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:11, pp:1679-1685 [Journal]
  167. San-Yuan Wu, Sartaj Sahni
    Covering rectilinear polygons by rectangles. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:4, pp:377-388 [Journal]
  168. Venkat Thanvantri, Sartaj Sahni
    Folding a stack of equal width components. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:6, pp:775-780 [Journal]
  169. Oscar H. Ibarra, Sartaj Sahni, Chul E. Kim
    Finite Automata with Multiplication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:271-294 [Journal]
  170. Venkat Thanvantri, Sartaj Sahni
    Optimal folding of standard and custom cells. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 1996, v:1, n:1, pp:123-143 [Journal]
  171. Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta
    An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:1, pp:60-64 [Journal]
  172. Haibin Lu, Sartaj Sahni
    Conflict detection and resolution in two-dimensional prefix router tables. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:6, pp:1353-1363 [Journal]
  173. Sartaj Sahni, Kun Suk Kim
    Efficient construction of multibit tries for IP lookup. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2003, v:11, n:4, pp:650-662 [Journal]
  174. Eliezer Dekel, Sartaj Sahni
    Parallel Generation of Postfix and Tree Forms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1983, v:5, n:3, pp:300-317 [Journal]
  175. Ju-wook Jang, Madhusudan Nigam, Viktor K. Prasanna, Sartaj Sahni
    Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:1, pp:1-12 [Journal]
  176. Jing-Fu Fu Jenq, Sartaj Sahni
    Image Shrinking and Expanding on a Pyramid. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:11, pp:1291-1296 [Journal]
  177. Madhusudan Nigam, Sartaj Sahni
    Sorting n2 Numbers on n×n Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:12, pp:1221-1225 [Journal]
  178. Sanguthevar Rajasekaran, Sartaj Sahni
    Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:11, pp:1123-1132 [Journal]
  179. Sanguthevar Rajasekaran, Sartaj Sahni
    Randomized Routing, Selection, and Sorting on the OTIS-Mesh. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:9, pp:833-840 [Journal]
  180. Sanjay Ranka, Sartaj Sahni
    Odd Even Shifts in SIMD Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1990, v:1, n:1, pp:77-82 [Journal]
  181. Sanjay Ranka, Sartaj Sahni
    Clustering on a Hypercube Multicomputer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:2, pp:129-137 [Journal]
  182. Sartaj Sahni
    Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:7, pp:720-728 [Journal]
  183. Sartaj Sahni
    The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:7, pp:739-748 [Journal]
  184. Chih-Fang Wang, Sartaj Sahni
    Image Processing on the OTIS-Mesh Optoelectronic Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:2, pp:97-109 [Journal]
  185. Chih-Fang Wang, Sartaj Sahni
    Basic Operations on the OTIS-Mesh Optoelectronic Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:12, pp:1226-1236 [Journal]
  186. Xiaochun Xu, Sartaj Sahni
    Approximation Algorithms for Sensor Deployment. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:12, pp:1681-1695 [Journal]
  187. Haibin Lu, Sartaj Sahni
    O(logW) multidimensional packet classification. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:462-472 [Journal]

  188. Topology Aggregation for E-science Networks. [Citation Graph (, )][DBLP]


  189. Bandwidth Allocation for Iterative Data-Dependent E-science Applications. [Citation Graph (, )][DBLP]


  190. A parallel matching algorithm for convex bipartite graphs. [Citation Graph (, )][DBLP]


  191. Parallel generation of the postfix form. [Citation Graph (, )][DBLP]


  192. Low Power TCAMs for Very Large Forwarding Tables. [Citation Graph (, )][DBLP]


  193. Succinct Representation Of Static Packet Classifiers. [Citation Graph (, )][DBLP]


  194. Recursively Partitioned Static IP Router-Tables. [Citation Graph (, )][DBLP]


  195. Performance evaluation of routing and wavelength assignment algorithms for optical networks. [Citation Graph (, )][DBLP]


  196. Highly compressed Aho-Corasick automata for efficient intrusion detection. [Citation Graph (, )][DBLP]


  197. In-advance path reservation for file transfers In e-Science applications. [Citation Graph (, )][DBLP]


  198. PETCAM-A power Efficient TCAM for forwarding tables. [Citation Graph (, )][DBLP]


  199. Sorting on a Cell Broadband Engine SPU. [Citation Graph (, )][DBLP]


  200. An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks. [Citation Graph (, )][DBLP]


  201. Sensor Deployment and Source Localization. [Citation Graph (, )][DBLP]


  202. Data Structures and Algorithms for Packet Forwarding and Classification. [Citation Graph (, )][DBLP]


  203. Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture. [Citation Graph (, )][DBLP]


Search in 0.049secs, Finished in 0.061secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002