The following pages link to Andrea Pietracaprina (Q235649):
Displayed 39 items.
- On stalling in LogP (Q557671) (← links)
- (Q675851) (redirect page) (← links)
- Practical constructive schemes for deterministic shared-memory access (Q675852) (← links)
- The complexity of deterministic PRAM simulation on distributed memory machines (Q679435) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- A new scheme for the deterministic simulation of PRAMs in VLSI (Q911777) (← links)
- Store-and-forward multicast routing on the mesh (Q927394) (← links)
- Optimal many-to-one routing on the mesh with constant queues (Q1044696) (← links)
- A probabilistic simulation of PRAMs on a bounded degree network (Q1113672) (← links)
- The complexity of parallel multisearch on coarse-grained machines (Q1125804) (← links)
- BSP versus LogP (Q1125822) (← links)
- Implementing shared memory on mesh-connected computers and on the fat-tree (Q1854415) (← links)
- Optimal deterministic protocols for mobile robots on a grid (Q1854509) (← links)
- On the expansion and diameter of bluetooth-like topologies (Q1946491) (← links)
- Translating submachine locality into locality of reference (Q2497735) (← links)
- (Q2766669) (← links)
- (Q2779599) (← links)
- Space-Efficient Parallel Algorithms for Combinatorial Search Problems (Q2849956) (← links)
- Tight bounds on information dissemination in sparse mobile networks (Q2943410) (← links)
- Network-Oblivious Algorithms (Q3177760) (← links)
- On the Expansion and Diameter of Bluetooth-Like Topologies (Q3639272) (← links)
- ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING (Q4020281) (← links)
- (Q4281513) (← links)
- Sharper analysis of packet routing on a butterfly (Q4285460) (← links)
- Constructive, Deterministic Implementation of Shared Memory on Meshes (Q4507367) (← links)
- Improved deterministic PRAM simulation on the mesh (Q4645193) (← links)
- (Q4737214) (← links)
- (Q4790568) (← links)
- (Q4818869) (← links)
- The deterministic complexity of parallel multisearch (Q5054831) (← links)
- Optimal deterministic protocols for mobile robots on a grid (Q5054854) (← links)
- DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES (Q5249013) (← links)
- An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets (Q5395683) (← links)
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES (Q5696959) (← links)
- (Q5875597) (← links)
- Deterministic parallel backtrack search (Q5958310) (← links)
- Implementing shared memory on multi-dimensional meshes and on the fat-tree (Q6102291) (← links)
- Fully dynamic clustering and diversity maximization in doubling metrics (Q6139043) (← links)