Conferences in DBLP
Wu Wen-Tsün Polynomial Equations-Solving and its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Graham Quasi-Random Combinatorial Structures (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein , Andrzej Lingas Hamiltonian Abstract Voronoi Diagrams in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Michael E. Houle , Godfried T. Toussaint Every Set of Disjoint Line Segments Admits a Binary Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwano , Prabhakar Raghavan , Hisao Tamaki The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu On Determining the Congruity of Point Sets in Higher Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Osamu Watanabe On Random Hard Sets for NP. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara , Alan L. Selman Computing Solutions Uniquely collapses the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Miklos Santha , Sovanna Tan Verifying the Determinant in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Chih-Long Lin Hardness of Approximating Graph Transformation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Panconesi , Marina Papatriantafilou , Philippas Tsigas , Paul M. B. Vitányi Randomized Wait-Free Naming. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran , Wang Chen , Shibu Yooseph Unifying Themes for Network Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Molcho , Shmuel Zaks Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. [Citation Graph (0, 0)][DBLP ] Conf ] Esther Jennings , Lenka Motyckova Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Xiang-Sun Zhang , Hui-Can Zhu A Neural Network Model for Quadratic Programming with Simple Upper and Lower Bounds and its Application to Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Daming Zhu , Shaohan Ma , Hongze Qiu Analysis of the Convergency of Topology Preserving Neural Networks on Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Johannes Köbler , Rainer Schuler On Helping and Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Jun Gu , Qian-Ping Gu Average Time Complexity of the SAT 1.2 Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Jingsen Chen Average Cost to Produce Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Daxing Li , Shaohan Ma Two Notes on Low-Density Subset Sum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Michael D. Hirsch Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Yongmao Chen , Terence R. Smith Finitely Representables Spatial Objects and Efficient Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Kazuhiro Nishimura , Toshihide Ibaraki Computing All Small Cuts in Undirected Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Takao Nishizeki Edge-Coloring and f-Coloring for Various Classes of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] C. P. Gopalakrishnan , C. Pandu Rangan Edge-Disjoint Paths in Permutation Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Taoka , Toshimasa Watanabe Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Anand Srivastav , Peter Stangier Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Tadao Takaoka Approximate Pattern Matching with Samples. [Citation Graph (0, 0)][DBLP ] Conf ] Xuemin Lin , Maria E. Orlowska An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. [Citation Graph (0, 0)][DBLP ] Conf ] Jun Gu Multispace Search: A New Optimization Approach. [Citation Graph (1, 0)][DBLP ] Conf ] Srinivasa Rao Arikati , Anil Maheshwari Realizing Degree Sequences in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris J. Kavvadias , Grammati E. Pantziou , Paul G. Spirakis , Christos D. Zaroliagis Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Hu Fast and Efficient Operations on Parallel Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Jingsen Chen , Christer Mattsson Heaps with Bits. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Igor Shparlinski Components and Projections of Curves over Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Middendorf On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Michio Nakanishi , Morio Hasidume , Minoru Ito , Akihiro Hashimoto A Linear-Time Algorithm for Computing Characteristic Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuhisa Makino , Toshihide Ibaraki The Maximum Latency and Identification of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaufmann , Harald Lauer , Heiko Schröder Fast Deterministic Hot-Potato Routing on Processor Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Qian-Ping Gu , Shietung Peng k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaufmann , Shaodi Gao , Krishnaiyan Thulasiraman On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaojun Shen , Qing Hu , Hao Dai , Xiangzu Wang Optimal Routing of Permutations on Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies , Sebastiaan Terwijn , Xizhong Zheng Resource Bounded Randomness and Weakly Complete Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram C. Krishnan , Anuj Puri , Robert K. Brayton Deterministic w Automata vis-a-vis Deterministic Buchi Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Mihara , Tetsuro Nishino Quantum Computation and NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , John D. Rogers Separability and One-Way Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu , Magnús M. Halldórsson On the Approximation of Largest Common Subtrees and Largest Common Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Lusheng Wang An Approximation Scheme for Some Steiner Tree Problems in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Bo-Ting Yang , Yin-Feng Xu , Zhao-yong You A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Jiyu Ding The Generating Algorithm for Quasi-Full Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Lucas Chi Kwong Hui , Charles U. Martel Analysing Deletions in Competitive Self-Adjusting Linear List. [Citation Graph (0, 0)][DBLP ] Conf ] Diab Abuaiadh , Jeffrey H. Kingston Are Fibonacci Heaps Optimal? [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Shang-Hua Teng Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] C. R. Subramanian Improved Algorithms for Coloring Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Nicholas Q. Trân On the Parallel Complexity of Solving Recurrence Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Chuzo Iwamoto , Kazuo Iwama Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Takis Metaxas , Grammati E. Pantziou , Antonios Symvonis Parallel h-v Drawings of Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sun-Yuan Hsieh , Chin-Wen Ho An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Takeshi Tokuyama Orthogonal Queries in Segments and Triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Binhai Zhu Further Computational Geometry in Secondary Memory. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan , Tomio Hirata Shortest Safari Routes in Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Y. L. Chin , Cao An Wang On Greedy Tetrahedralization of Points in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Kunihiro Fujiyoshi , Yoji Kajitani , Hiroshi Niitsu The Totally-Perfect Bipartite Graph and Its Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Kuo-Hui Tsai , D. T. Lee k-Best Cuts for Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lin Chen Revisiting Circular Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] C. Pandu Rangan , Maw-Shang Chang Weighted Irredundance of Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Seiichiro Tani , Hiroshi Imai A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuhisa Hosaka , Yasuhiko Takenaga , Shuzo Yajima On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Hong-Zhou Li , Guan-Ying Li Nonuniform Lowness and Strong Nonuniform Lowness. [Citation Graph (0, 0)][DBLP ] Conf ] Ingrid Biehl Definition and Existence of Super Complexity Cores. [Citation Graph (0, 0)][DBLP ] Conf ] Gilbert H. Young , Chi-lok Chan Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer. [Citation Graph (0, 0)][DBLP ] Conf ] Hoong Chuin Lau Manpower Scheduling with Shift Change Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Xu , Harold N. Gabow Fast Algorithms for Transversal Matroid Intersection Problems [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng A Convex Hull Algorithm on Coarse-Grained Multiprocessors. [Citation Graph (0, 0)][DBLP ] Conf ] De-Lei Lee , Kenneth E. Batcher A Multiway Merging Network. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano Reporting and Counting Intersections of Lines within a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] George Havas , Jin Xian Lian A New Problem in String Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Shangzhi Sun , David Hung-Chang Du , Guoliang Xue Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay. [Citation Graph (0, 0)][DBLP ] Conf ] Feng Bao , Yoshihide Igarashi A Randomized Algorithm to Finite Automata Public Key Cryptosystem. [Citation Graph (0, 0)][DBLP ] Conf ] 