Description: Randomization and Approximation Techniques in Computer Science by Michael Luby, Jose Rolim, Maria Serna A collection of 26 papers from the Second International Workshop on Randomization and Approximation Techniques in Computer Science. It covers: graph computation; derandomization; pattern matching; computational geometry; approximation and search algorithms; sorting; and networking algorithms. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM98, held in Barcelona, Spain, in October 1998.The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms. Table of Contents Invited Paper.- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey.- Regular Papers.- A Derandomization Using Min-Wise Independent Permutations.- An Algorithmic Embedding of Graphs via Perfect Matchings.- Deterministic Hypergraph Coloring and Its Applications.- On the Derandomization of Space-Bounded Computations.- Talagrands Inequality and Locality in Distributed Computing.- On-line Bin-Stretching.- Combinatorial Linear Programming: Geometry Can Help.- A Note on Bounding the Mixing Time by Linear Programming.- Robotic Exploration, Brownian Motion and Electrical Resistance.- Fringe analysis of synchronized parallel algorithms on 2–3 trees.- On Balls and Bins with Deletions.- "Balls into Bins" — A Simple and Tight Analysis.- Invited Paper.- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs.- Regular Papers.- Using Approximation Hardness to Achieve Dependable Computation.- Complexity of Sequential Pattern Matching Algorithms.- A Random Server Model for Private Information Retrieval.- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).- Randomized Lower Bounds for Online Path Coloring.- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem.- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.- A High Performance Approximate Algorithm for the Steiner Problem in Graphs.- Invited Paper.- Random Geometric Problems on [0, 1]2.- Regular Papers.- A Role of Constraint in Self-Organization.- Constructive Bounds and Exact Expectations for the Random Assignment Problem.- The "Burnside Process" Converges Slowly.- Quicksort Again Revisited.- Sampling Methods Applied to DenseInstances of Non-Boolean Optimization Problems.- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. Promotional Springer Book Archives Long Description TheWorkshoponRandomizationandApproximationTechniquesinComputer Science, Random98, focuses on algorithmic and complexity aspects arising inthedevelopmentofe cientrandomizedsolutionstocomputationallydi cult problems. Itaims,inparticular,atfosteringthecooperationamongpractitioners andtheoreticiansandamongalgorithmicandcomplexityresearchersinthe eld. RANDOM98,heldattheUniversityofBarcelona(UPC),October8{10,1998, isthesecondintheseries,afterBologna. This volume contains all contributed papers accepted for presentation at theworkshop,togetherwithinvitedlecturesbyJosepD az(UPCBarcelona), AlanM. Frieze(CarnegieMellonU. ),MichaelLuby(ICSIBerkeley),andEmo Welzl(ETHZuric Details ISBN354065142X Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Year 1998 ISBN-10 354065142X ISBN-13 9783540651420 Format Paperback Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany DEWEY 004.015114 Series Lecture Notes in Computer Science Language English Media Book Publication Date 1998-09-25 Edited by Jose Rolim Short Title RANDOMIZATION & APPROXIMATION Pages 385 Edition 1998th Illustrations IX, 385 p. DOI 10.1604/9783540651420;10.1007/3-540-49543-6 Author Maria Serna Edition Description 1998 ed. Subtitle Second International Workshop, RANDOM98, Barcelona, Spain, October 8–10, 1998 Proceedings Series Number 1518 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:144115072;
Price: 138.51 AUD
Location: Melbourne
End Time: 2024-10-25T13:17:40.000Z
Shipping Cost: 0 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783540651420
Book Title: Randomization and Approximation Techniques in Computer Science
Number of Pages: 385 Pages
Language: English
Publication Name: Randomization and Approximation Techniques in Computer Science: Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998 Proceedings
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Publication Year: 1998
Subject: Computer Science, Mathematics
Item Height: 235 mm
Item Weight: 605 g
Type: Textbook
Author: Jose Rolim, Maria Serna, Michael Luby
Item Width: 155 mm
Format: Paperback
