#10,151

Most Influential Person

Indian computer scientist, a specialist in data structures

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.

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

This paper list is powered by the following services:

Sartaj Sahni is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.