第 1/12 張圖片
圖片庫
第 1/12 張圖片
有類似物品要出售？
LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Brazil, LNCS
US $37.47
大約HK$ 291.51
狀況：
“Paperback, 2008, The book is in Very Good Condition, but unfortunately I spilled a cup of tea a few ”... 閱讀更多內容關於物品狀況
良好
曾被閱讀過的書籍，但狀況良好。封面有諸如磨痕等在內的極少損壞，但沒有穿孔或破損。精裝本書籍可能沒有書皮。封皮稍有磨損。絕大多數書頁未受損，存在極少的褶皺和破損。使用鉛筆標注文字處極少，未對文字標記，無留白處書寫文字。沒有缺頁。
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
運送：
US $13.49（大約 HK$ 104.95） Economy Shipping from outside US.
所在地：Tel Aviv, 以色列
送達日期：
估計於 10月20日 (星期一)至 11月17日 (星期一)之間送達 運送地點 94104
退貨：
30 日退貨. 由買家支付退貨運費，如果你使用 eBay 郵寄標籤，相關費用將從你的退款金額中扣除.
保障：
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
（不符合「eBay 買家保障方案」資格）
賣家必須承擔此刊登物品的所有責任。
eBay 物品編號：135683077207
物品細節
- 物品狀況
- 良好
- 賣家備註
- Country/Region of Manufacture
- United States
- Educational Level
- Adult & Further Education
- Features
- 1st Edition
- Level
- Advanced, Technical
- ISBN
- 9783540787723
關於產品
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540787720
ISBN-13
9783540787723
eBay Product ID (ePID)
65670796
Product Key Features
Number of Pages
Xvii, 796 Pages
Publication Name
Latin 2008 - Theoretical Informatics : 8th Latin American Symposium, Búzios, Brazil, April 2008, Proceedings
Language
English
Publication Year
2008
Subject
Programming / Algorithms, Computer Science, General, Databases / General
Type
Textbook
Subject Area
Computers, Technology & Engineering
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Weight
43.4 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2008-922953
Series Volume Number
4957
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
Profile of Tries.- Random 2-XORSAT at the Satisfiability Threshold.- On Dissemination Thresholds in Regular and Irregular Graph Classes.- How to Complete a Doubling Metric.- Sorting and Selection with Random Costs.- Guided Search and a Faster Deterministic Algorithm for 3-SAT.- Comparing and Aggregating Partially Resolved Trees.- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.- Myhill-Nerode Theorem for Recognizable Tree Series Revisited.- The View Selection Problem for Regular Path Queries.- Optimal Higher Order Delaunay Triangulations of Polygons.- Coloring Geometric Range Spaces.- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.- Spanners of Complete k-Partite Geometric Graphs.- Minimum Cost Homomorphisms to Reflexive Digraphs.- On the Complexity of Reconstructing H-free Graphs from Their Star Systems.- Optimization and Recognition for K 5-minor Free Graphs in Linear Time.- Bandwidth of Bipartite Permutation Graphs in Polynomial Time.- The Online Transportation Problem: On the Exponential Boost of One Extra Server.- Average Rate Speed Scaling.- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.- Maximizing the Minimum Load for Selfish Agents.- Approximate Polynomial gcd: Small Degree and Small Height Perturbations.- Pseudorandom Graphs from Elliptic Curves.- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract).- Sparse Approximate Solutions to Semidefinite Programs.- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints.- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.- Competitive Cost Sharing with Economies of Scale.- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.- Fully-Compressed Suffix Trees.- Improved Dynamic Rank-Select Entropy-Bound Structures.- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.- List Update with Locality of Reference.- Approximating Steiner Networks with Node Weights.- Approximating Minimum-Power Degree and Connectivity Problems.- Energy Efficient Monitoring in Sensor Networks.- Approximation Algorithms for k-Hurdle Problems.- Approximating Crossing Minimization in Radial Layouts.- New Upper Bound on Vertex Folkman Numbers.- Ptolemaic Graphs and Interval Graphs Are Leaf Powers.- A Representation Theorem for Union-Difference Families and Application.- Algorithms to Locate Errors Using Covering Arrays.- On Injective Colourings of Chordal Graphs.- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.- On 2-Subcolourings of Chordal Graphs.- Collective Additive Tree Spanners of Homogeneously Orderable Graphs.- The Generalized Median Stable Matchings: Finding Them Is Not That Easy.- Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences.- Randomized Rendez-Vous with Limited Memory.- Origami Embedding of Piecewise-Linear Two-Manifolds.- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.- Weighted Rectilinear Approximation of Points in the Plane.- Paths with no Small Angles.- Simpler Constant-Seed Condensers.- Parallel Repetition of the Odd Cycle Game.- I/O-Efficient Point Location in a Set of Rectangles.- Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.- Fixed-Parameter Algorithms for Cluster VertexDeletion.- Paths and Trails in Edge-Colored Graphs.- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.- Domination in Geometric Intersection Graphs.- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.- Quantum Property Testing of Group Solvability.- Solving NP-Complete Problems with Quantum Search.
Synopsis
The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferenceshavebeenorganizedtwiceinBrazil:S~ aoPaulo(1992)andCampinas (1998); twice in Chile: Valpara´ ?so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio ´ s, Rio de Janeiro, Brazil, April 7-11, 2008. Atotalof242paperswerereviewedbytheprogramcommittee.Amongthem, 66 were selected for presentation at the conference. The selection was based on the papers' originality, quality and relevance to Theoretical Computer Science. This volume also contains the extended abstract associated with the invited talk of Wojciech Szpankowski. We also had 4 invited talks by Cl´ audio Leonardo Lucchesi, Eva Tardos, Moni Naor and Robert Tarjan. We wouldlike to thank allmembers ofthe PCfortheir thoroughwork,which resultedinagoodselectionofpapers;themembersoftheSteeringCommitteefor their insightfuladviceandforsharingtheir experiencewithus;andthe members of our community who served as referees. Inaddition,wethankalloursponsors,Microsoft,UOL,IFIP,HP,Yahoo!, FAPERJ, CNPq and CAPES, and Springer for their continuous support., The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferenceshavebeenorganizedtwiceinBrazil: S aoPaulo(1992)andCampinas (1998); twice in Chile: Valpara ?so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio s, Rio de Janeiro, Brazil, April 7 11, 2008. Atotalof242paperswerereviewedbytheprogramcommittee.Amongthem, 66 were selected for presentation at the conference. The selection was based on the papers originality, quality and relevance to Theoretical Computer Science. This volume also contains the extended abstract associated with the invited talk of Wojciech Szpankowski. We also had 4 invited talks by Cl audio Leonardo Lucchesi, Eva Tardos, Moni Naor and Robert Tarjan. We wouldlike to thank allmembers ofthe PCfortheir thoroughwork, which resultedinagoodselectionofpapers;themembersoftheSteeringCommitteefor their insightfuladviceandforsharingtheir experiencewithus;andthe members of our community who served as referees. Inaddition, wethankalloursponsors, Microsoft, UOL, IFIP, HP, Yahoo , FAPERJ, CNPq and CAPES, and Springer for their continuous support.", This proceedings volume examines a range of topics in theoretical computer science, including automata theory, data compression, logic, machine learning, mathematical programming, parallel and distributed computing, quantum computing and random structures.
LC Classification Number
QA75.5-76.95
賣家提供的物品說明
賣家信用評價 （148）
- r***e (272)- 買家留下的信用評價。過去 1 個月購買已獲認證Leider doch mit Zollgebühren.
- b***- (24)- 買家留下的信用評價。過去 6 個月購買已獲認證Great product. Just as it's dicribed. Good quality overall. Nice packaging and Shipping. Well done!
- g***l (471)- 買家留下的信用評價。過去 6 個月購買已獲認證Arrived safely and well packaged. Item was as described and I love it. Would buy from again. Thank you.El Al Israel Airlines Logo Mesh Market Bag Air Souvenir Travel Memorabilia Gift（#135939610483）
賣家信用評價 （148）
- r***e (272)- 買家留下的信用評價。過去 1 個月購買已獲認證Leider doch mit Zollgebühren.
- b***- (24)- 買家留下的信用評價。過去 6 個月購買已獲認證Great product. Just as it's dicribed. Good quality overall. Nice packaging and Shipping. Well done!
- g***l (471)- 買家留下的信用評價。過去 6 個月購買已獲認證Arrived safely and well packaged. Item was as described and I love it. Would buy from again. Thank you.El Al Israel Airlines Logo Mesh Market Bag Air Souvenir Travel Memorabilia Gift（#135939610483）