Sartaj Sahni

According to our database1, Sartaj Sahni authored at least 313 papers between 1972 and 2019.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1996, "For contributions to data structures, design and analysis of algorithms, multiprocessor scheduling, electronic computer aided design, and parallel computing.".

IEEE Fellow

IEEE Fellow 1988, "For contributions to computer algorithms, computer-aided design, and large-scale systems.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Two-Aggregator Topology Optimization Using Multiple Paths in Data Center Networks.
IEEE Trans. Cloud Computing, 2019

String correction using the Damerau-Levenshtein distance.
BMC Bioinformatics, 2019

Cache Efficient Value Iteration.
Proceedings of the 2019 IEEE Symposium on Computers and Communications, 2019

2018
Dynamic Data-Driven SAR Image Reconstruction Using Multiple GPUs.
IEEE J Sel. Topics in Appl. Earth Observ. and Remote Sensing, 2018

Linear Space String Correction Algorithm Using The Damerau-Levenshtein Distance.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Dynamic Data Driven SAR Reconstruction on Hybrid Multicore systems.
Proceedings of the Ninth International Green and Sustainable Computing Conference, 2018

Performance and Energy Evaluation of SAR Reconstruction on Intel Knights Landing.
Proceedings of the Ninth International Green and Sustainable Computing Conference, 2018

Rounding, Interval Partitioning and Separation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Offline first-fit decreasing height scheduling of power loads.
J. Scheduling, 2017

Cache and energy efficient algorithms for Nussinov's RNA Folding.
BMC Bioinformatics, 2017

Two-aggregator topology optimization without splitting in data center networks.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

PPVC: Privacy Preserving Voronoi Cell for location-based services.
Proceedings of the 2017 International Conference on Computing, 2017

Efficient RNA folding using Zuker's method.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017

Efficient computation of the Damerau-Levenshtein distance between biological sequences.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017

Parallel Dynamic Data Driven Approaches for Synthetic Aperture Radar.
Proceedings of the 24th IEEE International Conference on High Performance Computing, 2017

2016
Announcement.
Int. J. Found. Comput. Sci., 2016

Dynamic data driven image reconstruction using multiple GPUs.
Proceedings of the 2016 IEEE International Symposium on Signal Processing and Information Technology, 2016

Smart grid power scheduling via bottom left decreasing height packing.
Proceedings of the IEEE Symposium on Computers and Communication, 2016

Cache and energy efficient algorithms for Nussinov RNA folding.
Proceedings of the 6th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2016

2015
Enhancing Availability in Content Delivery Networks for Mobile Platforms.
IEEE Trans. Parallel Distrib. Syst., 2015

PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers.
IEEE Trans. Computers, 2015

Pubsub: An Efficient Publish/Subscribe System.
IEEE Trans. Computers, 2015

Network topology optimisation for data aggregation using multiple paths.
IJMHeur, 2015

Alberto Apostolico.
Int. J. Found. Comput. Sci., 2015

Offline first fit scheduling in smart grids.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Two-aggregator network topology optimization with splitting.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Cache and energy efficient alignment of very long sequences.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2014
PC-DUOS+: A TCAM Architecture for Packet Classifiers.
IEEE Trans. Computers, 2014

Pairwise sequence alignment for very long sequences on GPUs.
IJBRA, 2014

PMS6: a fast algorithm for motif discovery.
IJBRA, 2014

Multicore and GPU algorithms for Nussinov RNA folding.
BMC Bioinformatics, 2014

Network topology optimization for data aggregation with splitting.
Proceedings of the 2014 IEEE International Symposium on Signal Processing and Information Technology, 2014

Offline preemptive scheduling of power demands to minimize peak power in smart grids.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

A framework for rendering high resolution synthetic aperture radar images on heterogeneous architectures.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Message from the general co-chairs.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Network Topology Optimization for Data Aggregation.
Proceedings of the 14th IEEE/ACM International Symposium on Cluster, 2014

2013
GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU.
IEEE Trans. Computers, 2013

