Paul G. Spirakis

PG

15 featured booksPaul G. Spirakis

Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.

Search this author Open first work

OL5381835A

Featured books

Representative editions for works actually authored by this person.

AA
Image source: Open Library
Algorithms and Complexity
Algorithms and Complexity | 2013
Representative edition for this work grouping in the active catalog.
cover
NM
Image source: Open Library
New models for population protocols
New models for population protocols | 2011
Representative edition for this work grouping in the active catalog.
cover
TP
Image source: Open Library
The parallel complexity of deadlock detection
The parallel complexity of deadlock detection. | 1986
Representative edition for this work grouping in the active catalog.
cover
FP
Image source: Open Library
Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem
Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem. | 1984
Representative edition for this work grouping in the active catalog.
cover
QD
Image source: Open Library
Queuing delaymodeling for multistage interconnection multiprocessor networks
Queuing delaymodeling for multistage interconnection multiprocessor networks. | 1984
Representative edition for this work grouping in the active catalog.
cover
AS
Image source: Open Library
A semantic approach to correctness of concurrent transaction executions
A semantic approach to correctness of concurrent transaction executions. | 1984
Representative edition for this work grouping in the active catalog.
cover
BV
Image source: Open Library
Buffered versus unbuffered tree networks for accessing a critical resource
Buffered versus unbuffered tree networks for accessing a critical resource. | 1983
Representative edition for this work grouping in the active catalog.
cover
MM
Image source: Open Library
Moving many pebbles in a graph is polynomial time
Moving many pebbles in a graph is polynomial time | 1983
Representative edition for this work grouping in the active catalog.
cover
OT
Image source: Open Library
On the combinatorial complexity of motion coordination
On the combinatorial complexity of motion coordination | 1983
Representative edition for this work grouping in the active catalog.
cover
OT
Image source: Open Library
On the shadow CPU approximation for modelling priority scheduling in computer systems
On the shadow CPU approximation for modelling priority scheduling in computer systems. | 1983
Representative edition for this work grouping in the active catalog.
cover
PT
Image source: Open Library
Probabilistic techniques for two phase locking in database systems
Probabilistic techniques for two phase locking in database systems | 1983
Representative edition for this work grouping in the active catalog.
cover
SN
Image source: Open Library
Strong NP-hardness of moving many discs
Strong NP-hardness of moving many discs | 1983
Representative edition for this work grouping in the active catalog.
cover
VF
Image source: Open Library
Very fast algorithms for the area of the union of many circles
Very fast algorithms for the area of the union of many circles. | 1983
Representative edition for this work grouping in the active catalog.
cover
TE
Image source: Open Library
The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems
The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems. | 1982
Representative edition for this work grouping in the active catalog.
cover
Computer Network EpidemicsPaul G. Spirakis
CN
Computer Network Epidemics
Computer Network Epidemics | 2012
Representative edition for this work grouping in the active catalog.
no cover

Works in catalog

Quick navigation into the work-level grouping pages behind the featured books.

Algorithms and Complexity
Representative edition published 2013
Open Work
New models for population protocols
Representative edition published 2011
Open Work
The parallel complexity of deadlock detection
Representative edition published 1986
Open Work
Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem
Representative edition published 1984
Open Work
Queuing delaymodeling for multistage interconnection multiprocessor networks
Representative edition published 1984
Open Work
A semantic approach to correctness of concurrent transaction executions
Representative edition published 1984
Open Work
Buffered versus unbuffered tree networks for accessing a critical resource
Representative edition published 1983
Open Work
Moving many pebbles in a graph is polynomial time
Representative edition published 1983
Open Work
On the combinatorial complexity of motion coordination
Representative edition published 1983
Open Work
On the shadow CPU approximation for modelling priority scheduling in computer systems
Representative edition published 1983
Open Work
Probabilistic techniques for two phase locking in database systems
Representative edition published 1983
Open Work
Strong NP-hardness of moving many discs
Representative edition published 1983
Open Work
Very fast algorithms for the area of the union of many circles
Representative edition published 1983
Open Work
The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems
Representative edition published 1982
Open Work
Computer Network Epidemics
Representative edition published 2012
Open Work

Paul G. Spirakis

Overview

Catalog identity

Featured books

Works in catalog