Search results for "SWAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Joan Boyar, Kim S. Larsen	Efficient Rebalancing of Chromatic Search Trees.	SWAT	1992	DBLP DOI BibTeX RDF
1	Rusins Freivalds, Carl H. Smith	Memory Limited Inductive Inference Machines.	SWAT	1992	DBLP DOI BibTeX RDF
1	Goos Kant, Hans L. Bodlaender	Triangulating Planar Graphs While Minimizing the Maximum Degree.	SWAT	1992	DBLP DOI BibTeX RDF
1	Nicholas Pippenger	An Elementary Approach to Some Analytic Asymptotics.	SWAT	1992	DBLP DOI BibTeX RDF
1	Ton Kloks, Hans L. Bodlaender	Testing Superperfection of k-Trees.	SWAT	1992	DBLP DOI BibTeX RDF
1	Gaston H. Gonnet	Efficient Two-dimensional Searching.	SWAT	1992	DBLP DOI BibTeX RDF
1	Ola Petersson, Alistair Moffat	A Framework for Adaptive Sorting.	SWAT	1992	DBLP DOI BibTeX RDF
1	Mark de Berg, Marc J. van Kreveld, Jack Snoeyink	Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract).	SWAT	1992	DBLP DOI BibTeX RDF
1	Andreas Jakoby, Rüdiger Reischuk	The Complexity of Scheduling Problems with Communication Delays for Trees.	SWAT	1992	DBLP DOI BibTeX RDF
1	Xin He	Parallel Algorithm for Cograph Recognition with Applications.	SWAT	1992	DBLP DOI BibTeX RDF
1	Martin Fürer, C. R. Subramanian 0001	Coloring Random Graphs.	SWAT	1992	DBLP DOI BibTeX RDF
1	Michael Kaufmann 0001, Jop F. Sibeyn	Optimal Multi-Packet Routing on the Torus.	SWAT	1992	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon	Star Unfolding of a Polytope with Applications (Extended Abstract).	SWAT	1990	DBLP DOI BibTeX RDF
1	Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal	Intersection Queries in Sets of Disks.	SWAT	1990	DBLP DOI BibTeX RDF
1	Arne Andersson, Tony W. Lai	Fast Updating of Well-Balanced Trees.	SWAT	1990	DBLP DOI BibTeX RDF
1	John Hershberger 0001, Subhash Suri	Applications of a Semi-Dynamic Convex Hull Algorithm.	SWAT	1990	DBLP DOI BibTeX RDF
1	John Hershberger 0001	Upper Envelope Onion Peeling.	SWAT	1990	DBLP DOI BibTeX RDF
1	Gert Vegter	The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning.	SWAT	1990	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani	Expected Behaviour Analysis of AVL Trees.	SWAT	1990	DBLP DOI BibTeX RDF
1	Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars	Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.	SWAT	1990	DBLP DOI BibTeX RDF
1	Juris Hartmanis, Richard Chang 0001, Desh Ranjan, Pankaj Rohatgi	Structural Complexity Theory: recent Surprises.	SWAT	1990	DBLP DOI BibTeX RDF
1	David S. Johnson	Data Structures for Traveling Salesmen (Abstract).	SWAT	1990	DBLP DOI BibTeX RDF
1	Goos Kant, Jan van Leeuwen	The File Distribution Problem for Processor Networks.	SWAT	1990	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Mireille Régnier	Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version).	SWAT	1990	DBLP DOI BibTeX RDF
1	Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec	Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.	SWAT	1990	DBLP DOI BibTeX RDF
1	Samuel W. Bent	Ranking Trees Generated by Rotations.	SWAT	1990	DBLP DOI BibTeX RDF
1	Thomas Ottmann, Derick Wood	How to Update a Balanced Binary Tree with a Constant Number of Rotations.	SWAT	1990	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Mark A. Williams	On Matroids and Hierarchical Graphs.	SWAT	1990	DBLP DOI BibTeX RDF
1	Haijo Schipper, Mark H. Overmars	Dynamic Partition Trees.	SWAT	1990	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Andrzej Lingas	Fast Algorithms for Greedy Triangulation.	SWAT	1990	DBLP DOI BibTeX RDF
1	David Fernández-Baca	Space-Sweep Algorithms for Parametric Optimization (Extended Abstract).	SWAT	1990	DBLP DOI BibTeX RDF
1	Paul F. Dietz, Ju Zhang	Lower Bounds for Monotonic List Labeling.	SWAT	1990	DBLP DOI BibTeX RDF
1	Nickolay M. Korneenko, Horst Martini	Approximating Finite Weighted Point Sets by Hyperplanes.	SWAT	1990	DBLP DOI BibTeX RDF
1	Per Grape	Complete Problems With L-samplable Distributions.	SWAT	1990	DBLP DOI BibTeX RDF
1	David Eppstein	Finding the k Smallest Spanning Trees.	SWAT	1990	DBLP DOI BibTeX RDF
1	Michel Pocciola	Graphics in Flatland Revisited.	SWAT	1990	DBLP DOI BibTeX RDF
1	John R. Gilbert, Rolf G. Karlsson (eds.)	SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings	SWAT	1990	DBLP DOI BibTeX RDF
1	Ravi B. Boppana, Magnús M. Halldórsson	Approximating Maximum Independent Sets by Excluding Subgraphs.	SWAT	1990	DBLP DOI BibTeX RDF
1	Jorma Tarhio, Esko Ukkonen	Boyer-Moore Approach to Approximate String Matching (Extended Abstract).	SWAT	1990	DBLP DOI BibTeX RDF
1	Dana S. Richards, Jeffrey S. Salowe	A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.	SWAT	1990	DBLP DOI BibTeX RDF
1	Joseph Friedman, John Hershberger 0001, Jack Snoeyink	Input-Sensitive Compliant Motion in the Plane.	SWAT	1990	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Ola Petersson	Sorting Shuffled Monotone Sequences.	SWAT	1990	DBLP DOI BibTeX RDF	presortedness, shuffled sequences, optimality, measures, sorting algorithm
1	Thomas Papadakis, J. Ian Munro, Patricio V. Poblete	Analysis of the Expected Search Cost in Skip Lists.	SWAT	1990	DBLP DOI BibTeX RDF
1	Ingo Althöfer, Gautam Das 0001, David P. Dobkin, Deborah Joseph	Generating Sparse Spanners for Weighted Graphs.	SWAT	1990	DBLP DOI BibTeX RDF
1	Mark de Berg	Translating Polygons with Applications to Hidden Surface Removal.	SWAT	1990	DBLP DOI BibTeX RDF	separation problems, relative convex hulls, Computational geometry, hidden surface removal
1	Hans L. Bodlaender, Rolf H. Möhring	The Pathwidth and Treewidth of Cographs.	SWAT	1990	DBLP DOI BibTeX RDF
1	Stefan Arnborg, Andrzej Proskurowski	Canonical Representation of Partial 2- and 3-Trees.	SWAT	1990	DBLP DOI BibTeX RDF
1	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.	SWAT	1990	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah	A Faster Parallel Algorithm for a Matrix Searching Problem.	SWAT	1990	DBLP DOI BibTeX RDF
1	Sven-Olai Høyland	Bin-Packing in 1.5 Dimension.	SWAT	1988	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic	A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors.	SWAT	1988	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.	SWAT	1988	DBLP DOI BibTeX RDF	Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees
1	J. Mark Keil	Approximating the Complete Euclidean Graph.	SWAT	1988	DBLP DOI BibTeX RDF
1	Tony W. Lai, Derick Wood	Implicit Selection.	SWAT	1988	DBLP DOI BibTeX RDF
1	Mark H. Overmars	Connectability Problems.	SWAT	1988	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, Mark H. Overmars, Micha Sharir	Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques.	SWAT	1988	DBLP DOI BibTeX RDF
1	Walter Cunto, Patricio V. Poblete	Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.	SWAT	1988	DBLP DOI BibTeX RDF
1	Wojciech Szpankowski	On an Alternative Sum Useful in the Analysis of Some Data Structures.	SWAT	1988	DBLP DOI BibTeX RDF
1	John R. Gilbert, Hjálmtyr Hafsteinsson	Parallel Solution of Space Linear Systems.	SWAT	1988	DBLP DOI BibTeX RDF
1	Subir Kumar Ghosh	On Recognizing and Characterizing Visibility Graphs of Simple Polygons.	SWAT	1988	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins	Searching with Uncertainty (Extended Abstract).	SWAT	1988	DBLP DOI BibTeX RDF
1	Derick Wood	Extremal Cost Tree Data Structures.	SWAT	1988	DBLP DOI BibTeX RDF
1	Maciej M. Syslo, Pawel Winter	Independent Covers in Outerplanar Graphs.	SWAT	1988	DBLP DOI BibTeX RDF
1	Hristo N. Djidjev	Linear Algorithms for Graph Separation Problems.	SWAT	1988	DBLP DOI BibTeX RDF
1	Vijay V. Vazirani	NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems.	SWAT	1988	DBLP DOI BibTeX RDF
1	R. P. Krishnaswamy, Chul E. Kim	Problems of Posting Sentries: Variations on the Art Gallery Theorem.	SWAT	1988	DBLP DOI BibTeX RDF
1	Elias Dahlhaus, Marek Karpinski	A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).	SWAT	1988	DBLP DOI BibTeX RDF
1	Rolf G. Karlsson, Andrzej Lingas (eds.)	SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings	SWAT	1988	DBLP DOI BibTeX RDF
1	Svante Carlsson, J. Ian Munro, Patricio V. Poblete	An Implicit Binomial Queue with Constant Insertion Time.	SWAT	1988	DBLP DOI BibTeX RDF
1	Oliver Günther 0001	A Lower Bound and Two Approximate Algorithms for the K-Partitioning of Rectilinear Polygons.	SWAT	1988	DBLP DOI BibTeX RDF
1	Chee-Keng Yap	Applications of a Symbolic Perturbation Scheme (Abstract).	SWAT	1988	DBLP DOI BibTeX RDF
1	Lars Draws, Patrik Eriksson, Erik Forslund, Leif Höglund, Sören Vallner, Thomas Strothotte	Two New Algorithms for Constructing Min-Max Heaps.	SWAT	1988	DBLP DOI BibTeX RDF
1	Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert	Upper and Lower Bounds for the Dictionary Problem (Abstract).	SWAT	1988	DBLP DOI BibTeX RDF
1	Svante Carlsson, Christer Mattsson	An Extrapolation on the Interpolation Search.	SWAT	1988	DBLP DOI BibTeX RDF
1	Heikki Mannila, Esko Ukkonen	Time Parameter and Arbitrary Deunions in the Set Union Problem.	SWAT	1988	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas	An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.	SWAT	1988	DBLP DOI BibTeX RDF	bucket method, cell technique, parallel algorithms, computational geometry, Voronoi diagram
1	Andrzej Proskurowski, Frank Ruskey	Generating Binary Trees by Transpositions.	SWAT	1988	DBLP DOI BibTeX RDF
1	Mark Allen Weiss, Robert Sedgewick	Tight Lower Bounds for Shellsort.	SWAT	1988	DBLP DOI BibTeX RDF
1	Lefteris M. Kirousis, Paul G. Spirakis	Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P.	SWAT	1988	DBLP DOI BibTeX RDF
1	Nobuki Tokura, Tadao Kasami, Shukichi Furuta	Ianov Schemas Augmented by a Pushdown Memory	SWAT	1974	DBLP DOI BibTeX RDF
1	Andrew Chi-Chih Yao	Bounds on Selection Networks	SWAT	1974	DBLP DOI BibTeX RDF
1	Robert P. Daley	Non-Complex Sequences: Characterizations and Examples	SWAT	1974	DBLP DOI BibTeX RDF
1	John P. Hayes	Minimization of Fanout in Switching Networks	SWAT	1974	DBLP DOI BibTeX RDF
1	Armin B. Cremers, Seymour Ginsburg	Characterization of Context-Free Grammatical Families	SWAT	1974	DBLP DOI BibTeX RDF
1	Edmund A. Lamagna, John E. Savage	Combinational Complexity of Some Monotone Functions	SWAT	1974	DBLP DOI BibTeX RDF
1	H. T. Kung 0001	On the Computational Complexity of Finding the Maxima of a Set of Vectors	SWAT	1974	DBLP DOI BibTeX RDF
1	Pawel Kerntopf	On Boolean Functions Having Maximal Number of Subfunction Classes	SWAT	1974	DBLP DOI BibTeX RDF
1	Ronald L. Rivest	On Self-Organizing Sequential Search Heuristics	SWAT	1974	DBLP DOI BibTeX RDF
1	Zvi Galil	Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation	SWAT	1974	DBLP DOI BibTeX RDF
1	Juris Hartmanis, Janos Simon	On the Power of Multiplication in Random Access Machines	SWAT	1974	DBLP DOI BibTeX RDF
1	Sartaj Sahni, Teofilo F. Gonzalez	P-Complete Problems and Approximate Solutions	SWAT	1974	DBLP DOI BibTeX RDF
1	Alan J. Demers	Skeletal LR Parsing	SWAT	1974	DBLP DOI BibTeX RDF
1	José Lucas Rangel	The Equivalence Problem for Regular Expressions over one Letter Is Elementary	SWAT	1974	DBLP DOI BibTeX RDF
1	Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman	Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)	SWAT	1974	DBLP DOI BibTeX RDF
1	Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman	Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)	SWAT	1974	DBLP DOI BibTeX RDF
1	Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein	A Comparative Study of Models of Parallel Computation	SWAT	1974	DBLP DOI BibTeX RDF
1	Theodore P. Baker	"Natural" Properties of Flowchart Complexity Measures	SWAT	1974	DBLP DOI BibTeX RDF
1	Ronald L. Rivest	On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)	SWAT	1974	DBLP DOI BibTeX RDF
1	Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II	Approximate Algorithms for the Traveling Salesperson Problem	SWAT	1974	DBLP DOI BibTeX RDF
1	Jack W. Carlyle, Sheila A. Greibach, Azaria Paz	A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)	SWAT	1974	DBLP DOI BibTeX RDF

Publications at "SWAT"( http://dblp.L3S.de/Venues/SWAT )