PMS6MC: A Multicore Algorithm for Motif Discovery.
Algorithms, 2013

IEEE ISSPIT 2013: Message from the TPC chairs.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2013

Dynamic multistatic synthetic aperture radar (DMSAR) with image reconstruction algorithms and analysis.
Proceedings of the IEEE Applied Imagery Pattern Recognition Workshop, 2013

2012
Green TCAM-Based Internet Routers.
Proceedings of the Handbook of Energy-Aware and Green Computing - Two Volume Set., 2012

In-advance path reservation for file transfers in e-science applications.
The Journal of Supercomputing, 2012

PETCAM - A Power Efficient TCAM Architecture for Forwarding Tables.
IEEE Trans. Computers, 2012

Consistent Updates for Packet Classifiers.
IEEE Trans. Computers, 2012

Sheng Yu.
Int. J. Found. Comput. Sci., 2012

Techniques for mapping synthetic aperture radar processing algorithms to multi-GPU clusters.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2012

PC-TRIO: An indexed TCAM architecture for packet classifiers.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Parallel syntenic alignment on GPUs.
Proceedings of the ACM International Conference on Bioinformatics, 2012

2011
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates.
Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

Parallel processing techniques for the processing of synthetic aperture radar data on GPUs.
Proceedings of the 2011 IEEE International Symposium on Signal Processing and Information Technology, 2011

Highly compressed multi-pattern string matching on the cell broadband engine.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Multipattern string matching on a GPU.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

PC-DUOS: Fast TCAM lookup and update for packet classifiers.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Wavelength scheduling in Time-domain Wavelength Interleaved Networks.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Workflow scheduling in e-Science networks.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Strassen's Matrix Multiplication on GPUs.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

Sorting Large Multifield Records on a GPU.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

2010
A computational geometry method for localization using differences of distances.
TOSN, 2010

Low-Power TCAMs for Very Large Forwarding Tables.
IEEE/ACM Trans. Netw., 2010

Recursively Partitioned Static IP Router Tables.
IEEE Trans. Computers, 2010

Topology Aggregation for e-Science Networks.
IJNGC, 2010

First-Slot scheduling with wavelength conversion for distributed file transfers.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2010

Parallel processing techniques for the processing of synthetic aperture radar data on FPGAs.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2010

CONSIST-Consistent Internet route updates.
Proceedings of the 15th IEEE Symposium on Computers and Communications, 2010

DUOS - Simple dual TCAM architecture for routing tables with incremental update.
Proceedings of the 15th IEEE Symposium on Computers and Communications, 2010

Sorting large records on a cell broadband engine.
Proceedings of the 15th IEEE Symposium on Computers and Communications, 2010

Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

GRS - GPU radix sort for multifield records.
Proceedings of the 2010 International Conference on High Performance Computing, 2010

Fast in-Place File Carving for Digital Forensics.
Proceedings of the Forensics in Telecommunications, Information, and Multimedia, 2010

Bandwidth Allocation for Iterative Data-Dependent E-science Applications.
Proceedings of the 10th IEEE/ACM International Conference on Cluster, 2010

2009
Succinct representation of static packet classifiers.
IEEE/ACM Trans. Netw., 2009

Efficient 2D Multibit Tries for Packet Classification.
IEEE Trans. Computers, 2009

Power Assignment for Symmetric Communication in Wireless Sensor Networks.
IJDSN, 2009

PETCAM-A power Efficient TCAM for forwarding tables.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

Sorting on a Cell Broadband Engine SPU.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

Network Centered Multiple Resource Scheduling in e-Science Applications.
Proceedings of the Networks for Grid Applications, 2009

Improved SPRT detection using localization with application to radiation sources.
Proceedings of the 12th International Conference on Information Fusion, 2009

2008
Two techniques for fast computation of constrained shortest paths.
IEEE/ACM Trans. Netw., 2008

Packet Classification Using Space-Efficient Pipelined Multibit Tries.
IEEE Trans. Computers, 2008

