Search results for "SWAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Christos Levcopoulos, Anna Östlin	Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro	Communication Complexity of Gossiping by Packets.	SWAT	1996	DBLP DOI BibTeX RDF
1	Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama	Greedily Finding a Dense Subgraph.	SWAT	1996	DBLP DOI BibTeX RDF
1	Monika Rauch Henzinger, Jan Arne Telle	Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.	SWAT	1996	DBLP DOI BibTeX RDF
1	Rolf Fagerberg	Binary Search Trees: How Low Can You Go?	SWAT	1996	DBLP DOI BibTeX RDF
1	Thore Husfeldt, Theis Rauhe, Søren Skyum	Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching.	SWAT	1996	DBLP DOI BibTeX RDF
1	Takao Asano, Takao Ono, Tomio Hirata	Approximation Algorithms for the Maximum Satisfiability Problem.	SWAT	1996	DBLP DOI BibTeX RDF
1	Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer	Vertex Partitioning Problems On Partial k-Trees.	SWAT	1996	DBLP DOI BibTeX RDF
1	Andrej Brodnik, J. Ian Munro	Neighbours on a Grid.	SWAT	1996	DBLP DOI BibTeX RDF
1	Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad	Visibility with Multiple Reflections.	SWAT	1996	DBLP DOI BibTeX RDF
1	Teresa M. Przytycka, Lisa Higham	Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm.	SWAT	1996	DBLP DOI BibTeX RDF
1	R. Ravi 0001, Michel X. Goemans	The Constrained Minimum Spanning Tree Problem (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal	Priority Queues on Parallel Machines.	SWAT	1996	DBLP DOI BibTeX RDF
1	Hoong Chuin Lau, Osamu Watanabe 0001	Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara	On the Hardness of Approximating the Minimum Consistent OBDD Problem.	SWAT	1996	DBLP DOI BibTeX RDF
1	Gaston H. Gonnet, Steven A. Benner	Probabilistic Ancestral Sequences and Multiple Alignments.	SWAT	1996	DBLP DOI BibTeX RDF
1	Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina	The Deterministic Complexity of Parallel Multisearch (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Rolf G. Karlsson, Andrzej Lingas (eds.)	Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings	SWAT	1996	DBLP DOI BibTeX RDF
1	Barun Chandra, Magnús M. Halldórsson	Facility Dispersion and Remote Subgraphs.	SWAT	1996	DBLP DOI BibTeX RDF
1	Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.	SWAT	1996	DBLP DOI BibTeX RDF
1	Noga Alon	Derandomization Via Small Sample Spaces (Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle	Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.	SWAT	1996	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter	Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Drago Krznaric	A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
1	Therese C. Biedl	Optimal Orthogonal Drawings of Triconnected Plane Graphs.	SWAT	1996	DBLP DOI BibTeX RDF
1	Pierre Kelsen	Neighborhood Graphs and Distributed Delta+1-Coloring.	SWAT	1996	DBLP DOI BibTeX RDF
1	Mike Paterson	Progress in Selection.	SWAT	1996	DBLP DOI BibTeX RDF
1	Madhav V. Marathe, R. Ravi 0001, Ravi Sundaram	Service-Constrained Network Design Problems.	SWAT	1996	DBLP DOI BibTeX RDF
1	Arne Andersson	Sorting and Searching Revisted.	SWAT	1996	DBLP DOI BibTeX RDF
1	Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan	Approximate Hypergraph Coloring.	SWAT	1996	DBLP DOI BibTeX RDF
1	Sonne Preminger, Eli Upfal	Safe and Efficient Traffic Laws for Mobile Robots.	SWAT	1996	DBLP DOI BibTeX RDF
1	Endre Boros, Toshihide Ibaraki, Kazuhisa Makino	Boolean Analysis of Incomplete Examples.	SWAT	1996	DBLP DOI BibTeX RDF
1	Alejandro López-Ortiz, Sven Schuierer	Walking Streets Faster.	SWAT	1996	DBLP DOI BibTeX RDF
1	Yossi Azar, Leah Epstein	On Two Dimensional Packing.	SWAT	1996	DBLP DOI BibTeX RDF
1	Stephen Alstrup, Mikkel Thorup	Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.	SWAT	1996	DBLP DOI BibTeX RDF
1	Hartmut Klauck	On the Hardness of Global and Local Approximation.	SWAT	1996	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Giora Slutzki, David Eppstein	Using Sparsification for Parametric Minimum Spanning Tree Problems.	SWAT	1996	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan	The Randomized Complexity of Maintaining the Minimum.	SWAT	1996	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert 0001	Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.	SWAT	1994	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Goos Kant, Michael Kaufmann 0001	On Triangulating Planar Graphs under the Four-Connectivity Constraint.	SWAT	1994	DBLP DOI BibTeX RDF
1	Cynthia A. Phillips, Clifford Stein 0001, Joel Wein	Task Scheduling in Networks (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
1	Lisa Higham, Teresa M. Przytycka	Asymptotically Optimal Election on Weighted Rings.	SWAT	1994	DBLP DOI BibTeX RDF
1	Sven Schuierer	Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.	SWAT	1994	DBLP DOI BibTeX RDF
1	Stefan Felsner, Rudolf Müller, Lorenz Wernisch	Trapezoid Graphs and Generalizations, Geometry and Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF	trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension
1	Michael L. Fredman	Lower Bounds for Dynamic Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF
1	Johan Håstad	Recent Results in Hardness of Approximation.	SWAT	1994	DBLP DOI BibTeX RDF
1	Marina Papatriantafilou, Philippas Tsigas	On Self-Stabilizing Wait-Free Clock Synchronization.	SWAT	1994	DBLP DOI BibTeX RDF	PRAM computation model, Fault tolerance, Concurrency, Distributed Computing, Synchronization, Self-Stabilization, Synchronous Systems, Wait-Free Synchronization, Digital Clocks
1	Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener	Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF	parallel computations, communication algorithms
1	Ben H. H. Juurlink, Harry A. G. Wijshoff	The Parallel Hierarchical Memory Model.	SWAT	1994	DBLP DOI BibTeX RDF	algorithms, data locality, Hierarchical memory
1	Pankaj K. Agarwal, Sandeep Sen	Selection in Monotone Matrices and Computing kth Nearest Neighbors.	SWAT	1994	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Giora Slutzki	Optimal Parametric Search on Graphs of Bounded Tree-Width.	SWAT	1994	DBLP DOI BibTeX RDF
1	Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter	Parallel and Sequential Approximations of Shortest Superstrings.	SWAT	1994	DBLP DOI BibTeX RDF
1	Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi 0001, Leen Stougie, Maurizio Talamo	Serving Requests with On-line Routing.	SWAT	1994	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Geometric Algorithms (Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
1	Xiao Zhou 0001, Shin-Ichi Nakano, Takao Nishizeki	A Parallel Algorithm for Edge-Coloring Partial k-Trees.	SWAT	1994	DBLP DOI BibTeX RDF
1	Piotr Berman, Andrzej Lingas	A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
1	Marcus Peinado	Hard Graphs for Randomized Subgraph Exclusion Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF
1	Arvind Gupta, Naomi Nishimura	Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees.	SWAT	1994	DBLP DOI BibTeX RDF
1	Erik Schenk	Parallel Dynamic Lowest Common Ancestors.	SWAT	1994	DBLP DOI BibTeX RDF
1	Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid	On Intersection Searching Problems Involving Curved Objects.	SWAT	1994	DBLP DOI BibTeX RDF
1	Mikkel Thorup	Efficient Preprocessing of Simple Binary Pattern Forests.	SWAT	1994	DBLP DOI BibTeX RDF
1	Susanne Albers, Hisashi Koga	New On-Line Algorithms for the Page Replication Problem.	SWAT	1994	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir	Computing Depth Orders and Related Problems.	SWAT	1994	DBLP DOI BibTeX RDF
1	Sven Schuierer	An O(log N) Algorithm to Compute the Kernel of a Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
1	Leonidas Palios	Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments.	SWAT	1994	DBLP DOI BibTeX RDF
1	Magnús M. Halldórsson, Jaikumar Radhakrishnan	Improved Approximations of Independent Sets in Bounded-Degree Graphs.	SWAT	1994	DBLP DOI BibTeX RDF
1	Erik Meineche Schmidt, Sven Skyum (eds.)	Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings	SWAT	1994	DBLP DOI BibTeX RDF
1	Mark de Berg, Marko de Groot, Mark H. Overmars	New Results on Binary Space Partitions in the Plane (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
1	Paul F. Dietz, Joel I. Seiferas, Ju Zhang	A Tight Lower Bound for On-line Monotonic List Labeling.	SWAT	1994	DBLP DOI BibTeX RDF
1	Jop F. Sibeyn, Tim J. Harris	Exploiting Locality in LT-RAM Computations.	SWAT	1994	DBLP DOI BibTeX RDF
1	Feodor F. Dragan	Dominating Cliques in Distance-Hereditary Graphs.	SWAT	1994	DBLP DOI BibTeX RDF
1	Gautam Das 0001, Paul J. Heffernan, Giri Narasimhan	Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
1	Peter Becker 0001	A New Algorithm for the Construction of Optimal B-Trees.	SWAT	1994	DBLP DOI BibTeX RDF
1	Gerhard Albers, Thomas Roos	Voronoi Diagrams of Moving Points in Higher Dimensional Spaces.	SWAT	1992	DBLP DOI BibTeX RDF
1	Walter Cunto, Vicente Yriarte	GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization.	SWAT	1992	DBLP DOI BibTeX RDF
1	Artur Czumaj	An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.	SWAT	1992	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Giora Slutzki	Parametric Problems on Graphs of Bounded Tree-Width.	SWAT	1992	DBLP DOI BibTeX RDF
1	Fabrizio d'Amore, Vincenzo Liberatore	The List Update Problem and the Retrieval of Sets.	SWAT	1992	DBLP DOI BibTeX RDF
1	Guy Kortsarz, David Peleg	Generating Sparse 2-spanners.	SWAT	1992	DBLP DOI BibTeX RDF
1	Otto Nurmi, Esko Ukkonen (eds.)	Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings	SWAT	1992	DBLP DOI BibTeX RDF
1	Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde	Retrieval of scattered information by EREW, CREW and CRCW PRAMs.	SWAT	1992	DBLP DOI BibTeX RDF
1	Subir Kumar Ghosh, Anil Maheshwari	Parallel Algorithms for All Minimum Link Paths and Link Center Problems.	SWAT	1992	DBLP DOI BibTeX RDF
1	Sandeep Sen	Fractional Cascading Simplified.	SWAT	1992	DBLP DOI BibTeX RDF
1	Hans-Peter Lenhof, Michiel H. M. Smid	Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity.	SWAT	1992	DBLP DOI BibTeX RDF
1	John Hershberger 0001, Jack Snoeyink	Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra.	SWAT	1992	DBLP DOI BibTeX RDF
1	Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd	Non-Interfering Network Flows.	SWAT	1992	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg	Low-Diameter Graph Decomposition is in NC.	SWAT	1992	DBLP DOI BibTeX RDF
1	Jyrki Katajainen, Tomi Pasanen	Sorting Multisets Stably in Minimum Space.	SWAT	1992	DBLP DOI BibTeX RDF
1	L. Paul Chew, Klara Kedem	Improvements on Geometric Pattern Matching Problems.	SWAT	1992	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Leonidas Palios	Decomposing the Boundary of a Nonconvex Polyhedron.	SWAT	1992	DBLP DOI BibTeX RDF
1	Alexander A. Razborov	On Small Depth Threshold Circuits.	SWAT	1992	DBLP DOI BibTeX RDF
1	Dora Giammarresi, Giuseppe F. Italiano	Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version).	SWAT	1992	DBLP DOI BibTeX RDF
1	Emo Welzl	New Results on Linear Programming and Related Problems.	SWAT	1992	DBLP DOI BibTeX RDF
1	Paul F. Dietz	Heap Construction in the Parallel Comparison Tree Model.	SWAT	1992	DBLP DOI BibTeX RDF
1	Mordecai J. Golin	Dynamic Closest Pairs - A Probabilistic Approach.	SWAT	1992	DBLP DOI BibTeX RDF
1	Alexandros V. Gerbessiotis, Leslie G. Valiant	Direct Bulk-Synchronous Parallel Algorithms.	SWAT	1992	DBLP DOI BibTeX RDF
1	Deborah Joseph, Joao Meidanis, Prasoon Tiwari	Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.	SWAT	1992	DBLP DOI BibTeX RDF
1	Maria Cristina Pinotti, Geppino Pucci	Parallel Algorithms for Priority Queue Operations.	SWAT	1992	DBLP DOI BibTeX RDF	Parallel Algorithms, Data Structures, Analysis of Algorithms, Heaps
1	John Hershberger 0001, Monika Rauch, Subhash Suri	Fully Dynamic 2-Edge-Connectivity in Planar Graphs.	SWAT	1992	DBLP DOI BibTeX RDF
1	Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis	How to Draw a Series-Parallel Digraph (Extended Abstract).	SWAT	1992	DBLP DOI BibTeX RDF

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