|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
13 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | All Pairs Shortest Paths for Graphs with Small Integer Length Edges |
Galil, Zvi |
1997 |
54 | 2 |
p. 243-254 12 p. |
artikel |
|
| 2 | A Spectrum of Time–Space Trade-offs for Undirecteds-tConnectivity |
Feige, Uriel |
1997 |
54 | 2 |
p. 305-316 12 p. |
artikel |
|
| 3 | Better Lower Bounds for Monotone Threshold Formulas |
Radhakrishnan, Jaikumar |
1997 |
54 | 2 |
p. 221-226 6 p. |
artikel |
|
| 4 | Breaking theΘ(n log2 n) Barrier for Sorting with Faults |
Leighton, Tom |
1997 |
54 | 2 |
p. 265-304 40 p. |
artikel |
|
| 5 | Connected Components inO(log3/2 n) Parallel Time for the CREW PRAM |
Johnson, Donald B |
1997 |
54 | 2 |
p. 227-242 16 p. |
artikel |
|
| 6 | EDITOR'S FOREWORD |
Epstein, David |
1997 |
54 | 2 |
p. 263- 1 p. |
artikel |
|
| 7 | EDITOR'S FOREWORD |
Sipser, Michael |
1997 |
54 | 2 |
p. 213- 1 p. |
artikel |
|
| 8 | Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers |
Leiserson, Charles E. |
1997 |
54 | 2 |
p. 332-344 13 p. |
artikel |
|
| 9 | Fully Parallelized Multi-prover Protocols for NEXP-Time |
Lapidot, Dror |
1997 |
54 | 2 |
p. 215-220 6 p. |
artikel |
|
| 10 | Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution |
Blum, Avrim L. |
1997 |
54 | 2 |
p. 371-380 10 p. |
artikel |
|
| 11 | On the Exponent of the All Pairs Shortest Path Problem |
Alon, Noga |
1997 |
54 | 2 |
p. 255-262 8 p. |
artikel |
|
| 12 | The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations |
Arora, Sanjeev |
1997 |
54 | 2 |
p. 317-331 15 p. |
artikel |
|
| 13 | When Can We Sort ino(n log n) Time? |
Ben-Amram, Amir M. |
1997 |
54 | 2 |
p. 345-370 26 p. |
artikel |
13 gevonden resultaten