Sensor Deployment and Source Localization.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Highly compressed Aho-Corasick automata for efficient intrusion detection.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

Performance evaluation of routing and wavelength assignment algorithms for optical networks.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

Minimum-cost sensor coverage of planar regions.
Proceedings of the 11th International Conference on Information Fusion, 2008

On basic properties of localization using distance-difference measurements.
Proceedings of the 11th International Conference on Information Fusion, 2008

Localization under random measurements with application to radiation sources.
Proceedings of the 11th International Conference on Information Fusion, 2008

2007
Optical Transpose Systems.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Rounding, Interval Partitioning, and Separation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

O(logW) multidimensional packet classification.
IEEE/ACM Trans. Netw., 2007

Approximation Algorithms for Sensor Deployment.
IEEE Trans. Computers, 2007

Efficient Construction of Pipelined Multibit-Trie Router-Tables.
IEEE Trans. Computers, 2007

Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks.
Proceedings of the Sixth International Conference on Networking (ICN 2007), 2007

Dynamic Tree Bitmap for IP Lookup and Update.
Proceedings of the Sixth International Conference on Networking (ICN 2007), 2007

Succinct Representation of Static Packet Forwarding Tables.
Proceedings of the Sixth International Conference on Networking (ICN 2007), 2007

A computational geometry method for DTOA triangulation.
Proceedings of the 10th International Conference on Information Fusion, 2007

2006
Approximation Algorithms for Multiconstrained Quality-of-Service Routing.
IEEE Trans. Computers, 2006

An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks.
IEEE Trans. Computers, 2006

Power Assignment For Symmetric Communication InWireless Sensor Networks.
Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 2006

Packet Classification Using Pipelined Two-Dimensional Multibit Tries.
Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 2006

Packet Forwarding Using Pipelined Multibit Tries.
Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 2006

2005
Packet classification consuming small amount of memory.
IEEE/ACM Trans. Netw., 2005

Conflict detection and resolution in two-dimensional prefix router tables.
IEEE/ACM Trans. Netw., 2005

Maximum Lifetime Broadcasting in Wireless Networks.
IEEE Trans. Computers, 2005

A B-Tree Dynamic Router-Table Design.
IEEE Trans. Computers, 2005

Prefix and Interval-Partitioned Dynamic IP Router-Tables.
IEEE Trans. Computers, 2005

Algorithms for Wireless Sensor Networks.
IJDSN, 2005

Data Structures and Algorithms for Packet Forwarding and Classification.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

Packet Classification Using Two-Dimensional Multibit Tries.
Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 2005

2004
The Master-Slave Scheduling Model.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

IP Router Tables.
Proceedings of the Handbook of Data Structures and Applications., 2004

Tries.
Proceedings of the Handbook of Data Structures and Applications., 2004

Double-Ended Priority Queues.
Proceedings of the Handbook of Data Structures and Applications., 2004

Leftist Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Analysis of Algorithms.
Proceedings of the Handbook of Data Structures and Applications., 2004

An O(log n) Dynamic Router-Table Design.
IEEE Trans. Computers, 2004

Enhanced Interval Trees for Dynamic IP Router-Tables.
IEEE Trans. Computers, 2004

O(log n) Dynamic Router-Tables for Prefixes and Ranges.
IEEE Trans. Computers, 2004

Efficient Dynamic Lookup For Bursty Access Patterns.
Int. J. Found. Comput. Sci., 2004

Dynamic IP router-tables using highest-priority matching.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

Fast Update Algorithm for IP Forwarding Table Using Independent Sets.
Proceedings of the High Speed Networks and Multimedia Communications, 2004

Prefix- and interval-partitioned router-tables [IP routing].
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Efficient construction of multibit tries for IP lookup.
IEEE/ACM Trans. Netw., 2003

A blocked all-pairs shortest-paths algorithm.
ACM Journal of Experimental Algorithmics, 2003

Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
Int. J. Found. Comput. Sci., 2003

Supernode Binary Search Trees.
Int. J. Found. Comput. Sci., 2003

