Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Tadao Takaoka |
Theory of 2-3 Heaps. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally-Hard Languages. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe 0001 |
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Sung-Pil Hong |
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Kouichi Hirata, Keizo Yamada, Masateru Harao |
Tractable and Intractable Second-Order Matching Problems. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Christos Levcopoulos |
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Wing-Kai Hon, Tak Wah Lam |
Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jeet Chaudhuri, Subhas C. Nandy |
Generalized Shooter Location Problem. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita |
Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
local majority voting, agreement and consensus problem, distributed computing, graph theory, Markov chain |
1 | Jon M. Kleinberg, Ravi Kumar 0001, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins |
The Web as a Graph: Measurements, Models, and Methods. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder |
On Bounds for the k-Partitioning of Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Xuemin Lin 0001, Peter Eades |
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
Hierarchically Planar Graph, Visibility Representation, Drawing Area, Graph Drawing |
1 | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam |
Improving Parallel Computation with Fast Integer Sorting. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
Parallel algorithms, graph algorithms, minimum spanning tree, PRAM, integer sorting |
1 | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
On the Negation-Limited Circuit Complexity of Merging. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Meena Mahajan, P. R. Subramanya, V. Vinay |
A Combinatorial Algorithm for Pfaffians. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Carsten Damm, Ki Hang Kim, Fred W. Roush |
On Covering and Rank Problems for Boolean Matrices and Their Applications. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Krysta, Roberto Solis-Oba |
Approximation Algorithms for Bounded Facility Location. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
An External Memory Data Structure for Shortest Path Queries. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
On Routing in Circulant Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
Shortest paths, Lattices, Diameter, Loops, Circulant graphs |
1 | Akira Matsubayashi, Ryo Takasu |
Minimum Congestion Embedding of Complete Binary Trees into Tori. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jun Tarui, Seinosuke Toda |
Some Observations on the Computational Complexity of Graph Accessibility Problem. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jochen Alber, Rolf Niedermeier |
On Multi-dimensional Hilbert Indexings. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Ming Li 0001, Louxin Zhang |
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Chi-Jen Lu |
An Exact Characterization of Symmetric Functions in qAC0[2]. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Christos H. Papadimitriou |
Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Wen-Lian Hsu, Ming-Yang Kao (eds.) |
Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Rudolf Fleischer |
On The Bahncard Problem. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Anna Bernasconi 0001 |
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki |
Eulerian Secret Key Exchange. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
ultrametric trees, approximation algorithms, branch and bound, computational biology |
1 | Mikhail J. Atallah, Danny Z. Chen |
Parallel Geometric Algorithms in Coarse-Grain Network Models. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Hertrampf |
The Inherent Dimension of Bounded Counting Classes. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | 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. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski |
On the Ádám Conjecture on Circulant Graphs. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung |
Robust Reductions. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Tsan-sheng Hsu, Dian Rae Lopez |
Executing Divisible Jobs on a Network with a Fixed Number of Processors. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Ömer Egecioglu, Marcus Peinado |
Algorithms for Almost-uniform Generation with an Unbiased Binary Source. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | S. Rao Kosaraju, Mihai Pop |
De-amortization of Algorithms. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Guoliang Xue |
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
Paralle algorithms, spatial tree data structures, force field evaluation, cost optimal algorithms, PRAM, N-body simulations |
1 | Alejandro López-Ortiz, Sven Schuierer |
The Ultimate Strategy to Search on m Rays? |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro |
Improved Algorithms for Chemical Threshold Testing Problems. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Grebinski |
On the Power of Additive Combinatorial Search Model. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Mutsunori Yagiura, Toshihide Ibaraki |
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Vasco Brattka, Klaus Weihrauch, Xizhong Zheng |
Approaches to Effective Semi-continuity of Real Functions. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Michael J. Fischer |
Estimating Parameters of Monotone Boolean Functions (Abstract). |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Ricardo A. Baeza-Yates |
Similarity in Two-Dimensional Strings. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee |
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Graf, V. Kamakoti 0001, N. S. Janaki Latha, C. Pandu Rangan |
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Jie Wang 0002, Yaorong Ge |
A Grap Optimization Problem in Virtual Colonoscopy. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Danny Z. Chen, Ovidiu Daescu |
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Donald Beaver |
One-Time Tables for Two-Party Computation. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Yang Dai, Naoki Katoh |
On Computing New Classes of Optimal Trangulations with Angular Constraints. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Frank K. Hwang, Wen-Dar Lin |
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Steffen Reith, Klaus W. Wagner |
On Boolean Lowness and Boolean Highness. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse |
1 | Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin |
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Dongsoo S. Kim, Ding-Zhu Du |
Multirate Multicast Switching Networks. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang |
Maximum Weight Triangulation and Its Application on Graph Drawing. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Fan R. K. Chung, Ronald L. Graham |
Combinatorial Problems Arising in Massive Data Sets (Abstract). |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Kuo-Hui Tsai, Da-Wei Wang |
Lower Bounds for Wide-Sense Non-blocking Clos Network. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
Min-Max-Boundary Domain Decomposition. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Wenan Zang |
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Kun-Mao Chao |
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Yonghong Chen, Qiao Li |
They are Just Butterflies. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | David Sankoff, Mathieu Blanchette |
The Median Problem for Breakpoints in Comparative Genomics. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi |
Independent Spanning Trees of Chordal Rings. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki |
Generalized Vertex-Rankings of Partial k-trees. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Rüdiger Reischuk |
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Yanchun Zhang, Jitian Xiao, Xiaofang Zhou 0001 |
A Declustering Algorithm for Minimizing Spatial Join Cost. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Kuo-Hui Tsai, Da-Wei Wang |
Optimal Algorithms for Circle Partitioning. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Seng Kiat Chua, San Ling |
A Rabin-Type Scheme Based on y2 equiv x3 + bx2 mod n. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima |
Size and Variable Ordering of OBDDs Representing Treshold Functions. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Binhai Zhu |
Fast Range Searching with Delaunay Triangulations. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Xingfu Wu |
An Approach to Scalability of Parallel Matrix Multiplication Algorithms. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Jin-yi Cai, D. Sivakumar |
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Ming-Yang Kao, Junfeng Qi, Lei Tan |
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Lusheng Wang, Xiaohua Jia |
Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan |
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | K. W. Chan, Francis Y. L. Chin |
Optimal Multiresolution Polygonal Approximation. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Qing Hu 0007, Yixin Zhang, Xiaojun Shen 0002 |
Rearrangeable Graphs. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Peter Eades, Xuemin Lin 0001 |
Spring Algorithms and Symmetry. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Vince Grolmusz |
On Set Systems with Restricted Intersections Modulo a Composite Number. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Lin Chen 0001 |
A Selected Tour of the Theory of Identification Matrices. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Qing Zhou |
Subclasses of Coputable Real Valued Functions. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang 0009 |
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Hofmeister, Matthias Krause 0001, Hans Ulrich Simon |
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Kaile Su, Decheng Ding, Huowang Chen |
A Three-Valued Quantificational Logic of Context. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Yuji Kobayashi, Friedrich Otto, Patrice Séébold |
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Wei Chen 0003, Xiaowen Deng, Koichi Wada 0001, Kimio Kawaguchi |
Constructing a Strongly Convex Superhull of Points. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Peter Becker 0001 |
Construction of Nearly Optimal Multiway Trees. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang |
Effincient Domination of Permutation Graphs and Trapezoid Graphs. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Vasco Brattka |
Computable Invariance. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth Rice, Tandy J. Warnow |
Parsimony is Hard to Beat. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Pu Cai, Jin-yi Cai |
On the 100% Rule of Sensivity Analzsis in Linear Programming. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Shang-Hua Teng |
Eigenvalues, Eigenvectors, and Graph Partitioning. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Berry, Olivier Gascuel |
Inferring Evolutionary Trees with Strong Combinatorial Evidence. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu |
Projective Torus Networks. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann |
An Algorithm for Heilbronn's Problem. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Tao Jiang 0001, D. T. Lee (eds.) |
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Zhangang Han, Ruqian Lu |
Tree Structure Genetic Algorithm with Nourishment Mechanism. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|