The following pages link to P. G. Spirakis (Q389952):
Displaying 50 items.
- Expander properties and the cover time of random intersection graphs (Q1034533) (← links)
- Weighted random sampling with a reservoir (Q1045927) (← links)
- k-connectivity in random undirected graphs (Q1059644) (← links)
- The parallel complexity of deadlock detection (Q1091805) (← links)
- Optimal parallel randomized algorithms for sparse addition and identification (Q1103402) (← links)
- Optimal high-performance parallel text retrieval via fat-trees (Q1125796) (← links)
- BSP versus LogP (Q1125822) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- The complexity of the reliable connectivity problem (Q1183401) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- Tentative and definite distributed computations: An optimistic approach to network synchronization (Q1330420) (← links)
- Minimum congestion redundant assignments to tolerate random faults (Q1348940) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps (Q1351169) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- Distributed communication algorithms for ad hoc mobile networks. (Q1398773) (← links)
- Competitive video on demand schedulers for popular movies (Q1399108) (← links)
- Efficient scheduling of strict multithreaded computations (Q1579050) (← links)
- Short paper: strategic contention resolution in multiple channels with limited feedback (Q1617672) (← links)
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
- Strong bounds for evolution in networks (Q1672000) (← links)
- Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)
- Brief announcement: fast approximate counting and leader election in populations (Q1713888) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- Strategic contention resolution in multiple channels (Q1757768) (← links)
- Approximate equilibria and ball fusion (Q1762998) (← links)
- The cost of concurrent, low-contention Read \& Modify \& Write (Q1770373) (← links)
- Space efficient hash tables with worst case constant access time (Q1771320) (← links)
- On the robustness of interconnections in random graphs: a symbolic approach. (Q1853495) (← links)
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (Q1870558) (← links)
- Competitive call control in mobile networks (Q1871773) (← links)
- A hierarchical adaptive distributed algorithm for load balancing (Q1878706) (← links)
- Attack propagation in networks (Q1879194) (← links)
- Natural models for evolution on networks (Q1945945) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- An extension of the Moran process using type-specific connection graphs (Q2051852) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- On the derivation of a closed-form expression for the solutions of a subclass of generalized Abel differential equations (Q2247854) (← links)
- The survival of the weakest in networks (Q2272242) (← links)
- Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
