Conferences in DBLP
Bernard M. E. Moret Computational Challenges from the Tree of Life. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner , Thomas Willhalm Drawing Graphs to Speed Up Shortest-Path Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Renato Fonseca F. Werneck Computing Point-to-Point Shortest Paths from External Memory. [Citation Graph (0, 0)][DBLP ] Conf ] Umut A. Acar , Guy E. Blelloch , Jorge L. Vittes An Experimental Analysis of Change Propagation in Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Hall , Heiko Schilling Flows over Time: Towards a More Realistic and Computationally Tractable Model. [Citation Graph (0, 0)][DBLP ] Conf ] Ivana Ljubic , René Weiskircher , Ulrich Pferschy , Gunnar W. Klau , Petra Mutzel , Matteo Fischetti Solving the Prize-Collecting Steiner Tree Problem to Optimality. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Bernd Schürmann , Jens Stoye An Incomplex Algorithm for Fast Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Dementiev , Juha Kärkkäinen , Jens Mehnert , Peter Sanders Better External Memory Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Lutz Kettner , Michel Pocchiola , Jack Snoeyink Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Quanfu Fan , Alon Efrat , Vladlen Koltun , Shankar Krishnan , Suresh Venkatasubramanian Hardware-Assisted Natural Neighbor Interpolation. [Citation Graph (0, 0)][DBLP ] Conf ] Krister M. Swenson , Mark Marron , Joel V. Earnest-DeYoung , Bernard M. E. Moret Approximating the True Evolutionary Distance between Two Genomes. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz On the Adaptiveness of Quicksort. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory L. Heileman , Wenbin Luo How Caching Affects Hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Leonor Frias Extending STL Maps Using LBSTs. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Benton McCune , Sriram V. Pemmaraju , Rajiv Raman , Kasturi R. Varadarajan An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Tanveer A. Faruquie , Hemanta Kumar Maji , Raghavendra Udupa A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation. [Citation Graph (0, 0)][DBLP ] Conf ] Simon Bliudze , Daniel Krob Performance Evaluation of Demodulation with DiversityØA Combinatorial Approach III: Threshold Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Jennie C. Hansen , Eric Schmutz Comparison of Two CDS Algorithms on Random Unit Ball Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Berend , Amir Sapir Complexity of the Path Multi-Peg Tower of Hanoi. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall , Peter Winkler Mixing Points on an Interval. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Knessl , Wojciech Szpankowski Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. [Citation Graph (0, 0)][DBLP ] Conf ] Yuriy A. Reznik On the Average Density and Selectivity of Nodes in Multi-Digit Tries. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen P. Boyd , Arpita Ghosh , Balaji Prabhakar , Devavrat Shah Mixing Times for Random Walks on Geometric Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Yiu-Cho Leung , Yajun Wang , Xuerong Yong Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Brightwell , Peter Winkler Counting Eulerian Circuits is #P-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer , Shiva Prasad Kasiviswanathan Approximately Counting Perfect Matchings in General Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 