PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

, , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (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.

G. Daiß

G. Wagner

PD Dr. Simon Paulus University of Stuttgart

Prof. Dr. Paul Keller University of Stuttgart

Paul Betz University of Stuttgart

 

Other publications of authors with the same name

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution., , , and . ICGS3/e-Democracy, volume 99 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 72-79. Springer, (2011)Strong NP-Hardness of Moving Many Discs., and . Inf. Process. Lett., 19 (1): 55-59 (1984)Optimal High-Performance Parallel Text Retrieval via Fat-Trees., , and . Theory Comput. Syst., 32 (6): 591-623 (1999)Efficient Scheduling of Strict Multithreaded Computations., and . Theory Comput. Syst., 33 (3): 173-232 (2000)Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks., and . Perform. Eval., 25 (2): 105-130 (1996)Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem., , , and . Bulletin of the EATCS, (2001)Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks., , and . I. J. Comput. Appl., 10 (1): 51-66 (2003)NanoPeer Networks and P2P Worlds., , , and . Peer-to-Peer Computing, page 40-46. IEEE Computer Society, (2003)Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases., and . MASCOTS, page 243-246. The Society for Computer Simulation, (1993)Minimum Congestion Redundant Assignments to Tolerate Random Faults., and . Algorithmica, 32 (3): 396-422 (2002)