LEADER 04227nam  22008415  450 
001 9910484273603321
005 20251226200446.0
010   $a3-540-74871-7
024 7 $a10.1007/978-3-540-74871-7
035   $a(CKB)1000000000491004
035   $a(SSID)ssj0000320215
035   $a(PQKBManifestationID)11274551
035   $a(PQKBTitleCode)TC0000320215
035   $a(PQKBWorkID)10347441
035   $a(PQKB)10351627
035   $a(DE-He213)978-3-540-74871-7
035   $a(MiAaPQ)EBC3063229
035   $a(MiAaPQ)EBC6707103
035   $a(Au-PeEL)EBL6707103
035   $a(PPN)123165024
035   $a(MiAaPQ)EBC336882
035   $a(BIP)34165016
035   $a(BIP)14495990
035   $a(EXLCZ)991000000000491004
100   $a20100301d2007      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aStochastic Algorithms: Foundations and Applications $e4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings /$fedited by Juraj Hromkovi?, Richard Královiç, Marc Nunkesser, Peter Widmayer
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (X, 170 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4665
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-540-74870-9 
320   $aIncludes bibliographical references and index.
327   $aInvited Papers -- On Computation and Communication with Small Bias -- Design Strategies for Minimal Perfect Hash Functions -- Hamming, Permutations and Automata -- Probabilistic Techniques in Algorithmic Game Theory -- Randomized Algorithms and Probabilistic Analysis in Wireless Networking -- Contributed Papers -- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games -- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks -- Approximate Discovery of Random Graphs -- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis -- Digit Set Randomization in Elliptic Curve Cryptography -- Lower Bounds for Hit-and-Run Direct Search -- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata -- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks -- On the Support Size of Stable Strategies in Random Games.
330   $aThis book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4665
606   $aAlgorithms
606   $aComputer science
606   $aComputer science$xMathematics
606   $aMathematical statistics
606   $aDiscrete mathematics
606   $aProbabilities
606   $aAlgorithms
606   $aTheory of Computation
606   $aProbability and Statistics in Computer Science
606   $aDiscrete Mathematics in Computer Science
606   $aProbability Theory
615  0$aAlgorithms.
615  0$aComputer science.
615  0$aComputer science$xMathematics.
615  0$aMathematical statistics.
615  0$aDiscrete mathematics.
615  0$aProbabilities.
615 14$aAlgorithms.
615 24$aTheory of Computation.
615 24$aProbability and Statistics in Computer Science.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aProbability Theory.
676   $a518.1
702   $aHromkovic?$b Juraj$f1958-
712 12$aSAGA 2007
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484273603321
996   $aStochastic Algorithms: Foundations and Applications$9772662
997   $aUNINA