Conferences in DBLP
Uri Zwick , Mike Paterson The Complexity of Mean Payoff Games. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:1-10 [Conf ] Kazuo Iwama , Shuichi Miyazaki Approximation of coNP Sets by NP-complete Sets. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:11-20 [Conf ] Qing-Wen Feng , Robert F. Cohen , Peter Eades How to Draw a Planar Clustered Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:21-30 [Conf ] Tiziana Calamoneri , Rossella Petreschi An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:31-40 [Conf ] Siu-Wing Cheng , Yin-Feng Xu Constrained Independence System and Triangulations of Planar Point Sets. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:41-50 [Conf ] Cao An Wang , Binhai Zhu Three Dimensional Weak Visibility: Complexity and Applications. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:51-60 [Conf ] Sung Kwon Kim Rectangulating Rectilinear Polygons in Parallel. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:61-70 [Conf ] V. Kamakoti , Kamala Krithivasan , C. Pandu Rangan Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:71-80 [Conf ] Edward P. F. Chan , Ron van der Meyden Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:81-90 [Conf ] Ruogu Zhang Computing Infinite Relations Using Finite Expressions: A New Approach To The Safety Issue In Relational Databases. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:91-100 [Conf ] Seung Jin Lim , Yiu-Kai Ng Set-Term Unification in a Logic Database Language. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:101-110 [Conf ] Marcel Wild Computations with Finite Closure Systems and Implications. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:111-120 [Conf ] Andrzej Lingas Maximum Tree-Packing in Time O(n^{5/2} ). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:121-130 [Conf ] Weiping Shi , Douglas B. West Optimal Algorithms for Finding Connected Components of an Unknown Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:131-140 [Conf ] Joseph L. Ganley , Mordecai J. Golin , Jeffrey S. Salowe The Multi-Weighted Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:141-150 [Conf ] Jianer Chen Algorithmic Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:151-160 [Conf ] Divyakant Agrawal , Ömer Egecioglu , Amr El Abbadi Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:161-170 [Conf ] Xuemin Lin , Maria E. Orlowska A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:171-180 [Conf ] Guoxiang Huang Constructing Craig Interpolation Formulas. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:181-190 [Conf ] Yoshinobu Kawabe , Naohiro Ishii Currying of Order-Sorted Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:191-202 [Conf ] S. Rengarajan , C. E. Veni Madhavan Stack and Queue Number of 2-Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:203-212 [Conf ] Scott K. Walley , Harry H. Tan Shortest Paths in Random Weighted Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:213-222 [Conf ] Xiao Zhou , Takao Nishizeki Simple Reduction of f-Colorings to Edge-Colorings. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:223-228 [Conf ] Kazuyoshi Hayase , Kunihiko Sadakane , Seiichiro Tani Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:229-234 [Conf ] John Tromp , Louxin Zhang , Ying Zhao Small Weight Bases for Hamming Codes. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:235-243 [Conf ] Julien Cassaigne , Juhani Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:244-253 [Conf ] Elena Barcucci , Alberto Del Lungo , Elisa Pergola , Renzo Pinzani A Construction for Enumerating k-coloured Motzkin Paths. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:254-263 [Conf ] Vladimir A. Oleshchuk On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:264-269 [Conf ] John E. Savage Extending the Hong-Kung Model to Memory Hierarchies. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:270-281 [Conf ] Liming Cai , Jianer Chen On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:282-291 [Conf ] Kaoru Kurosawa , Sanpei Kageyama New Bound for Afine Resolvable Designs and Its Application to Authentication Codes. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:292-302 [Conf ] Boris D. Lubachevsky , Ronald L. Graham Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:303-312 [Conf ] Josep Díaz , Alan Gibbons , Grammati E. Pantziou , Maria J. Serna , Paul G. Spirakis , Jacobo Torán Efficient Parallel Algorithms for some Tree Layout Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:313-323 [Conf ] Yijie Han , Xiaojun Shen Conservative Algorithms for Parallel and Sequential Integer Sorting. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:324-333 [Conf ] Zhixiang Chen An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:334-343 [Conf ] Zhixiang Chen Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:344-349 [Conf ] Shiquan Wu Non-empty Cross-3-Intersection Theorems of Subsets. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:350-356 [Conf ] Bo Yu Convexity of Minimal Total Dominating Functions in Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:357-365 [Conf ] Jean Hardouin Duparc , Philippe Rolland Transformations for Maximal Planar Graphs with Minimum Degree Five. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:366-371 [Conf ] You Zhaoyong , Wang Chuanglong An Asynchrolous Parallel Method for Linaer Systems. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:372-378 [Conf ] Zhang Xiangde On a Kind of Sequence of Polynomials. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:379-383 [Conf ] Jixiang Meng Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:384-387 [Conf ] Cheng-Xu Xu , Zhun-Wei Lu Pandiagonal Magic Squares. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:388-391 [Conf ] Hua Wang , Zhao-yong You PFFM and Quasi-Morishima Matrices. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:392-395 [Conf ] C. F. Chang , J. X. Chang , X. C. Lu , Peter Che Bor Lam , J. F. Wang Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:396-399 [Conf ] Rainer Schuler , Tomoyuki Yamakami Sets Computable in Polynomial Time on Average. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:400-409 [Conf ] Jay Belanger , Jie Wang Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:410-419 [Conf ] Kojiro Kabayashi Transformations that Preserve Maligness of Universal Distributions. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:420-429 [Conf ] Lane A. Hemaspaandra , Jörg Rothe Intersection Suffices for Boolean Hierarchy Equivalence. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:430-435 [Conf ] Dean Kelley , Peng-Jun Wan , Quifan Yang A 3/2 log3-Competive Algorithm for the Counterfeit Cain Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:436-445 [Conf ] Svante Carlsson , Jingsen Chen Searching Rigid Data Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:446-451 [Conf ] Bo-Ting Yang A Better Subgraph of the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:452-455 [Conf ] Wen Gao , Baocai Yin Sequence Decomposition Method for Computing a Gröbner Basis and Its Application to Bivariate Spline. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:456-461 [Conf ] Leqiang Bai , Peter M. Yamakawa , Hiroyuki Ebara , Hideo Nakando A Broadcasting Algorithm on the Arrangement Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:462-471 [Conf ] Shyue-Horng Shiau , Chang-Biau Yang A Fast Maximum Finding Algorithm on Broadcast Communication. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:472-481 [Conf ] Aditya Shastri Broadcasting in General Networks I: Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:482-489 [Conf ] Shyh-Chain Chern , Tai-Ching Tuan , Jung-Sing Jwo Uni-directional Alternating Group Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:490-495 [Conf ] Kouichi Sakurai On Separating Proofs of Knowledge from Proofs of Membership of Languages and Its Application to Secure Identification Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:496-509 [Conf ] Sven Oliver Krumke , Hartmut Noltemeier , S. S. Ravi , Madhav V. Marathe Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:510-519 [Conf ] Siu-Wing Cheng , Michael Kaminski , Shmuel Zaks Minimum Dominating Sets of Intervals on Lines (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:520-529 [Conf ] Ying Choi , Tak Wah Lam Two-Dimensional Pattern Matching on a Dynamic Library of Texts. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:530-538 [Conf ] Pierluigi Crescenzi , Viggo Kann , Riccardo Silvestri , Luca Trevisan Structure in Approximation Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:539-548 [Conf ] Marcus Peinado Improved Lower Bounds for the Randomized Boppana-Halldórsson Algorithm for MAXCLIQUE. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:549-558 [Conf ] Qi Cheng , Hong Zhu MNP: A Class of NP Optimization Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:559-565 [Conf ] Roman Bacik , Sanjeev Mahajan Semidefinite Programming and its Applications to NP Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:566-575 [Conf ] Lucas Chi Kwong Hui , Kwok-Yan Lam Analysis and Experimentation on List Update Algorithms. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:576-581 [Conf ] B. N. Khoury , Panos M. Pardalos An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:582-590 [Conf ] Huang Wenqui , Li Wei , Lu Weifeng , Zhang Yuping A Physical Model for the Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:591-596 [Conf ] Sam M. Kim , Robert McNaughton An Efficient Algorithm for Local Testability Problem of Finite State Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:597-606 [Conf ] Xiangdong Yu , Moti Yung Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:607-616 [Conf ] Chi-lok Chan , Gilbert H. Young Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:617-626 [Conf ] Rongheng Li , Lijie Shi An On-Line Algorithm for Some Uniform Processor Scheduling. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:627-632 [Conf ] Peter Jeavons , David A. Cohen An Algebraic Characterization of Tractable Constraints. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:633-642 [Conf ] Jiyu Ding , Chngxiang Qing , Guodong Song Limit Property of Unbalanced Development in Economic Network. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:643-646 [Conf ] Derick Wood Document Processing, Theory, and Practice (Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:647- [Conf ] Tao Jiang Matching and Comparing Sequences in Molecular Biology (Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:648-649 [Conf ] Vijay V. Vazirani Primal-Dual Schema Based Approximation Algorithms (Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:650-652 [Conf ]