Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 13
Volume 13, Number 1, March 1992
- Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. 2-32
- David Eppstein, Giuseppe F. Italiano
, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. 33-54 - Maria M. Klawe:
Superlinear Bounds for Matrix Searching Problems. 55-78 - Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. 79-98 - Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects. 99-113 - Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. 114-127 - Leslie Ann Goldberg:
Efficient Algorithms for Listing Unlabeled Graphs. 128-143 - Peter Avery:
An Algorithmic Proof that Semiorders are Representable. 144-147 - Daniel S. Hirschberg, Lawrence L. Larmore:
The Traveler's Problem. 148-160 - Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph. 161-174
Volume 13, Number 2, June 1992
- P. P. Chakrabarti, Sujoy Ghose:
A General Best First Search Algorithm in AND/OR Graphs. 177-187 - Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
Single Round Simulation on Radio Networks. 188-210 - Robert Cypher, Jorge L. C. Sanz:
Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters. 211-234 - K. V. S. Ramarao, S. Venkatesan:
On Finding and Updating Shortest Paths Distributively. 235-257 - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. 258-273 - Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane. 274-296 - Kenneth D. Blaha:
Minimum Bases for Permutation Groups: The Greedy Approximation. 297-306 - Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. 307-319 - Michael Lindenbaum, Alfred M. Bruckstein:
Parallel Strategies for Geometric Probing. 320-349
Volume 13, Number 3, September 1992
- Daniel M. Yellin:
Representing Sets with Constant Time Equality Testing. 353-373 - J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement. 374-393 - Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. 394-413 - Frank Ruskey, Carla D. Savage, Terry Min Yih Wang:
Generating Necklaces. 414-430 - Sandra Fillebrown:
Faster Computation of Bernoulli Numbers. 431-445 - Alberto Apostolico, Wojciech Szpankowski:
Self-Alignments in Words and Their Applications. 446-467 - Frank K. Hwang, J. F. Weng:
The Shortest Network under a Given Topology. 468-488 - Uzi Vishkin:
A Parallel Blocking Flow Algorithm for Acyclic Networks. 489-501 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 502-524
Volume 13, Number 4, December 1992
- Hugo Krawczyk:
How to Predict Congruential Generators. 527-545 - Anath Fischer, Itzhak Gilboa, Moshe Shpitalni:
A Polynomial Algorithm for Minimal Interval Representation. 546-563 - Grazia Lotti:
Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers. 564-576 - Amir Averbuch, Nader H. Bshouty, Michael Kaminski:
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. 577-588 - Keqin Li, Kam-Hoi Cheng:
Heuristic Algorithms for On-Line Packing in Three Dimensions. 589-605 - Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:
Variable-Priority Queue and Doughnut Routing. 606-635 - Yitzhak Birk, Jeffrey B. Lotspiech:
On Finding Non-Intersecting Straightline Connections of Grid Points to the Boundary. 636-656 - Sundar Vishwanathan:
Randomized Online Graph Coloring. 657-669 - Siu-Wing Cheng, Ravi Janardan:
Algorithms for Ray-Shooting and Intersection Searching. 670-692 - Jeff Chu:
Optimal Algorithm for the Nearest Common Dominator Problem. 693-697
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-25 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
