pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE
By: Michael Luby (Editor), Jose D. P. Rolim (Editor), Maria Serna (Editor)
Format: Paperback

List price: £72.00


We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10: 354065142X
ISBN 13: 9783540651420
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG
Pub. date: 25 September, 1998
Series: Lecture Notes in Computer Science 1518
Pages: 385
Description: 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.
Synopsis: TheWorkshoponRandomizationandApproximationTechniquesinComputer Science, Random'98, focuses on algorithmic and complexity aspects arising inthedevelopmentofe cientrandomizedsolutionstocomputationallydi cult problems. Itaims,inparticular,atfosteringthecooperationamongpractitioners andtheoreticiansandamongalgorithmicandcomplexityresearchersinthe eld. RANDOM'98,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 .. h). Thecontributedpaperswereselectedoutofseveraldozen submissions received in response to the call for papers. All papers published intheworkshopproceedingswereselectedbytheprogramcommitteeonthe basisofrefereereports. Considerablee ortwasdevotedtotheevaluationofthe submissionsbytheprogramcommitteeandanumberofotherreferees. Extensive feedbackwasprovidedtoauthorsasaresult,whichwehopehasprovenhelpful tothem.Wewouldliketothankalloftheauthorswhorespondedtothecallforpapers, ourinvitedspeakers,thereferees,andthemembersoftheprogramcommittee: MichaelLuby,Chair,ICSIBerkeley AndreiBroder,DigitalSystemsResearchCenter BernardChazelle,PrincetonU. AndreaClementi,U. ofRome AnnaKarlin,U. ofWashington RichardKarp,U. ofWashington ClaireKenyon,U. ofParisSud MichaelMitzenmacher,DigitalSystemsResearchCenter RajeevMotwani,StanfordU. PrabhakarRaghavan,IBM MariaSerna,UPCBarcelona AlistairSinclair,U. ofCalifornia,Berkeley MadhuSudan,MIT AviWigderson,HebrewU. PeterWinkler,BellLabs WegratefullyacknowledgesupportfromtheEuropeanAssociationINTAS, theComissionatperaUniversitatsiRecerca{GeneralitatdeCatalunya,and Universitat Polit ecnica de Catalunya. Finally, we would like to thank Helena Martinez,CarmeAlvarez,ConradoMartinez,andJordiPetitiSilvestrefortheir helpinthepreparationofthemeeting. August1998 MichaelLuby,Jos eD. P. Rolim,MariaJ. Serna Contents Invited Paper Disjoint Paths in Expander Graphs via Random Walks: A Short Survey 1 AlanM. Frieze RegularPapers A Derandomization Using Min-Wise Independent Permutations 15 AndreiZ.Broder,MosesCharikarandMichaelMitzenmacher An Algorithmic Embedding of Graphs via Perfect Matchings 25 VojtechR.. odl,AndrzejRucin 'skiandMichelleWagner Deterministic Hypergraph Coloring and Its Applications 35 Chi-JenLu On the De-randomization of Space-Bounded Computations 47 RoyArmoni Talagrand's Inequality and Locality in Distributed Computing 60 DevdattP. Dubhashi On-Line Bin-Stretching 71 YossiAzarandOdedRegev Combinatorial Linear Programming: Geometry Can Help 82 BerndGar .. tner A Note on Bounding the Mixing Time by Linear Programming 97 AbrahamSharell Robotic Exploration, Brownian Motion and Electrical Resistance 116 IsraelA. Wagner,MichaelLindenbaumandAlfredM. Bruckstein Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees 131 RicardoBaeza-Yates,JoaquimGabarro 'andXavierMesseguer On Balls and Bins with Deletions 145 RichardCole,AlanFrieze,BruceM. Maggs,MichaelMitzenmacher Andr'eaW. Richa,RameshK.
Illustrations: biography
Publication: Germany
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Returns: Returnable
Some other items by this author:
ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS (PB)
ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS (PB)
ALGORITHMIC GAME THEORY (PB)
ALGORITHMS - ESA '96 (PB)
ALGORITHMS AND COMPLEXITY (PB)
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION - ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATIONALGORITHMS AND TECHNIQUES (PB)
AUTOMATA, LANGUAGES AND PROGRAMMING (PB)
EXPERIMENTAL ALGORITHMS (PB)
PAIRWISE INDEPENDENCE AND DERANDOMIZATION (PB)
PARADIGMS FOR FAST PARALLEL APPROXIMABILITY
PARADIGMS FOR FAST PARALLEL APPROXIMABILITY (HB)
PARADIGMS FOR FAST PARALLEL APPROXIMABILITY (PB)
PARALLEL ALGORITHMS FOR IRREGULAR PROBLEMS: STATE OF THE ART (HB)
PARALLEL ALGORITHMS FOR IRREGULAR PROBLEMS: STATE OF THE ART (PB)
PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS (PB)
PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
PSEUDORANDOMNESS AND CRYPTOGRAPHIC APPLICATIONS (PB)
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE (PB)
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE (PB)
RANDOMIZATION METHODS IN ALGORITHM DESIGN (HB)
RANDOMIZATION, APPROXIMATION AND COMBINATORIAL OPTIMIZATION (PB)
RAPTOR CODES (PB)
SOLVING IRREGULARLY STRUCTURED PROBLEMS IN PARALLEL (PB)
THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS (HB)

TOP SELLERS IN THIS CATEGORY
Essential Maths Skills for AS/A Level Computer Science (Paperback)
Hodder Education
Our Price : £12.50
more details
An Introduction to Quantum Computing (Paperback)
Oxford University Press
Our Price : £53.38
more details
MATLAB Deep Learning (Paperback)
APress
Our Price : £48.12
more details
Basic Elements of Computational Statistics (Hardback)
Springer International Publishing AG
Our Price : £43.99
more details
Computational Physics (Paperback)
Wiley-VCH Verlag GmbH
Our Price : £74.25
more details
BROWSE FOR BOOKS IN RELATED CATEGORIES
 COMPUTING AND INFORMATION TECHNOLOGY
 general theory of computing
 mathematical theory of computation


Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket