HOME > 상세정보

상세정보

Algorithms and computation : 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings

Algorithms and computation : 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings

자료유형
단행본
개인저자
Bose, Prosenjit. Morin, Pat.
서명 / 저자사항
Algorithms and computation : 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings / Prosenjit Bose, Pat Morin (eds.).
발행사항
Berlin ;   New York :   Springer ,   c2002.  
형태사항
xiii, 656 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ,0302-9743 ; 2518
ISBN
3540001425 (pbk. : alk. paper) 9783540001423 (pbk. : alk. paper)
서지주기
Includes bibliographical references and author index.
일반주제명
Computer algorithms -- Congresses. Numerical calculations -- Data processing -- Congresses.
000 01286camuu2200325 a 4500
001 000001102073
005 20091207161904
008 030527s2002 gw a b 101 0 eng d
015 ▼a GBA2-81929
020 ▼a 3540001425 (pbk. : alk. paper)
020 ▼a 9783540001423 (pbk. : alk. paper)
035 ▼a (OCoLC)ocn51195261
035 ▼a (OCoLC)51195261
040 ▼a UKM ▼c UKM ▼d C$Q ▼d ZCU ▼d 211009
050 4 ▼a QA76.9.A43 ▼b I73 2002
082 0 4 ▼a 004.015118 ▼2 21
082 0 4 ▼a 005.1 ▼2 22
090 ▼a 005.1 ▼b I73a ▼c 2002
111 2 ▼a ISAAC (Conference) ▼n (13th : ▼d 2002 : ▼c Vancouver, B.C.)
245 1 0 ▼a Algorithms and computation : ▼b 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings / ▼c Prosenjit Bose, Pat Morin (eds.).
246 3 0 ▼a ISAAC 2002
260 ▼a Berlin ; ▼a New York : ▼b Springer , ▼c c2002.
300 ▼a xiii, 656 p. : ▼b ill. ; ▼c 24 cm.
490 1 ▼a Lecture notes in computer science , ▼x 0302-9743 ; ▼v 2518
504 ▼a Includes bibliographical references and author index.
650 0 ▼a Computer algorithms ▼v Congresses.
650 0 ▼a Numerical calculations ▼x Data processing ▼v Congresses.
700 1 ▼a Bose, Prosenjit.
700 1 ▼a Morin, Pat.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 세종학술정보원/과학기술실/ 청구기호 005.1 I73a 2002 등록번호 151158547 도서상태 대출가능 반납예정일 예약 서비스 C M

컨텐츠정보

목차

Session 1A.- Biased Skip Lists.- Space-Efficient Data Structures for Flexible Text Retrieval Systems.- Key Independent Optimality.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Clique-Width of Graphs in Hereditary Classes.- On the Clique-Width of Graphs in Hereditary Classes.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- On the Minimum Volume of a Perturbed Unit Cube.- On the Minimum Volume of a Perturbed Unit Cube.- Non-Delaunay-Based Curve Reconstruction.- Non-Delaunay-Based Curve Reconstruction.- Cutting a Country for Smallest Square Fit.- Cutting a Country for Smallest Square Fit.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Some Remarks on the L-Conjecture.- Some Remarks on the L-Conjecture.- Session 3A.- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth.- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.- Session 3B.- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.- Session 4A.- Queaps.- Funnel Heap-A Cache Oblivious Priority Queue.- Characterizing History Independent Data Structures.- Session 4B.- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs.- Session 5A.- Casting a Polyhedron with Directional Uncertainty.- Hierarchy of Surface Models and Irreducible Triangulation.- Algorithms and Complexity for Tetrahedralization Detections.- Session 5B.- Average-Case Communication-Optimal Parallel Parenthesis Matching.- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.- New Results for Energy-Efficient Broadcasting in Wireless Networks.- Session 6A.- An Improved Algorithm for the Minimum Manhattan Network Problem.- Approximate Distance Oracles Revisited.- Flat-State Connectivity of Linkages under Dihedral Motions.- Session 6B.- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms.- Scheduling of Independent Dedicated Multiprocessor Tasks.- On the Approximability of Multiprocessor Task Scheduling Problems.- Session 7A.- Bounded-Degree Independent Sets in Planar Graphs.- Minimum Edge Ranking Spanning Trees of Threshold Graphs.- File Transfer Tree Problems.- Session 7B.- Approximation Algorithms for Some Parameterized Counting Problems.- Approximating MIN k-SAT.- Average-Case Competitive Analyses for Ski-Rental Problems.- Session 8A.- On the Clique Problem in Intersection Graphs of Ellipses.- A Geometric Approach to Boolean Matrix Multiplication.- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.- Session 8B.- Improved Distance Oracles for Avoiding Link-Failure.- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks.- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm.- Session 9A.- Crossing Minimization for Symmetries.- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid.- Meaningful Information.- Session 9B.- Optimal Clearing of Supply/Demand Curves.- Partitioning Trees of Supply and Demand.- Maximizing a Voronoi Region: The Convex Case.- Invited Talks.- Random Tries.- Expected Acceptance


정보제공 : Aladin

관련분야 신착자료

Coene, John (2021)
クジラ飛行机 (2022)