SODA

researchr

You are not signed in
Sign in
Sign up

SODA. 1990.

Conference: soda 1990

Abstract is missing.

1	-	11	Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph
			David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
12	-	21	Incremental Algorithms for Minimal Length Paths
			Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
22	-	31	A Data Structure for Arc Insertion and Regular Path Finding
			Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter
32	-	42	Incremental Evaluation of Computational Circuits
			Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck
43	-	53	Multilevel Adaptive Hashing
			Andrei Z. Broder, Anna R. Karlin
64	-	73	Representing Sets with Constant Time Equality Testing
			Daniel M. Yellin
74	-	83	Efficient Maintenance of the Union Intervals on a Line, with Applications
			Siu-Wing Cheng, Ravi Janardan
84	-	90	New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems
			Kenneth J. Supowit
91	-	99	Experiments on Traveling Salesman Heuristics
			Jon Louis Bentley
107	-	117	Visibility with a Moving Point of View
			Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
118	-	128	Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry
			Michael T. Goodrich
129	-	137	An Efficiently Computable Metric for Comparing Polygonal Shapes
			Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
138	-	148	Embedding Planar Graphs on the Grid
			Walter Schnyder
149	-	158	An Optimal Algorithm for the Maximum Two-Chain Problem
			Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee
159	-	168	A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions
			Robert L. (Scot) Drysdale III
169	-	178	Compact Interval Trees: A Data Structure for Convex Hulls
			Leonidas J. Guibas, John Hershberger, Jack Snoeyink
179	-	187	Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls
			Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
194	-	200	Asymptotically Fast Triangularization of Matrices Over Rings
			James L. Hafner, Kevin S. McCurley
201	-	211	Factor Refinement
			Eric Bach, James R. Driscoll, Jeffrey Shallit
212	-	218	Parallel Search for Maximal Independence Given Minimal Dependence
			Paul Beame, Michael Luby
219	-	225	An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size
			Mark K. Goldberg, Thomas H. Spencer
226	-	235	Coloration Neighborhood Structures for General Graph Coloring
			Craig A. Morgenstern, Harry Shapiro
236	-	243	Approximation Algorithms for the Maximum Acyclic Subgraph Problem
			Bonnie Berger, Peter W. Shor
244	-	251	Fast Parallel Algorithms for the Clique Separator Decomposition
			Elias Dahlhaus, Marek Karpinski, Mark B. Novick
252	-	260	Split Decomposition of Undirected Graphs
			Tze-Heng Ma, Jeremy Spinrad
272	-	279	First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space
			Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton
280	-	290	A Competitive 3-Server Algorithm
			Piotr Berman, Howard J. Karloff, Gábor Tardos
291	-	300	title=New Results on Server Problems
			Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
301	-	309	Competitive Randomized Algorithms for Non-Uniform Problems
			Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki
310	-	318	Length-Limited Coding
			Lawrence L. Larmore, Daniel S. Hirschberg
319	-	327	Suffix Arrays: A New Method for On-Line String Searches
			Udi Manber, Gene Myers
328	-	343	Analysis of Boyer-Moore-Type String Searching Algorithms
			Ricardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier
344	-	357	Efficient Pattern Matching with Scaling
			Amihood Amir, Gad M. Landau, Uzi Vishkin
358	-	366	Characterization and Algorithms for Greedily Solvable Transportation Problems
			Ron Shamir, Brenda L. Dietrich
367	-	376	Improved Dual Network Simplex
			Serge A. Plotkin, Éva Tardos
377	-	387	Using Separation Algorithms in Fixed Dimension
			Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
397	-	404	Stable Husbands
			Donald E. Knuth, Rajeev Motwani, Boris Pittel
411	-	421	On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them
			Arkady Kanevsky
422	-	433	Efficient Algorithms for Generalized Cut Trees
			Dan Gusfield, Dalit Naor
434	-	443	Data Structures for Weighted Matching and Nearest Common Ancestors with Linking
			Harold N. Gabow
475	-	484	Determining the Evolutionary Tree
			Sampath Kannan, Eugene L. Lawler, Tandy Warnow
485	-	493	Superlinear Bounds on Matrix Searching
			Maria M. Klawe
494	-	502	Selection and Sorting in Totally Monotone Arrays
			Dina Kravets, James K. Park
503	-	512	On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure
			Lawrence L. Larmore, Baruch Schieber
513	-	522	Sparse Dynamic Programming
			David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano

External Links

Cite Key

Tags

Statistics

Abstract

Table of Contents