Partitioning 3d Phantoms Into Homogeneous Cuboids.
Int. J. Found. Comput. Sci., 2003

O(log n) Dynamic Router-Tables For Ranges.
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

2002
IP Lookup by Binary Search on Prefix Length.
Journal of Interconnection Networks, 2002

Gate Resizing to Reduce Power Consumption.
Int. J. Found. Comput. Sci., 2002

Efficient Construction of Variable-Stride Multibit Tries for IP Lookup.
Proceedings of the 2002 Symposium on Applications and the Internet (SAINT 2002), 28 January, 2002

O(log n) dynamic packet routing.
Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

Computational Geometry On The OTIS-Mesh Optoelectronic Computer.
Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
A Fast Algorithm for Transistor Folding.
VLSI Design, 2001

Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer.
IEEE Trans. Computers, 2001

Efficient Algorithms for Local Alignment Search.
J. Comb. Optim., 2001

Efficient Algorithms for Similarity Search.
J. Comb. Optim., 2001

Models and Algorithms for Optical and Optoelectronic Parallel Computers.
Int. J. Found. Comput. Sci., 2001

Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup.
Proceedings of the 8th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS 2001), 2001

2000
Image Processing on the OTIS-Mesh Optoelectronic Computer.
IEEE Trans. Parallel Distrib. Syst., 2000

The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations.
IEEE Trans. Parallel Distrib. Syst., 2000

Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network.
IEEE Trans. Parallel Distrib. Syst., 2000

Correspondence-Based Data Structures for Double-Ended Priority Queues.
ACM Journal of Experimental Algorithmics, 2000

Special Issue on Randomized Computing.
Int. J. Found. Comput. Sci., 2000

A New Weight Balanced Binary Search Tree.
Int. J. Found. Comput. Sci., 2000

A Blocked All-Pairs Shortest-Path Algorithm.
Proceedings of the Algorithm Theory, 2000

Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel.
Proceedings of the Parallel and Distributed Processing, 2000

1999
A Fast Algorithm for Performance-Driven Module Implementation Selection.
VLSI Design, 1999

Mergeable Double-Ended Priority Queues.
Int. J. Found. Comput. Sci., 1999

Variable-Bit-Lengthn Coding: An Effective Coding Method.
Proceedings of the Visual Information and Information Systems, 1999

Efficient Algorithms for Lossless Compression of 2D/3D Images.
Proceedings of the Visual Information and Information Systems, 1999

A Framework for Matching Applications with Parallel Machines.
Proceedings of the High Performance Computing, 1999

1998
Basic Operations on the OTIS-Mesh Optoelectronic Computer.
IEEE Trans. Parallel Distrib. Syst., 1998

Randomized Routing, Selection, and Sorting on the OTIS-Mesh.
IEEE Trans. Parallel Distrib. Syst., 1998

An efficient motion estimator with application to medical image registration.
Medical Image Analysis, 1998

Weight-Biased Leftist Trees and Modified Skip Lists.
ACM Journal of Experimental Algorithmics, 1998

BPC Permutations on the OTIS-Hypercube Optoelectronic Computer.
Informatica (Slovenia), 1998

Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits.
Int. J. Found. Comput. Sci., 1998

1997
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses.
IEEE Trans. Parallel Distrib. Syst., 1997

Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh.
IEEE Trans. Parallel Distrib. Syst., 1997

Planar topological routing.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1997

Determinisitic Routing on the Array with Reconfigurable Optical Buses.
Parallel Processing Letters, 1997

Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects.
Journal of Systems and Software, 1997

A Robust and Efficient Algorithm for Image Registration.
Proceedings of the Information Processing in Medical Imaging, 1997

Scheduling For Distributed Computing.
Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 1997

1996
Optimal folding of standard and custom cells.
ACM Trans. Design Autom. Electr. Syst., 1996

Efficient net extraction for restricted orientation designs [VLSI layout].
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996

Scheduling Master-Slave Multiprocessor Systems.
IEEE Trans. Computers, 1996

Sorting and Selection on Distributed Memory Bus Computers.
Parallel Algorithms Appl., 1996

Editorial Announcement.
J. Parallel Distributed Comput., 1996

The master-slave paradigm in parallel computer and industrial settings.
J. Global Optimization, 1996

Performance metrics: keeping the focus on runtime.
IEEE P&DT, 1996

1995
Sorting n2 Numbers on n×n Meshes.
IEEE Trans. Parallel Distrib. Syst., 1995

Folding a stack of equal width components.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995

Minimum area joining of compacted cells.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995

Data Manipulation on the Distributed Memory Bus Computer.
Parallel Processing Letters, 1995

Network upgrading problems.
Networks, 1995

Editorial Message.
J. Parallel Distributed Comput., 1995

A fast algorithm to test planar topological routability.
Proceedings of the 8th International Conference on VLSI Design (VLSI Design 1995), 1995

The DMBC: Architecture and Fundamental Operations.
Proceedings of the 9th international conference on Supercomputing, 1995

1994
Deleting Vertices to Bound Path Length.
IEEE Trans. Computers, 1994

Computing Display Conflicts in String Visualization.
IEEE Trans. Computers, 1994

Sorting n Numbers on n x n Reconfigurable Meshes with Buses.
J. Parallel Distributed Comput., 1994

Reconfigurable Mesh Algorithms for the Hough Transform.
J. Parallel Distributed Comput., 1994

Segmented Winner Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Flipping Modules to Improve Circuit Performance and Routability.
Proceedings of the Seventh International Conference on VLSI Design, 1994

Computational Geometry on a Reconflgurable Mesh.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

Triangulation on a Reconfigurable Mesh With Buses.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

Grundlagen von Datenstrukturen in C.
Informatik Lehrbuch-Reihe, International Thomson, ISBN: 978-3-929821-00-0, 1994

1993
Image Shrinking and Expanding on a Pyramid.
IEEE Trans. Parallel Distrib. Syst., 1993

Optimal folding of bit sliced stacks.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993

On the circuit implementation problem.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993

Optimal realizations of floorplans [VLSI layout].
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993

Minimizing total wire length by flipping modules.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993

Constrained via minimization.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993

A Data Structure for Circular String Analysis and Visualization.
IEEE Trans. Computers, 1993

Optimal Joining of Compacted Cells.
IEEE Trans. Computers, 1993

NP-Hard Module Rotation Problems.
IEEE Trans. Computers, 1993

Histogramming on a Reconfigurable Mesh Computer.
Parallel Algorithms Appl., 1993

Heuristics for the Placement of Flip-Flops in Partial Scan Designs and the Placement of Signal Boosters in Lossy Circuits.
Proceedings of the Sixth International Conference on VLSI Design, 1993

Sorting n Numbers on n x n Reconfigurable Meshes with Buses.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Sorting n2 Numbers on n x n Meshes.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

A fast algorithm for VLSI net extraction.
Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993

Fundamentals of data structures in C.
Computer Science Press, ISBN: 978-0-7167-8250-6, 1993

1992
Serial and Parallel Algorithms for the Medial Axis Transform.
IEEE Trans. Pattern Anal. Mach. Intell., 1992

Models and techniques for the visualization of labeled discrete objects.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

Computing Display Conflicts in String and Circular String Visualization.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
Efficient serial and parallel algorithms for median filtering.
IEEE Trans. Signal Processing, 1991

Clustering on a Hypercube Multicomputer.
IEEE Trans. Parallel Distrib. Syst., 1991

Computing biconnected components on a hypercube.
The Journal of Supercomputing, 1991

Load Balancing on a Hypercube.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components.
Proceedings of the International Conference on Parallel Processing, 1991

Flipping Modules to Minimize Maximum Wire Length.
Proceedings of the Proceedings 1991 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1991

Performance Enhancement through the Generalized Bypass Transform.
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991

1990
Odd Even Shifts in SIMD Hypercubes.
IEEE Trans. Parallel Distrib. Syst., 1990

Computing Hough transforms on hypercube multicomputers.
The Journal of Supercomputing, 1990

Covering rectilinear polygons by rectangles.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

Pull up transistor folding.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

Long and short covering edges in combination logic circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

A Hardware Accelerator for Maze Routing.
IEEE Trans. Computers, 1990

Convolution on Mesh Connected Multicomputers.
IEEE Trans. Pattern Anal. Mach. Intell., 1990

String Editing on an SIMD Hypercube Multicomputer.
J. Parallel Distributed Comput., 1990

Image Template Matching on MIMD Hypercube Multicomputers.
J. Parallel Distributed Comput., 1990

Optimal Preemptive Scheduling of Two Unrelated Processors.
INFORMS Journal on Computing, 1990

Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989
Hypercube computing: Connected components.
The Journal of Supercomputing, 1989

Hypercube-to-host sorting.
The Journal of Supercomputing, 1989

On path selection in combinational logic circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1989

Fair Edge Deletion Problems.
IEEE Trans. Computers, 1989

Via Assignment in Single-Row Routing.
IEEE Trans. Computers, 1989

A new VLSI system for adaptive recursive filtering.
Parallel Comput., 1989

VLSI architectures for back substitution.
Parallel Comput., 1989

Hypercube Algorithms for Image Transformations.
Proceedings of the International Conference on Parallel Processing, 1989

1988
A balanced bin sort for hypercube multicomputers.
The Journal of Supercomputing, 1988

Maze routing on a hypercube multicomputer.
The Journal of Supercomputing, 1988

Two NP-hard interchangeable terminal problems.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1988

Fast algorithm for polygon decomposition.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1988

Maximum Alignment of Interchageable Terminals.
IEEE Trans. Computers, 1988

Programming a Hypercube Multicomputer.
IEEE Software, 1988

Special Issue on Parallel Architectures and Algorithms.
J. Parallel Distributed Comput., 1988

A Hypercube Algorithm for the 0/1 Knapsack Problem.
J. Parallel Distributed Comput., 1988

A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph.
Algorithmica, 1988

1987
A Systolic Design-Rule Checker.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1987

Layering Algorithms For Single-Row Routing.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1987

VLSI systems for band matrix multiplication.
Parallel Comput., 1987

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph.
Networks, 1987

Maze Routing on a Hypercube Multiprocessor Computer.
Proceedings of the International Conference on Parallel Processing, 1987

A Hypecube Algorithm for the 0/1 Knapsack Problem.
Proceedings of the International Conference on Parallel Processing, 1987

All Pairs Shortest Paths on a Hypercube Multiprocessor.
Proceedings of the International Conference on Parallel Processing, 1987

1986
VLSI Architectures for the Finite Impulse Response Filter.
IEEE Journal on Selected Areas in Communications, 1986

Single Bend Wiring.
J. Algorithms, 1986

VLSI Artchitectures for Back Substitution.
Proceedings of the Information Processing 86, 1986

NTU Computer Science Program.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

Simulated annealing and combinatorial optimization.
Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

A time and space efficient net extractor.
Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

1985
VLSI Systems For Matrix Multiplication.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

Experiments with simulated annealing.
Proceedings of the 22nd ACM/IEEE conference on Design automation, 1985

1984
Single-Row Routing in Narrow Streets.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1984

Scheduling Multipipeline and Multiprocessor Computers.
IEEE Trans. Computers, 1984

Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness.
SIAM J. Comput., 1984

A parallel matching algorithm for convex bipartite graphs and applications to scheduling.
J. Parallel Distributed Comput., 1984

Anomalies in Parallel Branch-and-Bound Algorithms.
Commun. ACM, 1984

VLSI Systems For Design Rule Checks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983
Parallel Generation of Postfix and Tree Forms.
ACM Trans. Program. Lang. Syst., 1983

Single Row Routing.
IEEE Trans. Computers, 1983

Binary Trees and Parallel Scheduling Algorithms.
IEEE Trans. Computers, 1983

Nearly On-Line Scheduling of Multiprocessor Systems with Memories.
J. Algorithms, 1983

Parallel Scheduling Algorithms.
Operations Research, 1983

Heuristics for the Circuit Realization Problem.
Proceedings of the 20th Design Automation Conference, 1983

1982
Optimal BPC Permutations on a Cube Connected SIMD Computer.
IEEE Trans. Computers, 1982

Parallel Algorithms to Set Up the Benes Permutation Network.
IEEE Trans. Computers, 1982

Parallel permutation and sorting algorithms and a new generalized connection network.
J. ACM, 1982

A parallel matching algorithm for convex bipartite graphs.
Proceedings of the International Conference on Parallel Processing, 1982

Parallel generation of the postfix form.
Proceedings of the International Conference on Parallel Processing, 1982

Optimal single row router.
Proceedings of the 19th Design Automation Conference, 1982

1981
A Self-Routing Benes Network and Parallel Permutation Algorithms.
IEEE Trans. Computers, 1981

Data Broadcasting in SIMD Computers.
IEEE Trans. Computers, 1981

Parallel Matrix and Graph Algorithms.
SIAM J. Comput., 1981

Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops.
Operations Research, 1981

Algorithmen - Entwurf und Analyse.
Springer, ISBN: 978-3-540-10743-9, 1981

1980
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.
SIAM J. Comput., 1980

On the Computational Complexity of Program Scheme Equivalence.
SIAM J. Comput., 1980

Bounds for List Schedules on Uniform Processors.
SIAM J. Comput., 1980

Scheduling Independent Tasks with Due Times on a Uniform Processor System.
J. ACM, 1980

An optimal routing algorithm for mesh-connected Parallel computers.
J. ACM, 1980

The complexity of design automation problems.
Proceedings of the 17th Design Automation Conference, 1980

1979
Bitonic Sort on a Mesh-Connected Parallel Computer.
IEEE Trans. Computers, 1979

Nearly On Line Scheduling of a Uniform Processor System with Release Times.
SIAM J. Comput., 1979

Complexity of Scheduling Shops with No Wait in Process.
Math. Oper. Res., 1979

Preemptive Scheduling with Due Dates.
Operations Research, 1979

1978
Preemptive Scheduling of Uniform Processor Systems.
J. ACM, 1978

Combinatorial Problems: Reductibility and Approximation.
Operations Research, 1978

Flowshop and Jobshop Schedules: Complexity and Approximation.
Operations Research, 1978

Fundamentals of Computer Algorithms.
Computer Science Press, 1978

1977
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests.
ACM Trans. Math. Softw., 1977

Bounds for LPT Schedules on Uniform Processors.
SIAM J. Comput., 1977

General Techniques for Combinatorial Approximation.
Operations Research, 1977

1976
Finite Automata with Multiplication.
Theor. Comput. Sci., 1976

P-Complete Approximation Problems.
J. ACM, 1976

Algorithms for Scheduling Independent Tasks.
J. ACM, 1976

Exact and Approximate Algorithms for Scheduling Nonidentical Processors.
J. ACM, 1976

Open Shop Scheduling to Minimize Finish Time.
J. ACM, 1976

1975
Polynomially Complete Fault Detection Problems.
IEEE Trans. Computers, 1975

The Computation of Powers of Symbolic Polynomials.
SIAM J. Comput., 1975

Hierarchies of Turing Machines with Restricted Tape Alphabet Size.
J. Comput. Syst. Sci., 1975

Approximate Algorithms for the 0/1 Knapsack Problem.
J. ACM, 1975

On Computing the Exact Determinant of Matrices with Polynomial Entries.
J. ACM, 1975

1974
Computationally Related Problems.
SIAM J. Comput., 1974

Computing Partitions with Applications to the Knapsack Problem.
J. ACM, 1974

P-Complete Problems and Approximate Solutions
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1972
Some Related Problems from Network Flows, Game Theory and Integer Programming
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972


  Loading...