HOME > 상세정보

상세정보

Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998 : proceedings

Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998 : proceedings

자료유형
단행본
개인저자
Chwa, Kyung-Yong , 1946- Ibarra, Oscar H.
서명 / 저자사항
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998 : proceedings / Kyung-Yong Chwa, Oscar H. Ibarra (eds.).
발행사항
Berlin ;   New York :   Springer ,   c1998.  
형태사항
xiii, 478 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ,0302-9743 ; 1533
ISBN
3540653856 (pbk. : alk. paper) 9783540653851 (pbk. : alk. paper)
서지주기
Includes bibliographical references and index.
일반주제명
Computer algorithms -- Congresses.
000 01342camuu2200349 a 4500
001 000045564146
005 20091207160345
008 990104s1998 gw a b 101 0 eng d
015 ▼a GB99-02215
020 ▼a 3540653856 (pbk. : alk. paper)
020 ▼a 9783540653851 (pbk. : alk. paper)
035 ▼a (OCoLC)ocn40609662
035 ▼a (OCoLC)40609662
035 ▼a (KERIS)REF000004842532
040 ▼a UKM ▼c UKM ▼d CGU ▼d 211009
050 0 4 ▼a QA76.9.A43 ▼b I833 1998
082 0 ▼a 004.015118
082 0 4 ▼a 005.1 ▼2 22
090 ▼a 005.1 ▼b I73a ▼c 1998
111 2 ▼a ISAAC (Conference) ▼n (9th : ▼d 1998 : ▼c Taejon-si, Korea)
245 1 0 ▼a Algorithms and computation : ▼b 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998 : proceedings / ▼c Kyung-Yong Chwa, Oscar H. Ibarra (eds.).
246 3 0 ▼a ISAAC'98
260 ▼a Berlin ; ▼a New York : ▼b Springer , ▼c c1998.
300 ▼a xiii, 478 p. : ▼b ill. ; ▼c 24 cm.
490 1 ▼a Lecture notes in computer science , ▼x 0302-9743 ; ▼v 1533
504 ▼a Includes bibliographical references and index.
650 0 ▼a Computer algorithms ▼v Congresses.
700 1 ▼a Chwa, Kyung-Yong , ▼d 1946-
700 1 ▼a Ibarra, Oscar H.
830 0 ▼a Lecture notes in computer science ; ▼v 1533.
945 ▼a KINS

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 005.1 I73a 1998 등록번호 121187183 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차

Invited Presentation.- The Discrepancy Method.- Implementing Algorithms and Data Structures: An Educational and Research Perspective.- Geometry I.- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing.- Facility Location on Terrains.- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.- Complexity I.- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words.- Disjunctions of Horn Theories and Their Cores.- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It.- Graph Drawing.- Two-Layer Planarization in Graph Drawing.- Computing Orthogonal Drawings in a Variable Embedding Setting.- Dynamic Grid Embedding with Few Bends and Changes.- On-Line Algorithm and Scheduling.- Two New Families of List Update Algorithms.- An Optimal Algorithm for On-Line Palletizing at Delivery Industry.- On-Line Scheduling of Parallel Jobs with Runtime Restrictions.- CAD/CAM and Graphics.- Testing the Quality of Manufactured Disks and Cylinders.- Casting with Skewed Ejection Direction.- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image.- Graph Algorithm I.- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.- Polyhedral Structure of Submodular and Posi-modular Systems.- Maximizing the number of Connections in Optical Tree Networks.- Best Paper Presentation.- Selecting the k Largest Elements with Parity Tests.- Randomized Algorithm.- Randomized K-Dimensional Binary Search Trees.- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks.- Random Regular Graphs with Edge Faults: Expansion through Cores.- Complexity II.- A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem.- Generalized Graph Colorability and Compressibility of Boolean Formulae.- On the Complexity of Free Monoid Morphisms.- Graph Algorithm II.- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs.- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs.- Finding Planar Geometric Automorphisms in Planar Graphs.- Combinatorial Problem.- New Approach for Speeding Up Enumeration Algorithms.- Hamiltonian Decomposition of Recursive Circulants.- Convertibility among Grid Filling Curves.- Geometry II.- Generalized Self-Approaching Curves.- The Steiner Tree Problem in ?4-geometry Plane.- Computational Biology.- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages.- On the Multiple Gene Duplication Problem.- Geometry III.- Visibility Queries in Simple Polygons and Applications.- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting.- Optimality and Integer Programming Formulations of Triangulations in General Dimension.- Approximation Algorithm.- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.- A Capacitated Vehicle Routing Problem on a Tree.- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.- Complexity III.- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.- Inapproximability Results for Guarding Polygons without Holes.- The Inapproximability of Non NP-hard Optimization Problems.- Parallel and Distributed Algorithm.- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.- Optimal Approximate Agreement with Omission Faults.


정보제공 : Aladin

관련분야 신착자료

クジラ飛行机 (2022)