Clicky

Moving many pebbles in a graph is polynomial time by Paul G. Spirakis and similar books you'll love - Bookscovery

Home > Authors > Paul G. Spirakis > Moving many pebbles in a graph is polynomial time

Buy at: Bookshop.org Amazon

Moving many pebbles in a graph is polynomial time

Paul G. Spirakis

Recent activity

Rate this book to see your activity here.

15 Books Similar to Moving many pebbles in a graph is polynomial time by Paul G. Spirakis

Bookscovery readers who liked Moving many pebbles in a graph is polynomial time also like Algorithms and Complexity, A semantic approach to correctness of concurrent transaction executions and Automata, Languages and Programming. How many of these have you read?

Algorithms and Complexity by Paul G. Spirakis

Cover of Algorithms and Complexity
Buy this book at:
Bookshop.org Amazon

A semantic approach to correctness of concurrent transaction executions by Paul G. Spirakis

Cover of A semantic approach to correctness of concurrent transaction executions
Buy this book at:
Bookshop.org Amazon

Automata, Languages and Programming by Fernando Orejas

Cover of Automata, Languages and Programming
Buy this book at:
Bookshop.org Amazon

Buffered versus unbuffered tree networks for accessing a critical resource by Paul G. Spirakis

Cover of Buffered versus unbuffered tree networks for accessing a critical resource
Buy this book at:
Bookshop.org Amazon

Computer Network Epidemics by Yannis C. Stamatiou

Cover of Computer Network Epidemics
Buy this book at:
Bookshop.org Amazon

Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem by Paul G. Spirakis

Cover of Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem
Buy this book at:
Bookshop.org Amazon

On the combinatorial complexity of motion coordination by Paul G. Spirakis

Cover of On the combinatorial complexity of motion coordination
Buy this book at:
Bookshop.org Amazon

On the shadow CPU approximation for modelling priority scheduling in computer systems by Paul G. Spirakis

Cover of On the shadow CPU approximation for modelling priority scheduling in computer systems
Buy this book at:
Bookshop.org Amazon

Probabilistic techniques for two phase locking in database systems by Paul G. Spirakis

Cover of Probabilistic techniques for two phase locking in database systems
Buy this book at:
Bookshop.org Amazon

Queuing delaymodeling for multistage interconnection multiprocessor networks by Paul G. Spirakis

Cover of Queuing delaymodeling for multistage interconnection multiprocessor networks
Buy this book at:
Bookshop.org Amazon

Strong NP-hardness of moving many discs by Paul G. Spirakis

Cover of Strong NP-hardness of moving many discs
Buy this book at:
Bookshop.org Amazon

The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems by Paul G. Spirakis

Cover of The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems
Buy this book at:
Bookshop.org Amazon

The parallel complexity of deadlock detection by Paul G. Spirakis

Cover of The parallel complexity of deadlock detection
Buy this book at:
Bookshop.org Amazon

The volume of the union of many spheres and point inclusion problems by Paul G. Spirakis

Cover of The volume of the union of many spheres and point inclusion problems
Buy this book at:
Bookshop.org Amazon

Very fast algorithms for the area of the union of many circles by Paul G. Spirakis

Cover of Very fast algorithms for the area of the union of many circles
Buy this book at:
Bookshop.org Amazon

Comments and reviews of Moving many pebbles in a graph is polynomial time

Please sign in to leave a comment