Conferences in DBLP
Christos H. Papadimitriou Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Fan R. K. Chung , Ronald L. Graham Combinatorial Problems Arising in Massive Data Sets (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Fischer Estimating Parameters of Monotone Boolean Functions (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju , Mihai Pop De-amortization of Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Yang Dai , Naoki Katoh On Computing New Classes of Optimal Trangulations with Angular Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Cao An Wang , Francis Y. L. Chin , Bo-Ting Yang Maximum Weight Triangulation and Its Application on Graph Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Graf , V. Kamakoti , N. S. Janaki Latha , C. Pandu Rangan The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Ovidiu Daescu Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Danny Z. Chen Parallel Geometric Algorithms in Coarse-Grain Network Models. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer On The Bahncard Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Alejandro López-Ortiz , Sven Schuierer The Ultimate Strategy to Search on m Rays? [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li , Louxin Zhang Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. [Citation Graph (0, 0)][DBLP ] Conf ] Guoliang Xue A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. [Citation Graph (0, 0)][DBLP ] Conf ] Mutsunori Yagiura , Toshihide Ibaraki Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Ömer Egecioglu , Marcus Peinado Algorithms for Almost-uniform Generation with an Unbiased Binary Source. [Citation Graph (0, 0)][DBLP ] Conf ] Annalisa De Bonis , Luisa Gargano , Ugo Vaccaro Improved Algorithms for Chemical Threshold Testing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Marcos A. Kiwi , Daniel A. Spielman , Shang-Hua Teng Min-Max-Boundary Domain Decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Steffen Reith , Klaus W. Wagner On Boolean Lowness and Boolean Highness. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Hertrampf The Inherent Dimension of Bounded Counting Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu An Exact Characterization of Symmetric Functions in qAC0 [2]. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Lane A. Hemaspaandra , Gerd Wechsung Robust Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Vasco Brattka , Klaus Weihrauch , Xizhong Zheng Approaches to Effective Semi-continuity of Real Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Grebinski On the Power of Additive Combinatorial Search Model. [Citation Graph (0, 0)][DBLP ] Conf ] Frank K. Hwang , Wen-Dar Lin The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. [Citation Graph (0, 0)][DBLP ] Conf ] Kuo-Hui Tsai , Da-Wei Wang Lower Bounds for Wide-Sense Non-blocking Clos Network. [Citation Graph (0, 0)][DBLP ] Conf ] Dongsoo S. Kim , Ding-Zhu Du Multirate Multicast Switching Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Eiji Miyano , Satoshi Tajima , Hisao Tamaki Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Dian Rae Lopez Executing Divisible Jobs on a Network with a Fixed Number of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Mans , Francesco Pappalardi , Igor Shparlinski On the Ádám Conjecture on Circulant Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wenan Zang Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. [Citation Graph (0, 0)][DBLP ] Conf ] Jeng-Jung Wang , Ting-Yi Sung , Lih-Hsing Hsu , Men-Yang Lin A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. [Citation Graph (0, 0)][DBLP ] Conf ] Sheng-Lung Peng , Chin-Wen Ho , Tsan-sheng Hsu , Ming-Tat Ko , Chuan Yi Tang A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Jie Wang , Yaorong Ge A Grap Optimization Problem in Virtual Colonoscopy. [Citation Graph (0, 0)][DBLP ] Conf ] Bang Ye Wu , Kun-Mao Chao , Chuan Yi Tang Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] H. S. Chao , Fang-Rong Hsu , Richard C. T. Lee An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates Similarity in Two-Dimensional Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Alber , Rolf Niedermeier On Multi-dimensional Hilbert Indexings. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Bernasconi Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Takaaki Mizuki , Hiroki Shizuya , Takao Nishizeki Eulerian Secret Key Exchange. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver One-Time Tables for Two-Party Computation. [Citation Graph (0, 0)][DBLP ] Conf ] 