Pages that link to "Item:Q3719831"
From MaRDI portal
The following pages link to Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (Q3719831):
Displaying 50 items.
- An insight on PRAM computational bounds (Q287202) (← links)
- Time bounds on synchronization in a periodic distributed system (Q287245) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- Boolean nested canalizing functions: a comprehensive analysis (Q385051) (← links)
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- Concurrent counting is harder than queuing (Q604464) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- Parallel random access machines with bounded memory wordsize (Q757038) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Efficient simulation of circuits by EREW PRAMs (Q911771) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Distributed sorting algorithms for multi-channel broadcast networks (Q1098273) (← links)
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213) (← links)
- Limits on the power of concurrent-write parallel machines (Q1103403) (← links)
- On separating the EREW and CREW PRAM models (Q1124343) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
- Sorting on PRAMs with reconfigurable buses (Q1198059) (← links)
- PRAMs with variable word-size (Q1198062) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- Matching parentheses in parallel (Q1208458) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- Optimal parallel two dimensional text searching on a CREW PRAM (Q1271473) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Parallel integer sorting using small operations (Q1346223) (← links)
- The parallel complexity of integer prefix summation (Q1350241) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Time-optimal tree computations on sparse meshes (Q1364469) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Selecting small ranks in EREW PRAM (Q1606990) (← links)
- On the long-run sensitivity of probabilistic Boolean networks (Q1617725) (← links)
- The influence of canalization on the robustness of Boolean networks (Q1691232) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions (Q1887146) (← links)
