LEADER 01322nam 2200373 n 450 001 996394383403316 005 20200824121903.0 035 $a(CKB)4940000000120809 035 $a(EEBO)2240931157 035 $a(UnM)99835329e 035 $a(UnM)99835329 035 $a(EXLCZ)994940000000120809 100 $a19920109d1584 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 12$aA new Yorkshyre song, intituled: Yorke, Yorke, for my monie$b[electronic resource] $eof all the cities that euer I see, for mery pastime and companie, except the Cittie of London 210 $aImprinted at London $cBy Richard Iones: dwelling neere Holburne Bridge$d1584 215 $a1 sheet ([1] p.) 300 $aA ballad. 300 $aSigned: From Yorke, by W.E. (i.e. William Elderton). 300 $aVerse - "I came thorow the north countrey,". 300 $aReproductions of the original in the British Library. 330 $aeebo-0018 606 $aBallads, English$y16th century 615 0$aBallads, English 700 $aElderton$b William$fd. 1592?$01001702 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996394383403316 996 $aA new Yorkshyre song, intituled: Yorke, Yorke, for my monie$92328412 997 $aUNISA LEADER 06938nam 22008055 450 001 996465703803316 005 20230329134257.0 010 $a3-642-40328-X 024 7 $a10.1007/978-3-642-40328-6 035 $a(CKB)3710000000015913 035 $a(SSID)ssj0000988036 035 $a(PQKBManifestationID)11619327 035 $a(PQKBTitleCode)TC0000988036 035 $a(PQKBWorkID)10950915 035 $a(PQKB)11324163 035 $a(DE-He213)978-3-642-40328-6 035 $a(MiAaPQ)EBC3093443 035 $a(PPN)172429323 035 $a(EXLCZ)993710000000015913 100 $a20130816d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$b[electronic resource] $e16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings /$fedited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XIV, 716 p. 48 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8096 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-40327-1 327 $aSpectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover ? Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for Nonabelian Groups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. 330 $aThis book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8096 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical analysis 606 $aMathematical statistics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aProbability and Statistics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aMathematical statistics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aNumerical Analysis. 615 24$aProbability and Statistics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aRaghavendra$b Prasad$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRaskhodnikova$b Sofya$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b José D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465703803316 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNISA