The following pages link to Sartaj K. Sahni (Q1218270):
Displaying 50 items.
- (Q547487) (redirect page) (← links)
- Computing Hough transforms on hypercube multicomputers (Q547488) (← links)
- A linear algorithm to find a rectangular dual of a planar triangulated graph (Q1097704) (← links)
- VLSI systems for band matrix multiplication (Q1104700) (← links)
- Systolic algorithms for rectilinear polygons (Q1108798) (← links)
- Models and algorithms for structured layout (Q1113699) (← links)
- Time and space efficient net extractor (Q1113701) (← links)
- A new VLSI system for adaptive recursive filtering (Q1123556) (← links)
- Hierarchies of Turing machines with restricted tape alphabet size (Q1218271) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Reconfigurable mesh algorithms for the Hough transform (Q1328112) (← links)
- Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses (Q1345655) (← links)
- Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
- VLSI architecture for back substitution (Q1823695) (← links)
- Reconfigurable meshes and image processing (Q1898157) (← links)
- The master-slave paradigm in parallel computer and industrial settings (Q2564882) (← links)
- (Q2722000) (← links)
- (Q2743971) (← links)
- PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers (Q2982324) (← links)
- Pubsub: An Efficient Publish/Subscribe System (Q2982325) (← links)
- GATE RESIZING TO REDUCE POWER CONSUMPTION (Q3021961) (← links)
- EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS (Q3022022) (← links)
- (Q3026916) (← links)
- Parallel Generation of Postfix and Tree Forms (Q3038609) (← links)
- Nearly on Line Scheduling of a Uniform Processor System with Release Times (Q3051373) (← links)
- Nearly on-line scheduling of multiprocessor systems with memories (Q3314988) (← links)
- Scheduling Multipipeline and Multiprocessor Computers (Q3321443) (← links)
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (Q3340134) (← links)
- Maximum Lifetime Broadcasting in Wireless Networks (Q3417034) (← links)
- Via assignment in single-row routing (Q3495208) (← links)
- Network Centered Multiple Resource Scheduling in e-Science Applications (Q3568533) (← links)
- Binary Trees and Parallel Scheduling Algorithms (Q3659131) (← links)
- Single Row Routing (Q3659167) (← links)
- The complexity of single row routing (Q3684052) (← links)
- (Q3694701) (← links)
- Anomalies in parallel branch-and-bound algorithms (Q3713596) (← links)
- Single bend wiring (Q3745779) (← links)
- (Q3780902) (← links)
- Maximum alignment of interchangeable terminals (Q3806834) (← links)
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326) (← links)
- An optimal routing algorithm for mesh-connected Parallel computers (Q3856094) (← links)
- Preemptive Scheduling with Due Dates (Q3859548) (← links)
- Complexity of Scheduling Shops with No Wait in Process (Q3880561) (← links)
- (Q3885184) (← links)
- Bounds for List Schedules on Uniform Processors (Q3891758) (← links)
- On the Computational Complexity of Program Scheme Equivalence (Q3893301) (← links)
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer (Q3893326) (← links)
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops (Q3904361) (← links)
- A Self-Routing Benes Network and Parallel Permutation Algorithms (Q3914895) (← links)
- (Q3919054) (← links)
