Cover of Moving many pebbles in a graph is polynomial time

Mark as

Moving many pebbles in a graph is polynomial time

by Paul G. Spirakis

Buy this book Review

More by Paul G. Spirakis

Cover of Algorithms and Complexity

Cover of A semantic approach to correctness of concurrent transaction executions

Cover of Automata, Languages and Programming

Cover of Buffered versus unbuffered tree networks for accessing a critical resource

Cover of Computer Network Epidemics

Cover of Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem

Cover of On the combinatorial complexity of motion coordination

Cover of On the shadow CPU approximation for modelling priority scheduling in computer systems

Cover of Probabilistic techniques for two phase locking in database systems

Cover of Queuing delaymodeling for multistage interconnection multiprocessor networks

Cover of Strong NP-hardness of moving many discs

Cover of The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems

Cover of The parallel complexity of deadlock detection

Cover of The volume of the union of many spheres and point inclusion problems

Cover of Very fast algorithms for the area of the union of many circles

Recent activity

Rate this book to see your activity here.

Comments and reviews

Please sign in to leave a comment