Sartaj Sahni | Academic Influence

Sartaj Sahni's AcademicInfluence.com Rankings

Sartaj Sahni

Computer Science

#397

World Rank

#413

Historical Rank

#225

USA Rank

Database

#287

World Rank

#300

Historical Rank

#138

USA Rank

computer-science Degrees

Download Badge

Computer Science

Sartaj Sahni's Degrees

PhD Computer Science Cornell University
Masters Computer Science Cornell University

Similar Degrees You Can Earn

Why Is Sartaj Sahni Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.

(See a Problem?)

Sartaj Sahni's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

P-Complete Approximation Problems (1976) (1773)
Fundamentals of Computer Algorithms (1978) (1352)
Open Shop Scheduling to Minimize Finish Time (1976) (708)
Fundamentals of Data Structures (1984) (640)
Algorithms for Scheduling Independent Tasks (1976) (568)
Computing Partitions with Applications to the Knapsack Problem (1974) (548)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors (1976) (437)
Flowshop and Jobshop Schedules: Complexity and Approximation (1978) (426)
Parallel Matrix and Graph Algorithms (1981) (391)
Computationally Related Problems (1974) (381)
Approximate Algorithms for the 0/1 Knapsack Problem (1975) (367)
Fundamentals of data structures in C (1976) (351)
Anomalies in parallel branch-and-bound algorithms (1984) (297)
Data broadcasting in SIMD computers (1981) (270)
Bounds for LPT Schedules on Uniform Processors (1977) (268)
Polynomially Complete Fault Detection Problems (1975) (265)
Bitonic Sort on a Mesh-Connected Parallel Computer (1979) (260)
Handbook of Data Structures and Applications (2004) (235)
Preemptive Scheduling of Uniform Processor Systems (1978) (227)
Fundamentals of Data Structures in Pascal (1984) (226)
Parallel permutation and sorting algorithms and a new generalized connection network (1982) (219)
A Self-Routing Benes Network and Parallel Permutation Algorithms (1981) (210)
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer (1980) (198)
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (2014) (197)
Leaf sequencing algorithms for segmented multileaf collimation. (2003) (186)
An online heuristic for maximum lifetime routing in wireless sensor networks (2006) (181)
On path selection in combinational logic circuits (1988) (179)
Parallel Algorithms to Set Up the Benes Permutation Network (1982) (174)
Simulated Annealing and Combinatorial Optimization (1986) (162)
Analysis of Algorithms (2004) (156)
Optimal BPC Permutations on a Cube Connected SIMD Computer (1982) (149)
Computer Algorithms / C++ (2007) (147)
An optimal routing algorithm for mesh-connected Parallel computers (1980) (137)
Complexity of Scheduling Shops with No Wait in Process (1979) (125)
A linear algorithm to find a rectangular dual of a planar triangulated graph (1986) (124)
Data Structures, Algorithms, and Applications in C++ (1997) (122)
Bounds for List Schedules on Uniform Processors (1980) (121)
Data Structures, Algorithms and Applications in Java (1998) (120)
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (2011) (118)
General Techniques for Combinatorial Approximation (1977) (117)
Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs (1990) (107)
Sorting n numbers on n*n reconfigurable meshes with buses (1993) (106)
A blocked all-pairs shortest-paths algorithm (2003) (100)
Basic operations on the OTIS-Mesh optoelectronic computer (1998) (96)
Algorithms for Wireless Sensor Networks (2005) (95)
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops (1981) (94)
The Complexity of Design Automation Problems (1980) (93)
Two techniques for fast computation of constrained shortest paths (2004) (92)
Approximation Algorithms for Sensor Deployment (2007) (85)
Matrix multiplication on the OTIS-Mesh optoelectronic computer (1999) (83)
Binary Trees and Parallel Scheduling Algorithms (1981) (82)
Preemptive Scheduling with Due Dates (1979) (81)
Performance metrics: keeping the focus on runtime (1996) (78)
Efficient construction of multibit tries for IP lookup (2003) (77)
A Hypercube Algorithm for the 0/1 Knapsack Problem (1988) (74)
Randomized Routing, Selection, and Sorting on the OTIS-Mesh (1998) (73)
On the circuit implementation problem (1992) (71)
Maximum lifetime broadcasting in wireless networks (2005) (71)
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses (1997) (71)
Handbook Of Data Structures And Applications (Chapman & Hall/Crc Computer and Information Science Series.) (2004) (70)
Image Processing on the OTIS-Mesh Optoelectronic Computer (2000) (68)
An efficient motion estimator with application to medical image registration (1998) (67)
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (1987) (66)
Parallel Scheduling Algorithms (1983) (64)
Experiments with Simulated Annealing (1985) (63)
Programming a hypercube multicomputer (1988) (63)
A parallel matching algorithm for convex bipartite graphs and applications to scheduling (1984) (62)
Data structures for one-dimensional packet classification using most-specific-rule matching (2002) (60)
Low-Power TCAMs for Very Large Forwarding Tables (2008) (60)
Efficient Construction of Pipelined Multibit-Trie Router-Tables (2007) (57)
Reconfigurable Mesh Algorithms for the Hough Transform (1994) (57)
All Pairs Shortest Paths on a Hypercube Multiprocessor (1987) (54)
Scheduling Independent Tasks with Due Times on a Uniform Processor System (1980) (52)
Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching (1991) (51)
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks (2007) (51)
Hypercube Algorithms: with Applications to Image Processing and Pattern Recognition (1990) (50)
P-Complete Problems and Approximate Solutions (1974) (49)
Strassen's Matrix Multiplication on GPUs (2011) (48)
On Computing the Exact Determinant of Matrices with Polynomial Entries (1975) (48)
Optimal leaf sequencing with elimination of tongue-and-groove underdosage. (2004) (47)
String correction using the Damerau-Levenshtein distance (2019) (47)
Single Row Routing (1983) (47)
The master-slave paradigm in parallel computer and industrial settings (1996) (46)
Nearly On Line Scheduling of a Uniform Processor System with Release Times (1979) (46)
GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU (2013) (46)
Algorithms for optimal sequencing of dynamic multileaf collimators. (2004) (46)
Image Template Matching on MIMD Hypercube Multicomputers (1990) (45)
An O(logn) dynamic router-table design (2004) (44)
Clustering on a hypercube multicomputer (1990) (42)
Performance enhancement through the generalized bypass transform (1991) (42)
Packet classification consuming small amount of memory (2005) (42)
Localization under random measurements with application to radiation sources (2008) (42)
Fast algorithm for polygon decomposition (1988) (41)
Efficient construction of variable-stride multibit tries for IP lookup (2002) (41)
Multipattern string matching on a GPU (2011) (41)
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh (1997) (41)
Maze Routing on a Hypercube Multiprocessor Computer (1987) (40)
Serial and parallel algorithms for the medial axis transform (1992) (40)
Finite Automata with Multiplication (1976) (40)
High Performance Computing — HiPC 2002 (2002) (40)
On the Computational Complexity of Scheme Equivalence (1974) (39)
Network upgrading problems (1995) (39)
Hypercube algorithms for image processing and pattern recognition (1990) (39)
Single Bend Wiring (1986) (38)
Conflict detection and resolution in two-dimensional prefix router tables (2005) (37)
Parallel Generation of Postfix and Tree Forms (1983) (37)
Scheduling Master-Slave Multiprocessor Systems (1995) (37)
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests (1977) (35)
Optional linear arrangement of circuit components (1987) (35)
The complexity of single row routing (1984) (33)
BPC Permutations on the OTIS-Hypercube Optoelectronic Computer (1998) (32)
O(logW) multidimensional packet classification (2007) (31)
Multicore and GPU algorithms for Nussinov RNA folding (2014) (31)
Combinatorial Problems: Reductibility and Approximation (1978) (31)
Enhanced interval trees for dynamic IP router-tables (2004) (31)
Power-aware routing in sensor networks (2005) (30)
O(log n) Dynamic Router-Tables for Prefixes and Ranges (2004) (30)
Information Systems, Technology and Management - Third International Conference, ICISTM 2009, Ghaziabad, India, March 12-13, 2009. Proceedings (2009) (28)
Efficient construction of fixed-stride multibit tries for IP lookup (2001) (28)
Approximation algorithms for multiconstrained quality-of-service routing (2006) (28)
Scheduling Multipipeline and Multiprocessor Computers (1984) (28)
DUOS - Simple dual TCAM architecture for routing tables with incremental update (2010) (27)
Otis Optoelectronic Computers (1998) (27)
Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components (1991) (27)
PETCAM—A Power Efficient TCAM Architecture for Forwarding Tables (2012) (27)
A Hardware Accelerator for Maze Routing (1987) (25)
Image Shrinking and Expanding on a Pyramid (1993) (25)
Parallel processing techniques for the processing of synthetic aperture radar data on FPGAs (2010) (24)
A comparison of step-and-shoot leaf sequencing algorithms that eliminate tongue-and-groove effects. (2004) (24)
Models and algorithms for optical and optoelectronic parallel computers (2001) (24)
PMS6: A fast algorithm for motif discovery (2014) (23)
Efficient Algorithms for Local Alignment Search (2001) (23)
Optimal field splitting for large intensity-modulated fields. (2004) (23)
Packet Forwarding Using Pipelined Multibit Tries (2006) (23)
O(log n) dynamic packet routing (2002) (23)
Prefix and interval-partitioned dynamic IP router-tables (2005) (23)
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks (2008) (23)
Models and algorithms for optical and optoelectronic parallel computers (1999) (23)
Constrained via minimization (1993) (22)
Some Related Problems from Network Flows, Game Theory and Integer Programming (1972) (22)
String Editing on an SIMD Hypercube Multicomputer (1990) (22)
A computational geometry method for localization using differences of distances (2010) (22)
Efficient Dynamic Lookup For Bursty Access Patterns (2004) (22)
A computational geometry method for DTOA triangulation (2007) (22)
Single-Row Routing in Narrow Streets (1984) (22)
Parallel processing techniques for the processing of synthetic aperture radar data on GPUs (2011) (22)
Pairwise sequence alignment for very long sequences on GPUs (2012) (21)
Efficient serial and parallel algorithms for median filtering (1991) (21)
Deleting Vertices to Bound Path Length (1994) (21)
Highly compressed Aho-Corasick automata for efficient intrusion detection (2008) (21)
Succinct Representation of Static Packet Classifiers (2007) (20)
Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network (2000) (20)
Offline preemptive scheduling of power demands to minimize peak power in smart grids (2014) (20)
$O(\log W)$ Multidimensional Packet Classification (2007) (20)
Histogramming on a reconfigurable mesh computer (1992) (20)
Weight-biased leftist trees and modified skip lists (1998) (20)
A B-tree dynamic router-table design (2004) (20)
Fast in-Place File Carving for Digital Forensics (2010) (19)
Covering rectilinear polygons by rectangles (1990) (19)
In-advance path reservation for file transfers in e-science applications (2012) (18)
Fast Algorithms to Partition Simple Rectilinear Polygons (1994) (18)
Optimal Single Row Router (1982) (18)
Concepts in discrete mathematics (1981) (18)
Cache and energy efficient algorithms for Nussinov’s RNA Folding (2017) (17)
Unified mathematical programming frameworks for survivable logical topology routing in IP-over-WDM optical networks (2014) (17)
On the Computational Complexity of Program Scheme Equivalence (1980) (17)
Parallel Computing: Performance Metrics and Models (1995) (17)
Optimal realizations of floorplans [VLSI layout] (1993) (17)
Convolution on Mesh Connected Multicomputers (1990) (17)
Dynamic Tree Bitmap for IP Lookup and Update (2007) (17)
Cross-layer network survivability under multiple cross-layer metrics (2015) (16)
Improved SPRT detection using localization with application to radiation sources (2009) (16)
IP lookup by binary search on prefix length (2002) (16)
The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations (2000) (16)
PMS6: A Fast Algorithm for Motif Discovery. (2012) (16)
Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set (2012) (16)
Multicore and GPU algorithms for Nussinov RNA folding (2013) (16)
PETCAM-A power Efficient TCAM for forwarding tables (2009) (16)
Dual criteria preemptive open‐shop problems with minimum makespan (1995) (16)
Generalized field-splitting algorithms for optimal IMRT delivery efficiency (2007) (16)
Computing biconnected components on a hypercube (1990) (16)
PC-DUOS: Fast TCAM lookup and update for packet classifiers (2011) (16)
Enhancing Availability in Content Delivery Networks for Mobile Platforms (2015) (16)
Approximation Algorithms For Wireless Sensor Deployment (2006) (15)
Load balancing on a hypercube (1991) (15)
GRS — GPU radix sort for multifield records (2010) (15)
A B-tree dynamic router-table design (2005) (15)
A Blocked All-Pairs Shortest-Path Algorithm (2000) (15)
Layering Algorithms for Single Row Routing (1985) (14)
On basic properties of localization using distance-difference measurements (2008) (14)
Network Topology Optimization for Data Aggregation (2014) (14)
Algorithms for the otis optoelectronic computer (1998) (14)
PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers (2015) (14)
Hypercube Algorithms for Image Transformations (1989) (13)
Computational Geometry on a Reconflgurable Mesh (1994) (13)
Smart grid power scheduling via bottom left decreasing height packing (2016) (13)
Power Assignment for Symmetric Communication in Wireless Sensor Networks (2006) (13)
Sorting n2 Numbers on n×n Meshes (1995) (13)
Minimum-cost sensor coverage of planar regions (2008) (13)
Reconfigurable Mesh Algorithms For Fundamental Data Manipulation Operations (1993) (12)
GPU Matrix Multiplication (2013) (12)
A Systolic Design-Rule Checker (1987) (12)
Recursively Partitioned Static IP Router Tables (2007) (12)
State of the Art Lossless Image Compression Algorithms (2007) (12)
Hypercube-to-host sorting (1989) (12)
Data Manipulation on the Distributed Memory Bus Computer (1995) (12)
Heuristics for backplane ordering (1987) (11)
Offline first fit scheduling in smart grids (2015) (11)
Optimal Preemptive Scheduling of Two Unrelated Processors (1990) (11)
A Time and Space Efficient Net Extractor (1986) (11)
Hierarchies of Turing Machines with Restricted Tape Alphabet Size (1975) (11)
Minimizing Total Wire Length By Flipping Modules (1992) (11)
Information Intelligence, Systems, Technology and Management - 5th International Conference, ICISTM 2011, Gurgaon, India, March 10-12, 2011. Proceedings (2011) (11)
Computer Algorithms in Pseudocode: The Human Dimension (1997) (11)
Efficient Algorithms for Similarity Search (2001) (11)
Packet classification using two-dimensional multibit tries (2005) (11)
Performance evaluation of routing and wavelength assignment algorithms for optical networks (2008) (11)
Highly compressed multi-pattern string matching on the cell broadband engine (2011) (10)
PPVC: Privacy Preserving Voronoi Cell for location-based services (2017) (10)
Pubsub: An Efficient Publish/Subscribe System (2013) (10)
Two NP-hard interchangeable terminal problems (1988) (10)
On The Knapsack And Other Computationally Related Problems (1973) (10)
Pairwise sequence alignment for very long sequences on GPUs. (2014) (10)
VLSI systems for band matrix multiplication (1987) (9)
Odd Even Shifts in SIMD Hypercubes (1990) (9)
Packet Classification Using Pipelined Two-Dimensional Multibit Tries (2006) (9)
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits (1998) (9)
Computing Display Conflicts in String Visualization (1994) (9)
Techniques for mapping synthetic aperture radar processing algorithms to multi-GPU clusters (2012) (9)
Workflow scheduling in e-Science networks (2011) (9)
Mergeable Double-Ended Priority Queues (1999) (9)
Computational geometry on the OTIS-Mesh optoelectronic computer (2002) (9)
Supernode Binary Search Trees (2003) (9)
Long and short covering edges in combination logic circuits (1990) (9)
Parallel algorithms for image template matching (1990) (9)
DUO – Dual TCAM Architecture for Routing Tables with Incremental Update ∗ (2010) (9)
Sorting large records on a cell broadband engine (2010) (8)
On the circuit implementation problem (combinatorial logic circuits) (1992) (8)
PC-DUOS+: A TCAM Architecture for Packet Classifiers (2014) (8)
The Computation of Powers of Symbolic Polynomials (1975) (8)
A New Weight Balanced Binary Search Tree (2000) (8)
Maximum Alignment of Interchageable Terminals (1988) (8)
Models and techniques for the visualization of labeled discrete objects (1992) (8)
Sorting n/sup 2/ numbers on n*n meshes (1993) (8)
PUBSUB: An efficient publish/subscribe system (2015) (8)
Packet Classification Using Space-Efficient Pipelined Multibit Tries (2008) (8)
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (1984) (8)
Dynamic Data-Driven SAR Image Reconstruction Using Multiple GPUs (2018) (8)
Optimal Joining of Compacted Cells (1993) (8)
A balanced bin sort for hypercube multicomputers (1988) (7)
Dynamic IP router-tables using highest-priority matching (2004) (7)
Consistent Updates for Packet Classifiers (2012) (7)
Efficient net extraction for restricted orientation designs [VLSI layout] (1996) (7)
Algorithms for physical design of `sea-of-gates' chips (1988) (7)
A Systolic Design Rule Checker (1984) (7)
SU‐CC‐J‐6C‐06: A Generalized Field Splitting Algorithm for Optimal IMRT Delivery Efficiency (2005) (7)
Via Assignment in Single-Row Routing (1989) (7)
Heuristics for the Circuit Realization Problem (1983) (7)
Fair Edge Deletion Problems (1989) (7)
A framework for rendering high resolution synthetic aperture radar images on heterogeneous architectures (2014) (7)
Correspondence-based data structures for double-ended priority queues (2000) (7)
The Master-Slave Scheduling Model (2004) (6)
Heuristics for the placement of flip-flops in partial scan designs and the placement of signal boosters in lossy circuits (1993) (6)
(log n) dynamic router-tables for ranges (2003) (6)
Fundamentals of Computer Alori (1978) (6)
Nearly On-Line Scheduling of Multiprocessor Systems with Memories (1983) (6)
Dynamic data driven image reconstruction using multiple GPUs (2016) (6)
Software Development in Pascal (1985) (6)
A Fast Algorithm for Transistor Folding (2001) (6)
Dynamic Packet Routing (2002) (6)
Place-router for “Sea-of Gates” design style (1990) (6)
IP Router Tables (2004) (5)
Scheduling for distributed computing (1997) (5)
Partitioning 3d Phantoms Into Homogeneous Cuboids (2003) (5)
A Data Structure for Circular String Analysis and Visualization (1993) (5)
Succinct Representation of Static Packet Forwarding Tables (2007) (5)
CONSIST-Consistent Internet route updates (2010) (5)
PMS6MC: A multicore algorithm for motif discovery (2013) (5)
Sorting on a Cell Broadband Engine SPU (2009) (5)
Sorting Large Multifield Records on a GPU (2011) (5)
Network topology optimization for data aggregation with splitting (2014) (5)
Fast Update Algorithm for IP Forwarding Table Using Independent Sets (2004) (5)
VLSI Architectures for the Finite Impulse Response Filter (1986) (5)
Flipping modules to minimize maximum wire length (1991) (5)
Fundamental Algorithms for the Array with Reconfigurable Optical Buses (1998) (5)
Triangulation on a Reconfigurable Mesh with Buses (1994) (5)
Offline first-fit decreasing height scheduling of power loads (2017) (5)
Parallel Dynamic Data Driven Approaches for Synthetic Aperture Radar (2017) (4)
Systolic algorithm for rectilinear polygons (1987) (4)
Data Structures and Algorithms for Packet Forwarding and Classification (2005) (4)
Two-aggregator network topology optimization with splitting (2015) (4)
Optimal Alignment of Three Sequences On A GPU (2014) (4)
A fast algorithm for VLSI net extraction (1993) (4)
NP-Hard Module Rotation Problems (1993) (4)
Planar topological routing (1997) (4)
Flipping modules to improve circuit performance and routability (1994) (4)
A Hypecube Algorithm for the 0/1 Knapsack Problem (1987) (4)
Efficient 2D Multibit Tries for Packet Classification (2009) (4)
Proceedings of the 2nd IASTED international conference on Advances in computer science and technology (2006) (4)
Cache and energy efficient alignment of very long sequences (2015) (4)
Optimal folding of bit sliced stacks (1993) (3)
Efficient Algorithms for Lossless Compression of 2D/3D Images (1999) (3)
PC-TRIO: An indexed TCAM architecture for packet classifiers (2012) (3)
Weight Biased Leftist Trees and Modified Skip Lists (1996) (3)
An efficient approximate algorithm for the Kolmogorov—Smirnov and Lilliefors tests † (1978) (3)
Manhattan and Rectilinear Wiring* (3)
Hypercube computing: Connected components (1989) (3)
Offline Preemptive Scheduling of Jobs in Smart Grids * (2014) (3)
‘ Review of Radix Sort & Proposed Modified Radix Sort for Heterogeneous Data Set in Distributed Computing Environment ’ (2012) (3)
Preemptive Scheduling of Uniform Processors with Memory. (1982) (3)
Determinisitic Routing on the Array with Reconfigurable Optical Buses (1997) (3)
Maze routing on a hypercube multicomputer (1988) (3)
Host-to hypercube sorting (1989) (3)
Recursively Partitioned Static IP Router-Tables (2010) (3)
Upgrading Circuit Modules To Improve Performance (2009) (3)
Linear space string correction algorithm using the Damerau-Levenshtein distance (2018) (3)
In-advance path reservation for file transfers in e-science applications (2009) (3)
Network topology optimisation for data aggregation using multiple paths (2015) (3)
Sorting n 2 Numbers on n x n Meshes. (1993) (3)
IASTED International Conference on Advances in Computer Science and Technology, January 23-25, 2006, Puerto Vallarta, Mexico (2006) (2)
Parallel syntenic alignment on GPUs (2012) (2)
Green TCAM-Based Internet Routers (2012) (2)
Matrix Multiplication on the (2001) (2)
Parallel generation of the postfix form (1982) (2)
Data structures for dynamic router table (2003) (2)
Upgrading Vertices In Trees, Series-Parallel Digraphs And General Series-Parallel Digraphs To Bound Path Length+ (2009) (2)
Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects (1997) (2)
Computing Display Conflicts in String and Circular String Visualization (1992) (2)
Sorting n/sup 2/ numbers on n/spl times/n meshes (1995) (2)
Scheduling algorithms for energy minimization (2008) (2)
Algorithms for sequencing multileaf collimators (2005) (2)
The DMBC: architecture and fundamental operations (1995) (2)
An Effective Data Structure for Contact Sequence Temporal Graphs (2021) (2)
Modified Pure Radix Sort for Large Heterogeneous Data Set (2012) (2)
Pull up transistor folding (1990) (2)
Two-Aggregator Topology Optimization Using Multiple Paths in Data Center Networks (2019) (2)
Bandwidth Allocation for Iterative Data-Dependent E-science Applications (2010) (2)
A Robust and Efficient Algorithm for Image Registration (1997) (2)
Double-Ended Priority Queues (2018) (2)
VLSI Systems For Matrix Multiplication (1985) (2)
Fundamentals of data structures in turbo PASCAL for the IBM PC (1988) (2)
Via Assignment in Single Row Routing (1986) (2)
A fast algorithm to test planar topological routability (1995) (2)
Preemptive Scheduling of a Multiprocessor System with Memories To Minimize L(MAX). (1981) (2)
Cache and energy efficient algorithms for Nussinov’s RNA Folding (2016) (2)
Optimal folding of standard and custom cells (1996) (2)
Fund of Data Structures Pascal: II (1994) (1)
Sorting On A Graphics Processing Unit (GPU) (2013) (1)
Hardware algorithm for net extraction (1987) (1)
Data Structures For IP Lookup With Bursty Access Patterns (1)
Optical and Optoelectronic Interconnection Networks (2001) (1)
eInfrastructure for Outcome and Comparative Effectiveness Research in Radiation Oncology (2010) (1)
Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel (2000) (1)
Reliable and Efficient Image Registration (1997) (1)
Cache efficient Value Iteration using clustering and annealing (2020) (1)
SIMD Matrix Multiplication (1990) (1)
Optimal Sequencing of Dynamic Multileaf Collimators (2003) (1)
Segmented winner trees (1992) (1)
Efficient RNA folding using Zuker's method (2017) (1)
VLSI architectures for back substitution (1989) (1)
Image Processing On Reconfigurable Meshes With Buses (1994) (1)
Wavelength scheduling in Time-domain Wavelength Interleaved Networks (2011) (1)
Prefix- and interval-partitioned router-tables [IP routing] (2004) (1)
First-Slot scheduling with wavelength conversion for distributed file transfers (2010) (1)
Efficient computation of the Damerau-Levenshtein distance between biological sequences (2017) (1)
Enhanced heuristic for multichannel optimization in gate array layout (1989) (1)
Multiobjective Optimization of SAR Reconstruction on Hybrid Multicore Systems (2020) (1)
Proceedings of the 1987 International Conference on Parallel Processing, August 17-21, 1987 (1987) (1)
A New Approach to the Function and Technique of Global Routing (1)
Parallel solutions for design automation problems (1987) (1)
Variable-Bit-Lengthn Coding: An Effective Coding Method (1999) (1)
Backprojection algorithms for multicore and GPU architectures (2012) (1)
----ODD EVEN SHIFTS IN SIMD HYPERCUBES 1 (1)
Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, April 2-4, 2007, Phuket, Thailand (2007) (1)
On the Computation of Powers of a Class of Polynomials (1972) (1)
Cache Efficient Value Iteration (2019) (1)
Integration of salicylic acid, vermicompost and bioagent for effective management of chickpea wilt disease (2021) (1)
Network Centered Multiple Resource Scheduling in e-Science Applications (2009) (1)
One-Dimensional Packet Classification Using Pipelined Multibit Tries (2005) (1)
Computing and combinatorics : 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 : proceedings (2010) (1)
First-Slot Scheduling with Wavelength Conversion for e-Science Applications (2009) (1)
A new VLSI system for adaptive recursive filtering (1989) (1)
VLSI Artchitectures for Back Substitution (1986) (1)
Sheng Yu (2012) (1)
Cache Efficient Louvain with Local RCM (2020) (1)
Algorithms for optimal min hop and foremost paths in interval temporal graphs (2021) (1)
Jing-fu Jenq (1994) (0)
Data structures for efficient packet classification (2007) (0)
Constant Time Computational Geometry On Reconfigurable Meshes With Buses (2007) (0)
10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08 (2008) (0)
Prefix and Interval-Partitioned Dynamic (2005) (0)
VLSI Systems For Design Rule Checks (1984) (0)
Network and Parallel Computing (2014) (0)
Energy Aware Time Change Detection using Synthetic Aperture Radar on High-Performance Heterogeneous Architectures: A DDDAS Approach (2020) (0)
String correction using the Damerau-Levenshtein distance (2019) (0)
Rounding, Interval Partitioning and Separation (2018) (0)
Efficient hypercube algorithms (1989) (0)
Message from the general co-chairs (2014) (0)
Message from the Chairs (2015) (0)
Performance and Energy Evaluation of SAR Reconstruction on Intel Knights Landing (2018) (0)
Brief Con t r i but i ons Scheduling Master-Slave (1996) (0)
Rounding, Interval Partitioning, and Separation (2007) (0)
Sorting and Selection on Distributed Memory Bus Computers (1996) (0)
Proceedings of the 9th International Conference on High Performance Computing (2002) (0)
Algorithms for optimal min hop and foremost paths in interval temporal graphs (2022) (0)
Algorithms for multiconstrained quality-of-service paths and restoration (2005) (0)
Flipping Modules to Minimize (1995) (0)
Topology Aggregation for E-science Networks (2010) (0)
Programming Constructs for Exascale Computing in Support of Space Situational Awareness (2013) (0)
Proceedings of the IASTED International Conference on Computer Science and Technology, May 19-21, 2003, Cancun, Mexico (2003) (0)
Algorithms for sensor coverage and sensor localization problems in wireless sensor networks (2008) (0)
Folding A Stack Of Equal Width Components (1994) (0)
Sensor Deployment and Source Localization (2008) (0)
Computing Hough transforms on hypercube multicomputers (1990) (0)
Contributing authors (2004) (0)
Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, November 22-24, 2004, St. Thomas, US Virgin Islands (2004) (0)
Foremost Walks and Paths in Interval Temporal Graphs (2022) (0)
Energy-Efficient High-Performance Routers (2012) (0)
Two-aggregator topology optimization without splitting in data center networks (2017) (0)
IEEE ISSPIT 2013: Message from the TPC chairs (2013) (0)
Proceedings of the 16th annual international conference on Computing and combinatorics (2010) (0)
Gate Resizing to Reduce Power Consumption (2002) (0)
Data structures for static and dynamic router tables (2003) (0)
Data Structures And Algorithms For Packet Forwarding And Classification Keynote Presentation (2009) (0)
Software Development in C (1995) (0)
Special Issue on Randomized Computing (2000) (0)
GPU alignment of two and three sequences (2017) (0)
Fine Tuning the Performance of Parallel Codes (2020) (0)
Two-Aggregator Topology Optimization Using Single Paths in Data Center Networks (2021) (0)
Min-Hop Foremost Paths in Interval Temporal Graphs (2022) (0)
A Framework for Matching Applications with Parallel Machines (1999) (0)
Offline First Fit Scheduling of Power Demands in Smart Grids ∗ (2015) (0)
Packet Classification Using Pipelined Multibit Tries (2006) (0)
Multilevel Approaches to Fine Tune Performance of Linear Algebra Libraries (2019) (0)
Reconfigurable meshes and image processing (1994) (0)
The Placement Of Signal 8 oosters In Lossy Circuits (1993) (0)
Efficient Computation of RNA Partition Functions Using McCaskill’s Algorithm (2020) (0)
EJ~ERIMENTS WITH SIMULATED ANNEALING* (1985) (0)
Efficient algorithms and data structures for vlsi cad (1996) (0)
Leftist Trees (2004) (0)
Computing and Combinatorics (1995) (0)
Value Iteration on Multicore Processors (2020) (0)
Manyscale Computing for Sensor Processing in Support of Space Situational Awareness (2014) (0)
Context and Content Aware Routing of Managed Information Objects (2014) (0)
Dynamic Data Driven SAR Reconstruction on Hybrid Multicore systems (2018) (0)
Data structures and algorithms for packet forwarding: prof. A.K. Choudhury memorial lecture (2010) (0)
Layout techniques for phase correct and gridded wiring (2006) (0)
PDCAT 2014 Organizing Committee (2014) (0)
Properties of Localization Using Distance-Differences (2008) (0)
NTU Computer Science Program (1986) (0)
A Pipelined Architecture for Maze Routing (1988) (0)
Image Compression: Lossless (2015) (0)
Special Issue on Parallel Architectures and Algorithms (1988) (0)
Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology (2008) (0)
DESIGN AND IMPLEMENTATION OF AN OBJECT-ORIENTED GEOMETRIC CONSTRAINT SOLVER By JIANJUN OUNG A THESIS PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE UNIVERSITY OF FLORIDA (2001) (0)
Randomized graph data-structures for approximate shortest path problem (2004) (0)
A Termination Detection Technique Using Gossip in Cloud Computing Environments (2018) (0)
Compact Multiplicative Inverter for Hardware Elliptic Curve Cryptosystem (2018) (0)
Efficient Alignment of Very Long Sequences (2018) (0)
Technical Reports 21-30, 1984 (1984) (0)
Optical Transpose Systems (2007) (0)
Editorial Announcement (2003) (0)
In Memoriam Eliezer Dekel (1948-2020) (2020) (0)
A Fast Algorithm for Performance-Driven Module Implementation Selection (1999) (0)
Dynamic Router-Tables For Ranges (2003) (0)
One Dimensional Convolution (1990) (0)
Dynamic multistatic synthetic aperture radar (DMSAR) with image reconstruction algorithms and analysis (2013) (0)
Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture (2010) (0)
Proceedings of the Forth IASTED International Conference on Advances in Computer Science and Technology, April 2-4, 2008, Langkawi, Malaysia (2008) (0)
Minimum area joining of compacted cells (1995) (0)
SIMD String Editing (1990) (0)
Editorial Message (1995) (0)
Offline preemptive bottom left decreasing height scheduling of power loads in smart grids (2021) (0)
Algorithms for external beam dose computation (2000) (0)
Offline first-fit decreasing height scheduling of power loads (2017) (0)
Efficient Net Extraction for Restricted Orientation Designs [Short Paper] - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on (2004) (0)

This paper list is powered by the following services:

Other Resources About Sartaj Sahni

en.wikipedia.org

What Schools Are Affiliated With Sartaj Sahni?

Sartaj Sahni is affiliated with the following schools:

Image Attributions

Image Source for Sartaj Sahni