DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Sartaj Sahni
Sartaj Sahni
(R18A0507) Design and Analysis of Algorithms.Pdf
A Fast Algorithm for Performance-Driven Module Implementation Selection*
R COMPUTATIONALLY RELATED PROBLEMS·
Computing Biconnected Components on a Hypercube*
Combinatorial Algorithms for Subset Sum Problems
40 Faster Pseudopolynomial Time Algorithms for Subset
Fast Low-Space Algorithms for Subset Sum∗
Handbook of Approximation Algorithms and Metaheuristics CHAPMAN & HALL/CRC COMPUTER and INFORMATION SCIENCE SERIES
A Faster Pseudopolynomial Time Algorithm for Subset Sum 1
Oral History Interview with Teofilo F. Gonzalez May 10, 2021 Via Zoom
NP-Completeness Polynomial Transformation
Dense Subset Sum May Be the Hardest
Faster Space-Efficient Algorithms for Subset Sum, K-Sum and Related
P-COMPLETE PROBLEMS and APPROXIMATE SOLUTIONS Sartaj
Fundamental Data Structures
For Pinaki Mazumder's Course
Quantum Algorithms for the Subset-Sum Problem
A Multistage View on 2-Satisfiability
Top View
Beating a Random Assignment
Green Internet Routers” Monday, April 12, 2010 Reception: 10:30 A.M
Master of Computer Applications DESIGN and ANALYSIS of ALGORITHMS
Fundamentals of Data Structures – Ellis Horowitz, Sartaj Sahni