A SEMANTIC APPROACH TO CORRECTNESS OF CONCURRENT TRANSACTION EXECUTIONS

A SEMANTIC APPROACH TO CORRECTNESS OF CONCURRENT TRANSACTION EXECUTIONS (HB)

A SEMANTIC APPROACH TO CORRECTNESS, OF CONCURRENT TRANSACTION EXECUTIONS (CLASSIC REPRINT)

FAST PROBABILISTIC TECHNIQUES FOR DYNAMIC PARALLEL ADDITION, PARALLEL COUNTING AND THE PROCESSOR IDENTIFICATION PROBLEM (HB)

INPUT SENSITIVE, OPTIMAL PARALLEL RANDOM (PB)

MOVING MANY PEBBLES IN A GRAPH IS POLYNOMIAL TIME

MOVING MANY PEBBLES IN A GRAPH IS POLYNOMIAL TIME (HB)

NEW MODELS FOR POPULATION PROTOCOLS

ON THE COMBINATORIAL COMPLEXITY OF MOTION COORDINATION

ON THE COMBINATORIAL COMPLEXITY OF MOTION COORDINATION (HB)

ON THE SHADOW CPU APPROXIMATION FOR MODELLING PRIORITY SCHEDULING IN COMPUTER SYSTEMS

ON THE SHADOW CPU APPROXIMATION FOR MODELLING PRIORITY SCHEDULING IN COMPUTER SYSTEMS (CLASSIC REPRINT)

ON THE SHADOW CPU APPROXIMATION FOR MODELLING PRIORITY SCHEDULING IN COMPUTER SYSTEMS (HB)

PROBABILISTIC TECHNIQUES FOR TWO PHASE LOCKING IN DATABASE SYSTEMS

PROBABILISTIC TECHNIQUES FOR TWO PHASE LOCKING IN DATABASE SYSTEMS (HB)

QUEUING DELAY MODELING FOR MULTISTAGE IN (PB)

THE EFFECT OF RESTRICTIONS ON RELATIVE PROCESSOR SPEEDS TO DIFFERENCES IN EFFICIENCY BETWEEN SYNCHRONOUS AND ASYNCHRONOUS SYSTEMS (CLASSIC REPRINT)

THE PARALLEL COMPLEXITY OF DEADLOCK DETE (PB)

THE VOLUME OF THE UNION OF MANY SPHERES AND POINT INCLUSION PROBLEMS (CLASSIC REPRINT)

VERY FAST ALGORITHMS FOR THE AREA OF THE UNION OF MANY CIRCLES

VERY FAST ALGORITHMS FOR THE AREA OF THE UNION OF MANY CIRCLES (CLASSIC REPRINT)

VERY FAST ALGORITHMS FOR THE AREA OF THE UNION OF MANY CIRCLES (HB)