( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
One-Layer Routing without Component Constraints.

, и . J. Comput. Syst. Sci., 28 (3): 420-438 (1984)

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.

S Danischewski

S Hüttelmaier

S Leopold

S Steinlechner

S Bachmann

 

Другие публикации лиц с тем же именем

The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits., , , и . IEEE Trans. Computers, 38 (6): 865-869 (1989)Improved Bounds for Algorithm-Based Fault Tolerance., и . IEEE Trans. Computers, 42 (5): 630-635 (1993)Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits., и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 9 (3): 329-331 (1990)The complexity of approximating PSPACE-Complete problems for hierarchical specifications., , и . CoRR, (1994)Simple heuristics for unit disk graphs., , , , и . Networks, 25 (2): 59-68 (1995)Approximate Contagion Model of Common Knowledge on Facebook., , , и . HT, стр. 231-236. ACM, (2016)Intractability and clustering with constraints., и . ICML, том 227 из ACM International Conference Proceeding Series, стр. 201-208. ACM, (2007)A mobility and traffic generation framework for modeling and simulating ad hoc communication networks., , , и . SAC, стр. 122-126. ACM, (2002)Structure-Based Resilience Metrics for Service-Oriented Networks., , , и . EDCC, том 3463 из Lecture Notes in Computer Science, стр. 345-362. Springer, (2005)Upgrading Bottleneck Constrained Forests., , , , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 215-226. Springer, (1998)