STOC 1993 - PDF Preprint Papers

STOC 1993 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-1993 Paper

click to vote

STOC
1993
ACM

264views Algorithms» more STOC 1993»

Contention in shared memory algorithms

13 years 8 months ago

Download www.cs.brown.edu

Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...

Cynthia Dwork, Maurice Herlihy, Orli Waarts

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	264	Contention in shared memory algorithms	claim
2	179	The network inhibition problem	claim
3	141	Bounds for the computational power and learning complexity of analog neural nets	claim
4	134	Quantum complexity theory	claim
5	123	Constructing small sample spaces satisfying given constraints	claim
6	123	Deterministic coding for interactive communication	claim
7	121	On the generation of multivariate polynomials which are hard to factor	claim
8	120	Characterizing non-deterministic circuit size	claim
9	117	Efficient noise-tolerant learning from statistical queries	claim
10	109	Routing permutations on graphs via matchings	claim
11	103	Efficient learning of typical finite automata from random walks	claim
12	94	Finiteness results for sigmoidal "neural" networks	claim
13	88	Constant time factors do matter	claim
14	87	How much can hardware help routing?	claim
15	87	How to use expert advice	claim
16	85	What can be computed locally?	claim
17	82	Efficient construction of a small hitting set for combinatorial rectangles in high dimension	claim
18	76	Piecewise linear paths among convex obstacles	claim
19	71	Parametric real-time reasoning	claim
20	63	Some complexity issues on the simply connected regions of the two-dimensional plane	claim
21	62	A robust model for finding optimal evolutionary trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers