Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

May 1990

1990 Proceeding

Chairman:
F. T. Leighton
Massachusetts Institute of Technology, Cambridge, MA

Publisher:

Association for Computing Machinery
New York
NY
United States

Conference:

SPAA90: 2nd Annual ACM Symposium on Parallel Algorithms & Architecture Island of Crete Greece July 2 - 6, 1990

ISBN:

978-0-89791-370-6

Published:

01 May 1990

Sponsors:

Computer Tech Inst., CTI, SIGACT, SIGARCH, EATCS, IEEE-CS

Get Alerts for this ConferenceAlerts Save to BinderBinder

Save to Binder

Create a New Binder

Name

Export CitationCitation

Share on

Bibliometrics

Citation count

849

Downloads (6 weeks)

166

Downloads (12 months)

1,501

Downloads (cumulative)

17,336

Sections

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

1990

Previous Next

Abstract

No abstract available.

Select All

Export Citations Save to Binder

Article

Free

Average case analysis of greedy routing algorithms on arrays

F. T. Leighton

Pages 2–10https://doi.org/10.1145/97444.97448

- 83
- 574
Metrics
Total Citations83
Total Downloads574
Last 12 Months41
Last 6 weeks1

View online with eReader
PDF

Article

Free

Message-passing algorithms for a SIMD torus with coteries

M. Herbordt,
C. Weems,
J. Corbett

Pages 11–20https://doi.org/10.1145/97444.97450

- 4
- 233
Metrics
Total Citations4
Total Downloads233
Last 12 Months14
Last 6 weeks0

View online with eReader
PDF

Article

Free

The chaos router: a practical application of randomization in network routing

S. Konstantinidou,
L. Snyder

Pages 21–30https://doi.org/10.1145/97444.97452

- 33
- 432
Metrics
Total Citations33
Total Downloads432
Last 12 Months18
Last 6 weeks4

View online with eReader
PDF

Article

Free

Tight bounds for oblivious routing in the hypercube

C. Kaklamanis,
D. Krizanc,
T. Tsantilas

Pages 31–36https://doi.org/10.1145/97444.97453

- 57
- 776
Metrics
Total Citations57
Total Downloads776
Last 12 Months81
Last 6 weeks7

View online with eReader
PDF

Article

Free

Running algorithms efficiently on faulty hypercubes

J. Bruck,
R. Cypher,
D. Soroker

Pages 37–44https://doi.org/10.1145/97444.97455

- 22
- 221
Metrics
Total Citations22
Total Downloads221
Last 12 Months12
Last 6 weeks1

View online with eReader
PDF

Article

Free

Routing multiple paths in hypercubes

D. Greenberg,
S. Bhatt

Pages 45–54https://doi.org/10.1145/97444.97457

- 12
- 384
Metrics
Total Citations12
Total Downloads384
Last 12 Months20
Last 6 weeks6

View online with eReader
PDF

Article

Free

Fast algorithms for bit-serial routing on a hypercube

B. Aiello,
F. T. Leighton,
B. Maggs,
M. Newman

Pages 55–64https://doi.org/10.1145/97444.97459

- 25
- 419
Metrics
Total Citations25
Total Downloads419
Last 12 Months61
Last 6 weeks7

View online with eReader
PDF

Article

Free

Low overhead parallel schedules for task graphs

R. Anderson,
P. Beame,
W. Ruzzo

Pages 66–75https://doi.org/10.1145/97444.97460

- 13
- 365
Metrics
Total Citations13
Total Downloads365
Last 12 Months41
Last 6 weeks4

View online with eReader
PDF

Article

Free

Asynchronous shared memory parallel computation

N. Nishimura

Pages 76–84https://doi.org/10.1145/97444.97672

- 40
- 404
Metrics
Total Citations40
Total Downloads404
Last 12 Months33
Last 6 weeks6

View online with eReader
PDF

Article

Free

The expected advantage of asynchrony

R. Cole,
O. Zajicek

Pages 85–94https://doi.org/10.1145/97444.97673

- 42
- 267
Metrics
Total Citations42
Total Downloads267
Last 12 Months32
Last 6 weeks3

View online with eReader
PDF

Article

Free

Parallel algorithms for generating random permutations on a shared memory machine

R. Anderson

Pages 95–102https://doi.org/10.1145/97444.97674

- 19
- 469
Metrics
Total Citations19
Total Downloads469
Last 12 Months84
Last 6 weeks15

View online with eReader
PDF

Article

Free

Processor networks and alternating machines

J. Buss

Pages 103–108https://doi.org/10.1145/97444.97675

- 0
- 229
Metrics
Total Citations0
Total Downloads229
Last 12 Months13
Last 6 weeks2

View online with eReader
PDF

Article

Free

Lower bounds for parallel computation on linked structures

F. Fich,
V. Ramachandran

Pages 109–116https://doi.org/10.1145/97444.97676

- 6
- 309
Metrics
Total Citations6
Total Downloads309
Last 12 Months23
Last 6 weeks5

View online with eReader
PDF

Article

Free

Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM

Torben Hagerup,
T. Radzik

Pages 117–124https://doi.org/10.1145/97444.97677

- 22
- 308
Metrics
Total Citations22
Total Downloads308
Last 12 Months39
Last 6 weeks5

View online with eReader
PDF

Article

Free

Exact time bounds for computing boolean functions on PRAMs without simultaneous writes

M. Dietzfelbinger,
M. Kutylowski,
R. Reischuk

Pages 125–135https://doi.org/10.1145/97444.97678

- 14
- 323
Metrics
Total Citations14
Total Downloads323
Last 12 Months49
Last 6 weeks2

View online with eReader
PDF

Article

Free

Hardware speedups in long integer multiplication

M. Shand,
P. Bertin,
J. Vuillemin

Pages 138–145https://doi.org/10.1145/97444.97679

- 20
- 443
Metrics
Total Citations20
Total Downloads443
Last 12 Months29
Last 6 weeks5

View online with eReader
PDF

Article

Free

Optimal-time multipliers and C-testability

B. Becker,
J. Hartmann

Pages 146–154https://doi.org/10.1145/97444.97680

- 9
- 286
Metrics
Total Citations9
Total Downloads286
Last 12 Months25
Last 6 weeks1

View online with eReader
PDF

Article

Free

Cache coherence for large scale shared memory multiprocessors

M. Thapar,
B. Delagi

Pages 155–160https://doi.org/10.1145/97444.97681

- 2
- 411
Metrics
Total Citations2
Total Downloads411
Last 12 Months20
Last 6 weeks0

View online with eReader
PDF

Article

Free

FLIP-FLOP: a stack-oriented multiprocessing system

P. Grabienski

Pages 161–168https://doi.org/10.1145/97444.97682

- 15
- 359
Metrics
Total Citations15
Total Downloads359
Last 12 Months14
Last 6 weeks0

View online with eReader
PDF

Article

Free

Analysis of multithreaded architectures for parallel computing

R. Saavedra-Barrera,
D. Culler,
T. von Eicken

Pages 169–178https://doi.org/10.1145/97444.97683

- 102
- 818
Metrics
Total Citations102
Total Downloads818
Last 12 Months113
Last 6 weeks17

View online with eReader
PDF

Article

Free

Architectural support for the efficient data-driven evaluation scheme

H. Vin,
F. Berman

Pages 179–187https://doi.org/10.1145/97444.97684

- 0
- 237
Metrics
Total Citations0
Total Downloads237
Last 12 Months14
Last 6 weeks0

View online with eReader
PDF

Article

Free

Utilizing virtual shared memory in a topology independent, multicomputer environment

C. Maples

Pages 188–198https://doi.org/10.1145/97444.97685

- 2
- 263
Metrics
Total Citations2
Total Downloads263
Last 12 Months27
Last 6 weeks2

View online with eReader
PDF

Article

Free

High-probability parallel transitive closure algorithms

J. Ullman,
M. Yannakakis

Pages 200–209https://doi.org/10.1145/97444.97686

- 18
- 1,080
Metrics
Total Citations18
Total Downloads1,080
Last 12 Months73
Last 6 weeks8

View online with eReader
PDF

Article

Free

A randomized parallel algorithm for planar graph isomorphism

H. Gazit,
J. Reif

Pages 210–219https://doi.org/10.1145/97444.97687

- 4
- 500
Metrics
Total Citations4
Total Downloads500
Last 12 Months20
Last 6 weeks1

View online with eReader
PDF

Article

Free

A new preconditioner for the parallel solution of positive definite Toeplitz systems

D. Bini,
F. Benedetto

Pages 220–223https://doi.org/10.1145/97444.97688

- 38
- 572
Metrics
Total Citations38
Total Downloads572
Last 12 Months85
Last 6 weeks10

View online with eReader
PDF

Article

Free

Disjoint paths through a 3-dimensional grid

M. Brady,
D. Brown,
P. McGuinness

Pages 224–233https://doi.org/10.1145/97444.97689

- 1
- 297
Metrics
Total Citations1
Total Downloads297
Last 12 Months22
Last 6 weeks5

View online with eReader
PDF

Article

Free

Parallel construction of near optimal binary trees

D. G. Kirkpatrick,
T. Przytycka

Pages 234–243https://doi.org/10.1145/97444.97690

- 5
- 322
Metrics
Total Citations5
Total Downloads322
Last 12 Months24
Last 6 weeks0

View online with eReader
PDF

Article

Free

Parallel least-squares solution of general and Toeplitz systems

V. Pan

Pages 244–253https://doi.org/10.1145/97444.97691

- 25
- 337
Metrics
Total Citations25
Total Downloads337
Last 12 Months30
Last 6 weeks2

View online with eReader
PDF

Article

Free

On the Euclidean scheme for polynomials having interlaced real zeros

D. Bini,
L. Gemignani

Pages 254–258https://doi.org/10.1145/97444.97692

- 8
- 290
Metrics
Total Citations8
Total Downloads290
Last 12 Months21
Last 6 weeks0

View online with eReader
PDF

Article

Free

Parallel searching in generalized Monge arrays with applications

A. Aggarwal,
D. Kravets,
J. Park,
S. Sen

Pages 259–268https://doi.org/10.1145/97444.97693

- 10
- 389
Metrics
Total Citations10
Total Downloads389
Last 12 Months26
Last 6 weeks3

View online with eReader
PDF

Cited By

Symvonis A and Tidswell J (2019). An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method, IEEE Transactions on Computers, 45:5, (619-625), Online publication date: 1-May-1996.

Save to Binder

Create a New Binder

Name

Contributors

Frank Thomson Leighton
Massachusetts Institute of Technology
- Publication Years1981 - 2007
- Publication counts63
- Citation count1,659
- Available for Download12
- Downloads (cumulative)4,735
- Downloads (12 months)597
- Downloads (6 weeks)38
- Average Downloads per Article395
- Average Citation per Article26
View Full Profile

Index Terms

Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

Comments

Recommendations

SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Read More
SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms
Read More
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms
Read More

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Year	Submitted	Accepted	Rate
SPAA '19	109	34	31%
SPAA '18	120	36	30%
SPAA '17	127	31	24%
SPAA '15	131	31	24%
SPAA '14	122	30	25%
SPAA '13	130	31	24%
SPAA '03	106	38	36%
SPAA '01	93	34	37%
SPAA '00	45	24	53%
SPAA '99	90	26	29%
SPAA '98	84	30	36%
SPAA '97	97	32	33%
SPAA '96	106	39	37%
SPAA '95	101	31	31%
Overall	1,461	447	31%

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Save to Binder

Sections

Cited By

Save to Binder

Index Terms

Recommendations

SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms

SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms

Acceptance Rates