randomization approximation techniques computer (31 Ergebnisse)

394 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7777 354065142X Sprache: Englisch Gewicht in Gramm: 900.

Zustand: Very Good. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7778 Sprache: Englisch Gewicht in Gramm: 900.

IX, 296 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2129. Sprache: Englisch.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

paperback. Zustand: Befriedigend. 420 Seiten; 9783540407706.4 Gewicht in Gramm: 1.

Paperback Jun 02, 2010. Zustand: gebraucht; sehr gut.

Paperback Jun 13, 2008. Zustand: gebraucht; wie neu. ungebraucht, evtl. minimalste Lagerspuren.

Paperback. Zustand: Wie neu. XII, 626 S.; Ill. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 985.

Taschenbuch. Zustand: Sehr gut. Gebraucht - Sehr gut Sg - Ungelesenes Mängelexemplar mit leichten Lagerspuren, Sofortversand - This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.

Paperback. Zustand: Brand New. 1998 edition. 383 pages. 9.25x6.25x0.75 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'97, held as a satelite meeting of ICALP'97, in Bologna, Italy, in July 1997.The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers presented at the 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RAN- DOM 2002), which took place at Harvard University, Cambridge, Massachusetts, from September 13 15, 2002. RANDOM 2002 was concerned with applications of randomness to computational and combinatorial problems, and was the sixth workshop in the series following Bologna, Barcelona, Berkeley, Geneva, and B- keley again. The volume contains 21 contributed papers, selected by the program c- mittee from 48 submissions received in response to the call for papers. We thank all of the authors who submitted papers, our invited speakers, the members of the program committee: Dimitris Achlioptas, Microsoft Research Martin Dyer, U. of Leeds Uriel Feige, Weizmann Institute Russell Impagliazzo, UC San Diego Sampath Kannan, U. of Pennsylvania David Karger, MIT Nati Linial, Hebrew U. Rafail Ostrovsky, Telcordia Technologies Paul Spirakis, U. of Patras and CTI Angelika Steger, TU Munich R udiger Urbanke, Swiss Federal Inst. of Tech. Salil Vadhan, Harvard U., chair, and the external reviewers: N. Alon, R. Alur, A. Ambainis, T. Batu, J. Feig- baum, S. Gerke, Y. Gertner, A. Goerdt, L. Goldberg, J. Hastad, C. Iliopoulos, Y. Ishai, V. Kabanets, S. Khot, L. Kirousis, S. Kontogiannis, M. Krivelevich, M. Mavronicolas, A. McGregor, F. McSherry, D. van Melkebeek, M. Molloy, E. Mossel, S. Nikoletseas, R. Raz, D. Ron, P. Tetali, L. Trevisan, E. Vigoda, J. Watrous, and P. Winkler.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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,andthemembersoftheprogramcommit tee: 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.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Neuware - This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM 99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX 99), which took place concurrently at the University of California, Berkeley, from August 8 11, 1999. RANDOM 99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX 99 focuses on algorithmic and complexity issues surrounding the - velopment of e cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton). We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM 99 APPROX 99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.