Conferences in DBLP
Uzi Vishkin Methods in Parallel Algorithmics and Who May Need to Know Them? [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:1-5 [Conf ] D. T. Lee Rectilinear Paths among Rectilinear Obstacles. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:5-20 [Conf ] Maw-Hwa Chen , Sing-Ling Lee Linear Time Algorithms for k-cutwidth Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:21-30 [Conf ] Toshimasa Watanabe , Toshiya Mashima , Satoshi Taoka The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:31-40 [Conf ] Sachin B. Patkar , H. Narayanan Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:41-50 [Conf ] R. Z. Hwang , Richard C. T. Lee The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:51-60 [Conf ] Magnús M. Halldórsson Parallel and On-line Graph Coloring Algorithms. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:61-70 [Conf ] Tsuyoshi Matsumoto Competitive Analysis of the Round Robin Algorithm. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:71-77 [Conf ] Been-Chian Chien , Rong-Jaye Chen , Wei-Pang Yang Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:78-87 [Conf ] Tony W. Lau Self-Adjusting Augmented Search Trees. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:88-96 [Conf ] Teofilo F. Gonzalez , Toshio Murayama Alhorithms for a Class of Min-Cut and Max-Cut Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:97-105 [Conf ] Jan-Ming Ho , Ming-Tat Ko , Tze-Heng Ma , Ting-Yi Sung Algorithms for Rectilinear Optimal Multicast Tree Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:106-115 [Conf ] Ton Kloks , Hans L. Bodlaender Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:116-125 [Conf ] Shuichi Ueno , Michihiro Yamazaki Graph Spanners and Connectivity. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:126-134 [Conf ] Omer Berkman , Yossi Matias , Uzi Vishkin Randomized Range-Maxima inNearly-Constant Parallel Time. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:135-144 [Conf ] Yijie Han , Yoshihide Igarashi , Kumiko Kanai , Kinya Miura Fault-Tolerant Broadcasting in Binary Jumping Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:145-154 [Conf ] Kazuo Iwama , Eiji Miyano Routing Problems on the Mesh of Buses. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:155-164 [Conf ] Shuji Jimbo , Akira Maruoka Selection Networks with 8n log_{2} n Size and O (log n ) Depth. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:165-174 [Conf ] Ronald V. Book Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:175-186 [Conf ] Mike Paterson Boolean Circuit Complexity. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:187- [Conf ] Antonios Symvonis , Spyros Tragoudas Searching a Solid Pseudo 3-Sided Orthoconvex Grid. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:188-197 [Conf ] Nick D. Dendris , Iannis A. Kalafatis , Lefteris M. Kirousis An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:198-208 [Conf ] Kokichi Sugihara Topologically Consistent Algorithms Realted to Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:209-218 [Conf ] Seung-Hak Choi , Sung Yong Shin , Kyung-Yong Chwa Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:219-228 [Conf ] Toshiya Itoh , Kenji Horikawa On the Complexity of Composite Numbers. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:229-238 [Conf ] Kojiro Kobayashi On Malign Input Distributions for Algorithms. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:239-248 [Conf ] Vikraman Arvind , Johannes Köbler , Martin Mundhenk Lowness and the Complexity of Sparse and Tally Descriptions. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:249-258 [Conf ] Jie Wang , Jay Belanger Honest Iteration Schemes of Randomizing Algorithms. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:259-268 [Conf ] H. S. Lee , R. C. Chang Approximating Vertices of a Convex Polygon with Grid Points in the Polygon. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:269-278 [Conf ] Tatsuya Akutsu Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:279-288 [Conf ] Esther Jennings , Andrzej Lingas On the Relationship among Constrained Geometric Structures. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:289-298 [Conf ] Klaus Madlener , Friedrich Otto , Andrea Sattler-Klein Generating Small Convergent Systems Can Be Extremely Hard. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:299-308 [Conf ] Mizuhito Ogawa Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:309-318 [Conf ] Dominique Bolignano , Mourad Debbabi Higher Order Communication Processes with Value-Passing, Assignment and Return of Results. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:319-331 [Conf ] Wim Pijls , Arie de Bruin Searching Informed Game Trees. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:332-341 [Conf ] Masao Iri How to Generate Realistic Sample Problems for Network Optimization. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:342-350 [Conf ] Silvano Martello , Paolo Toth Generalized Assignment Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:351-369 [Conf ] Eric Guévremont , Jack Snoeyink Recognizing an Envelope of Lines in Linear Time. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:370-377 [Conf ] W. S. Chan , F. Chin Approximation of Polygonal Curves with Minimum Number of Line Segments. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:378-387 [Conf ] Majid Sarrafzadeh , Dorothea Wagner , Frank Wagner , Karsten Weihe Wiring Knock-Knee Layouts: A Global Appoach. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:388-399 [Conf ] Jun-ya Takahashi , Hitoshi Suzuki , Takao Nishizeki Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:400-409 [Conf ] Luc Longpré , Osamu Watanabe On Symmetry of Information and Polynomial Time Invertibility. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:410-419 [Conf ] Richard Beigel , Jun Tarui , Seinosuke Toda On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:420-429 [Conf ] Kaoru Kurosawa , Osamu Watanabe Computational and Statistical Indistinguishabilities. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:430-438 [Conf ] Bin Fu , Hong-Zhou Li On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:439-448 [Conf ] Majid Sarrafzadeh , D. T. Lee Rstricted Track Assignment with Applications. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:449-458 [Conf ] Wen-Lian Hsu A Simple Test for the Consecutive Ones Property. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:459-468 [Conf ] Koji Hakata , Hiroshi Imai The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:469-478 [Conf ] Tak Wah Lam , Ka Hing Lee The Implicit Dictionary Problem Revisited. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:479-488 [Conf ] Klaus Reinhardt Sorting In-Place with a Worst Case Complexity of n log n -1.3n + O (logn ) Comparisons and epsilon n log n + O (1) Transports. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:489-498 [Conf ] Alistair Moffat , Ola Petersson , Nicholas C. Wormald Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:499-508 [Conf ]