Conferences in DBLP
Matthew Andrews , Michel X. Goemans , Lisa Zhang Improved Bounds for On-line Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Guoliang Xue , Ding-Zhu Du O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Kuo-Hui Tsai , Da-Wei Wang , D. T. Lee Steiner Problems on Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Efstratios Karaivazoglou , Paul G. Spirakis , Vasilis Triantafilou Wormhole Versus Deflection Routing: A Case Study on the Mesh. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann , Pavel Pudlák , Petr Savický On Sparse Parity Chack Matrices (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Zhixiang Chen , Carlos Cunha , Steven Homer Finding a Hidden Code by Asking Questions. [Citation Graph (0, 0)][DBLP ] Conf ] H. K. Dai , Kevin E. Flannery Improved Length Lower Bounds for Reflecting Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Imai , Satoru Iwata , Kyoko Sekine , Kensyu Yoshida Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Roberto Tamassia , Luca Vismara Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Md. Saidur Rahman , Shin-Ichi Nakano , Takao Nishizeki Rectangular Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Chan-Su Shin , Sung Kwon Kim , Kyung-Yong Chwa Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer Straight Skeletons for General Polygonal Figures in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister A Note on the Simulation of Exponential Threshold Weights. [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Cristina G. Fernandes Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. [Citation Graph (0, 0)][DBLP ] Conf ] Farhad Shahrokhi , Weiping Shi Efficient Deterministic Algorithms for Embedding Graphs on Books. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Ming-Yang Kao Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. [Citation Graph (1, 0)][DBLP ] Conf ] Carlos Domingo Exact Learning of Subclasses of CDNF Formulas with Membership Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Shang-Hua Teng Fast Separator Decomposition for Finite Element Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Babette de Fluiter Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Ryuhei Uehara , Zhi-Zhong Chen , Xin He Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. [Citation Graph (0, 0)][DBLP ] Conf ] Juha Kärkkäinen , Esko Ukkonen Sparse Suffix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Hsiang Yeh , Emmanouel A. Varvarigos Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind A Note on the Self-Witnessing Property of Computational Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris J. Kavvadias , Martha Sideri The Inverse Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Zhigen Jiang , Jörg Rothe , Osamu Watanabe The Join Can Lower Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Xuerong Yong On the Distribution of Eigenvalues of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michelangelo Grigni , Vincent Mirelli , Christos H. Papadimitriou On the Difficulty of Designing Good Classifiers. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , Alexander Russell , Ravi Sundaram Approximating Latin Square Extensions. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu , Feng Bao Approximating Minimum Keys and Optimal Substructure Screens. [Citation Graph (0, 0)][DBLP ] Conf ] Jay Belanger , Jie Wang Reductions and Convergence Rates of Average Time. [Citation Graph (0, 0)][DBLP ] Conf ] Akio Yanbe , Kouichi Sakurai On the Complexity of Computational Problems Associated with Simple Stochastic Games (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Pedro C. Diniz , Martin C. Rinard On the Complexity of Commutativity Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea E. F. Clementi , Luca Trevisan Improved Non-approximability Results for Vertex Cover with Density Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li , John Tromp , Louxin Zhang Some Notes on the Nearest Neighbour Interchange Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Vasant Shanbhogue , Moti Yung Distributed Computing in Asynchronous Networks with Byzantine Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Seonghun Cho , Sartaj Sahni Weight Biased Leftist Trees and Modified Skip Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Hoong Chuin Lau Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sue Whitesides , Naixun Pei On the Reconfiguration of Chains (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan , Binhai Zhu Two-Guarding a Rectilinear Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Reihaneh Safavi-Naini Three Systems for Shared Generation of Authenticators. [Citation Graph (0, 0)][DBLP ] Conf ] Kwok-Yan Lam , San Ling , Lucas Chi Kwong Hui Efficient Generation of Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP ] Conf ] Jixiang Meng Superconnectivity for Minimal Multi-loop Networks. [Citation Graph (0, 0)][DBLP ] Conf ] 