|
|
|
|
| LEADER |
03108nam a22005775i 4500 |
| 001 |
978-3-540-74871-7 |
| 003 |
DE-He213 |
| 005 |
20151204165246.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540748717
|9 978-3-540-74871-7
|
| 024 |
7 |
|
|a 10.1007/978-3-540-74871-7
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Stochastic Algorithms: Foundations and Applications
|h [electronic resource] :
|b 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007. Proceedings /
|c edited by Juraj Hromkovič, Richard Královič, Marc Nunkesser, Peter Widmayer.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
| 300 |
|
|
|a X, 170 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4665
|
| 505 |
0 |
|
|a Invited 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Mathematical statistics.
|
| 650 |
|
0 |
|a Probabilities.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Probability and Statistics in Computer Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Probability Theory and Stochastic Processes.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Hromkovič, Juraj.
|e editor.
|
| 700 |
1 |
|
|a Královič, Richard.
|e editor.
|
| 700 |
1 |
|
|a Nunkesser, Marc.
|e editor.
|
| 700 |
1 |
|
|a Widmayer, Peter.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540748700
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4665
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-74871-7
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
