A flexible way of counting large numbers approximately in small registers (English)
National licence
- New search for: Kruskal, J. B.
- New search for: Greenberg, A. G.
- New search for: Kruskal, J. B.
- New search for: Greenberg, A. G.
In:
Algorithmica
;
6
, 1
;
590-596
;
1991
- Article (Journal) / Electronic Resource
-
Title:A flexible way of counting large numbers approximately in small registers
-
Contributors:Kruskal, J. B. ( author ) / Greenberg, A. G. ( author )
-
Published in:Algorithmica ; 6, 1 ; 590-596
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:New York
-
Publication date:1991-06-01
-
Size:7 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 6, Issue 1
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Editors' introductionLaPaugh, Andrea / Leighton, Tom et al. | 1991
- 5
-
Retiming synchronous circuitryLeiserson, Charles E. / Saxe, James B. et al. | 1991
- 37
-
Partitioning circuits for improved testabilityBhatt, Sandeep N. / Chung, Fan R. K. / Rosenberg, Arnold L. et al. | 1991
- 49
-
Optimal tradeoffs for addition on systolic arraysAggarwal, Alok / Carter, J. Lawrence / Kosaraju, S. Rao et al. | 1991
- 73
-
Multiterminal global routing: A deterministic approximation schemeRaghavan, Prabhakar / Thompson, Clark D. et al. | 1991
- 83
-
Optimal multilayer channel routing with overlapBrady, Martin L. / Brown, Donna J. et al. | 1991
- 103
-
A generic algorithm for one-dimensional homotopic compactionMiller Maley, F. et al. | 1991
- 129
-
Multilayer grid embeddings for VLSIAggarwal, Alok / Klawe, Maria / Shor, Peter et al. | 1991
- 153
-
Search directions for interior linear-programming methodsGonzaga, Clovis C. et al. | 1991
- 182
-
Moving a disc between polygonsRohnert, Hans et al. | 1991
- 192
-
Probabilistic analysis of a grouping algorithmWong, D. F. / Reingold, Edward M. et al. | 1991
- 207
-
AnO(n logn) plane-sweep algorithm forL 1 andL ∞ Delaunay triangulationsShute, Gary M. / Deneen, Linda L. / Thomborson, Clark D. et al. | 1991
- 222
-
FFD bin packing for item sizes with uniform distributions on [0, 1/2]Floyd, Sally / Karp, Richard M. et al. | 1991
- 241
-
A lower bound on the area of permutation layoutsAggarwal, Alok / Klawe, Maria / Lichtenstein, David / Linial, Nathan / Wigderson, Avi et al. | 1991
- 256
-
On the height of digital trees and related problemsSzpankowski, Wojciech et al. | 1991
- 278
-
Stochastic rearrangement rules for self-organizing data structuresKapoor, Sanjiv / Reingold, Edward M. et al. | 1991
- 292
-
An optimal algorithm for the boundary of a cell in a union of rays—corrigendumAlevizos, Panagiotis / Boissonnat, Jean -Daniel / Preparata, Franco P. et al. | 1991
- 295
-
Editor's forewordSangiovanni-Vincentelli, Alberto et al. | 1991
- 302
-
A theoretical framework for simulated annealingRomeo, Fabio / Sangiovanni-Vincentelli, Alberto et al. | 1991
- 346
-
Analysis of finite length annealing schedulesStrenski, Philip N. / Kirkpatrick, Scott et al. | 1991
- 367
-
Efficient simulated annealing on fractal energy landscapesSorkin, Gregory B. et al. | 1991
- 419
-
Simulated annealing type algorithms for multivariate optimizationGelfand, Saul B. / Mitter, Sanjoy K. et al. | 1991
- 437
-
Boltzmann machines as a model for parallel annealingAarts, Emile H. L. / Korst, Jan H. M. et al. | 1991
- 466
-
Stochastic neural networksWong, Eugene et al. | 1991
- 479
-
Large parallel machines can be extremely slow for small problemsGrolmusz, Vince et al. | 1991
- 490
-
Order-k voronoi diagrams of sites with additive weights in the planeRosenberger, Harald et al. | 1991
- 522
-
On sorting triangles in a delaunay tessellationFloriani, Leila / Falcidieno, Bianca / Nagy, George / Pienovi, Caterina et al. | 1991
- 533
-
Convex hulls of objects bounded by algebraic curvesBajaj, Chanderjit / Kim, Myung -Soo et al. | 1991
- 554
-
Parallel sorting on cayley graphsGordon, Daniel M. et al. | 1991
- 565
-
Optimal algorithms for adjacent side routingWu, S. Alice / JáJá, Joseph et al. | 1991
- 579
-
Refinements to nearest-neighbor searching ink-dimensional treesSproull, Robert F. et al. | 1991
- 590
-
A flexible way of counting large numbers approximately in small registersKruskal, J. B. / Greenberg, A. G. et al. | 1991
- 597
-
Maximum queue size and hashing with lazy deletionKenyon, Claire M. / Vitter, Jeffrey Scott et al. | 1991
- 621
-
Editor's foreword special issue on parallel algorithms for geometric problems on digitized picturesDehne, Frank et al. | 1991
- 624
-
Finding a minimal cover for binary images: An optimal parallel algorithmMoitra, Dipen et al. | 1991
- 658
-
Computing convexity properties of images on a pyramid computerMiller, Russ / Stout, Quentin F. et al. | 1991
- 685
-
Parallel computation of disease transformsSchwarzkopf, Otfried et al. | 1991
- 698
-
Processor-time optimal parallel algorithms for digitized images on mesh-connected processor arraysAlnuweiri, Hussein M. / Prasanna Kumar, V. K. et al. | 1991
- 734
-
Computational geometry algorithms for the systolic screenDehne, F. / Hassenklover, A. -L. / Sack, J. -R. / Santoro, N. et al. | 1991
- 762
-
Topological numbering of features on a meshAtallah, Mikhail J. / Hambrusch, Susanne E. / TeWinkel, Lynn E. et al. | 1991
- 771
-
On partitioning rectilinear polygons into star-shaped polygonsLiu, Robin / Ntafos, Simeon et al. | 1991
- 801
-
An efficient parallel algorithm for computing a large independent set in a planar graphChrobak, Marek / Naor, Joseph et al. | 1991
- 816
-
A strongly competitive randomized paging algorithmMcGeoch, Lyle A. / Sleator, Daniel D. et al. | 1991
- 826
-
Chain packing in graphsMasuyama, Shigeru / Ibaraki, Toshihide et al. | 1991
- 840
-
Dividedk-d treesKreveld, Marc J. / Overmars, Mark H. et al. | 1991
- 859
-
Deterministic parallel list rankingAnderson, Richard J. / Miller, Gary L. et al. | 1991
- 869
-
Heuristics for rapidly four-coloring large planar graphsMorgenstern, Craig A. / Shapiro, Henry D. et al. | 1991