AAAAAA

   
Results: 1-14 |
Results: 14
BICRITERIA NETWORK DESIGN-PROBLEMS
Authors: MARATHE MV RAVI R SUNDARAM R RAVI SS ROSENKRANTZ DJ HUNT HB
Citation: Mv. Marathe et al., BICRITERIA NETWORK DESIGN-PROBLEMS, Journal of algorithms, 28(1), 1998, pp. 142-171
NC-APPROXIMATION SCHEMES FOR NP-HARD AND PSPACE-HARD PROBLEMS FOR GEOMETRIC GRAPHS
Authors: HUNT HB MARATHE MV RADHAKRISHNAN V RAVI SS ROSENKRANTZ DJ STEARNS RE
Citation: Hb. Hunt et al., NC-APPROXIMATION SCHEMES FOR NP-HARD AND PSPACE-HARD PROBLEMS FOR GEOMETRIC GRAPHS, Journal of algorithms, 26(2), 1998, pp. 238-274
EARLY COMPARISON AND DECISION STRATEGIES FOR DATAPATHS THAT RECOVER FROM TRANSIENT FAULTS
Authors: NARASIMHAN R ROSENKRANTZ DJ RAVI SS
Citation: R. Narasimhan et al., EARLY COMPARISON AND DECISION STRATEGIES FOR DATAPATHS THAT RECOVER FROM TRANSIENT FAULTS, IEEE transactions on circuits and systems. 1, Fundamental theory andapplications, 44(5), 1997, pp. 435-438
COMPACT LOCATION-PROBLEMS
Authors: KRUMKE SO MARATHE MV NOLTEMEIER H RADHAKRISHNAN V RAVI SS ROSENKRANTZ DJ
Citation: So. Krumke et al., COMPACT LOCATION-PROBLEMS, Theoretical computer science, 181(2), 1997, pp. 379-404
SPANNING-TREES - SHORT OR SMALL
Authors: RAVI R SUNDARAM R MARATHE MV ROSENKRANTZ DJ RAVI SS
Citation: R. Ravi et al., SPANNING-TREES - SHORT OR SMALL, SIAM journal on discrete mathematics, 9(2), 1996, pp. 178-200
SIMPLE HEURISTICS FOR UNIT DISK GRAPHS
Authors: MARATHE MV BREU H HUNT HB RAVI SS ROSENKRANTZ DJ
Citation: Mv. Marathe et al., SIMPLE HEURISTICS FOR UNIT DISK GRAPHS, Networks, 25(2), 1995, pp. 59-68
PARTITIONING MESSAGE PATTERNS FOR BUNDLED OMEGA NETWORKS
Authors: BERNHARD PJ ROSENKRANTZ DJ
Citation: Pj. Bernhard et Dj. Rosenkrantz, PARTITIONING MESSAGE PATTERNS FOR BUNDLED OMEGA NETWORKS, IEEE transactions on parallel and distributed systems, 5(4), 1994, pp. 353-363
A LINEAR-TIME SCHEME FOR VERSION RECONSTRUCTION
Authors: YU L ROSENKRANTZ DJ
Citation: L. Yu et Dj. Rosenkrantz, A LINEAR-TIME SCHEME FOR VERSION RECONSTRUCTION, ACM transactions on programming languages and systems, 16(3), 1994, pp. 775-797
HEURISTIC AND SPECIAL CASE ALGORITHMS FOR DISPERSION PROBLEMS
Authors: RAVI SS ROSENKRANTZ DJ TAYI GK
Citation: Ss. Ravi et al., HEURISTIC AND SPECIAL CASE ALGORITHMS FOR DISPERSION PROBLEMS, Operations research, 42(2), 1994, pp. 299-310
CONSTRUCTION OF CHECK SETS FOR ALGORITHM-BASED FAULT-TOLERANCE
Authors: GU DC ROSENKRANTZ DJ RAVI SS
Citation: Dc. Gu et al., CONSTRUCTION OF CHECK SETS FOR ALGORITHM-BASED FAULT-TOLERANCE, I.E.E.E. transactions on computers, 43(6), 1994, pp. 641-650
ANCESTOR CONTROLLED SUBMODULE INCLUSION IN DESIGN DATABASES
Authors: YU L ROSENKRANTZ DJ
Citation: L. Yu et Dj. Rosenkrantz, ANCESTOR CONTROLLED SUBMODULE INCLUSION IN DESIGN DATABASES, IEEE transactions on knowledge and data engineering, 5(2), 1993, pp. 352-362
DETERMINING PERFORMANCE-MEASURES OF ALGORITHM-BASED FAULT-TOLERANT SYSTEMS
Authors: GU DC ROSENKRANTZ DJ RAVI SS
Citation: Dc. Gu et al., DETERMINING PERFORMANCE-MEASURES OF ALGORITHM-BASED FAULT-TOLERANT SYSTEMS, Journal of parallel and distributed computing, 18(1), 1993, pp. 56-70
THE COMPLEXITY OF PROCESSING HIERARCHICAL SPECIFICATIONS
Authors: ROSENKRANTZ DJ HUNT HB
Citation: Dj. Rosenkrantz et Hb. Hunt, THE COMPLEXITY OF PROCESSING HIERARCHICAL SPECIFICATIONS, SIAM journal on computing, 22(3), 1993, pp. 627-649
IMPROVED BOUNDS FOR ALGORITHM-BASED FAULT-TOLERANCE
Authors: ROSENKRANTZ DJ RAVI SS
Citation: Dj. Rosenkrantz et Ss. Ravi, IMPROVED BOUNDS FOR ALGORITHM-BASED FAULT-TOLERANCE, I.E.E.E. transactions on computers, 42(5), 1993, pp. 630-635
Risultati: 1-14 |