Conferences in DBLP
Jeffrey Scott Vitter External Memory Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Upfal Design and Analysis of Dynamic Processes: A Stocastic Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Car-Pooling as a Data Structuring Device: The Soft Heap. [Citation Graph (0, 0)][DBLP ] Conf ] Phillip G. Bradford , Mordecai J. Golin , Lawrence L. Larmore , Wojciech Rytter Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Nardelli , Guido Proietti , Peter Widmayer Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. [Citation Graph (1, 0)][DBLP ] Conf ] Yossi Matias , S. Muthukrishnan , Süleyman Cenk Sahinalp , Jacob Ziv Augmenting Suffix Trees, with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker , Raffaele Giancarlo Longest Common Subsequence from Fragments via Sparse Dynamic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein Computing the Edit-Distance between Unrooted Ordered Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael T. Hallett , Chantal Korostensky , Ulrike Stege Analogs and Duals of teh MAST Problem for Sequences and Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Cucker , Steve Smale Complexity Estimates Depending on Condition and Round-Off Error. [Citation Graph (0, 0)][DBLP ] Conf ] J. Maurice Rojas Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Storjohann , Thom Mulders Fast Algorithms for for Linear Algebra Modulo N. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Blömer A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Fischer , Tamás Lukovszki , Martin Ziegler Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio d'Amore , Paolo Giulio Franciosa , Giuseppe Liotta Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Eidenbenz , Christoph Stamm , Peter Widmayer Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. [Citation Graph (0, 0)][DBLP ] Conf ] Chan-Su Shin , Jung-Hyun Kim , Sung Kwon Kim , Kyung-Yong Chwa Two-Center Problems for a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] T. M. Murali , Pankaj K. Agarwal , Jeffrey Scott Vitter Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Andreas Nolte A Fast Random Greedy Algorithm for the Component Commonality Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Maximizing Job Completions Online. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Marek Chrobak , Lawrence L. Larmore A Randomized Algorithm for Two Servers on the Line (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Petr Kolman On Nonblocking Properties on the Benes Network. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Juan A. Garay Adaptability and the Usefulness of Hints (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , Andrzej Pelc Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Yahiko Kambayashi , Eiji Miyano New Bounds for Oblivious Mesh Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Balachander Krishnamurthy , Jennifer Rexford Evaluating Server-Assisted Cache Replacement in the Web. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Frigioni , Alberto Marchetti-Spaccamela , Umberto Nanni Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. [Citation Graph (0, 0)][DBLP ] Conf ] James Abello , Adam L. Buchsbaum , Jeffery Westbrook A Functional Approach to External Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Bouchitté , Ioan Todinca Minimal Triangulations for Graphs with "Few" Minimal Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Ovidiu Daescu , Xiaobo Hu , Jinhui Xu Finding an Optimal Path without Growing the Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Frigioni , Tobias Miller , Umberto Nanni , Giulio Pasqualone , Guido Schäfer , Christos D. Zaroliagis An Experimental Study of Dynamic Algorithms for Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Irving Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Meyer , Peter Sanders Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Ka Wong Chong , Edgar A. Ramos Improved Deterministic Parallel Padded Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Petra Berenbrink , Klaus Schröder Analyzing an Infinite Parallel Job Allocation Process. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Diekmann , Andreas Frommer , Burkhard Monien Nearest Neighbor Load Balancing on Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Solis-Oba 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher S. Helvig , Gabriel Robins , Alexander Zelikovsky Moving-Target TSP and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Lars Ivansson , Jens Lagergren Fitting Points on the Real Line and Its Application to RH Mapping. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Krivelevich , Benny Sudakov Approximate Coloring of Uniform Hypergraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel W. Engels , David R. Karger , Stavros G. Kolliopoulos , Sudipta Sengupta , R. N. Uma , Joel Wein Techniques for Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey V. Sevastianov , I. D. Tchernykh Computer-Aided Way to Prove Theorems in Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] 