( en | de | ru )

 

Disambiguation of "Ravi, S. S."

Author of the publication

copydeleteadd this publication to your clipboard
Hierarchically Specified Unit Disk Graphs.

, , , and . Theor. Comput. Sci., 174 (1-2): 23-65 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S Danischewski

S Ulrich

S Hilt

S Hüttelmaier

S Leopold

 

Other publications of authors with the same name

Improved Bounds for Algorithm-Based Fault Tolerance., and . IEEE Trans. Computers, 42 (5): 630-635 (1993)The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits., , , and . IEEE Trans. Computers, 38 (6): 865-869 (1989)The complexity of approximating PSPACE-Complete problems for hierarchical specifications., , and . CoRR, (1994)Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract)., , and . WADS, volume 519 of Lecture Notes in Computer Science, page 355-366. Springer, (1991)Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits., and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 9 (3): 329-331 (1990)A mobility and traffic generation framework for modeling and simulating ad hoc communication networks., , , and . SAC, page 122-126. ACM, (2002)Structure-Based Resilience Metrics for Service-Oriented Networks., , , and . EDCC, volume 3463 of Lecture Notes in Computer Science, page 345-362. Springer, (2005)On Multi-Label Linear Interval Routing Schemes., , and . Comput. J., 39 (2): 133-139 (1996)Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors., , and . Algorithmica, 12 (6): 421-435 (1994)Facility Dispersion Problems Under Capacity and Cost Constraints., , and . J. Comb. Optim., 4 (1): 7-33 (2000)