|
|
|
|
| LEADER |
07836cam a2201033 i 4500 |
| 001 |
1005978691 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr cnu|||unuuu |
| 008 |
171013s2017 sz o 000 0 eng d |
| 015 |
|
|
|a GBB8N4168
|2 bnb
|
| 016 |
7 |
|
|a 019154389
|2 Uk
|
| 019 |
|
|
|a 1006610933
|a 1013499794
|a 1021261790
|a 1066685994
|a 1082122128
|
| 020 |
|
|
|a 9783319444796
|q (electronic bk.)
|
| 020 |
|
|
|a 3319444794
|q (electronic bk.)
|
| 020 |
|
|
|a 3319444786
|
| 020 |
|
|
|a 9783319444789
|
| 020 |
|
|
|z 9783319444789
|
| 024 |
7 |
|
|a 10.1007/978-3-319-44479-6
|2 doi
|
| 035 |
|
|
|a (OCoLC)1005978691
|z (OCoLC)1006610933
|z (OCoLC)1013499794
|z (OCoLC)1021261790
|z (OCoLC)1066685994
|z (OCoLC)1082122128
|
| 037 |
|
|
|a com.springer.onix.9783319444796
|b Springer Nature
|
| 040 |
|
|
|a N$T
|b eng
|e rda
|e pn
|c N$T
|d N$T
|d GW5XE
|d FIE
|d UAB
|d EBLCP
|d IOG
|d COO
|d AZU
|d UPM
|d VT2
|d OCLCF
|d YDX
|d UNA
|d JG0
|d U3W
|d CAUOI
|d OCLCQ
|d OCL
|d INT
|d OCLCQ
|d ESU
|d WYU
|d LVT
|d NJR
|d AU@
|d UKMGB
|d OCLCQ
|d MERER
|d OCLCQ
|d UKAHL
|d OCLCQ
|d ERF
|d OCLCQ
|d U@J
|d OCLCQ
|d SRU
|d OCLCO
|d OCLCQ
|d OCLCO
|d COM
|d OCLCQ
|d OCLCO
|d S9M
|d OCLCL
|
| 049 |
|
|
|a COM6
|
| 050 |
|
4 |
|a QA76.9.M35
|b M27 2017eb
|
| 072 |
|
7 |
|a MAT
|x 000000
|2 bisacsh
|
| 072 |
|
7 |
|a PBKS
|2 bicssc
|
| 082 |
0 |
4 |
|a 518.1
|2 23
|
| 245 |
0 |
2 |
|a A journey through discrete mathematics :
|b a tribute to Jiří Matoušek /
|c Martin Loebl, Jaroslav Nešetřil, Robin Thomas, editors.
|
| 264 |
|
1 |
|a Cham, Switzerland :
|b Springer,
|c 2017.
|
| 300 |
|
|
|a 1 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.
|
| 347 |
|
|
|b PDF.
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (EBSCO, viewed October 23, 2017).
|
| 505 |
0 |
|
|a Simplex Range Searching and Its Variants: A Review: Pankaj K. Agarwal.- Fair Representation by Independent Sets: Ron Aharoni, Noga Alon, Eli Berger, Maria Chudnovsky, Dani Kotlar, Martin Loebl, and Ran Ziv.- Computing Heegaard Genus Is NP-Hard: David Bachman, Ryan Derby-Talbot, and Eric Sedgwick.- Approximation-Friendly Discrepancy Rounding: Nikhil Bansal and Viswanath Nagarajan.- A Tverberg Type Theorem for Matroids: Imre Barany, Gil Kalai, Roy Meshulam.- Gershgorin Disks for Multiple Eigenvalues of Non-Negative Matrices: Imre Bárány and József Solymosi.- Computing the Partition Function of a Polynomial on the Boolean Cube: Alexander Barvinok -- Siegel's Lemma Is Sharp: József Beck.- On Codimension One Embedding of Simplicial Complexes: Anders Björner and Afshin Goodarzi -- Around Brouwer's Fixed Point Theorem: Anders Björner, Jiri Matousek, and Günter M. Ziegler.- Beyond the Borsuk-Ulam Theorem: The Topological Tverberg Story: Pavle V.M. Blagojevic and Günter M. Ziegler.- One-Sided Epsilon-Approximants: Boris Bukh and Gabriel Nivasch.- A Note on Induced Ramsey Numbers: David Conlon, Domingos Dellamonica Jr., Steven La Fleur, Vojtech Rödl, and Mathias Schacht.- ARRIVAL: A Zero-Player Graph Game in NP \ coNP: Jerome Dohrau, Bernd Gärtner, Manuel Kohler, Jiri Matousek, and Emo Welzl.- Constant-Factor Approximation for TSP with Disks: Adrian Dumitrescu, and Csaba D. Toth.- Transport-Entropy Inequalities and Curvature in Discrete-State Markov Chains: Ronen Eldan, James R. Lee, and Joseph Lehec.- Bounding Helly Numbers Via Betti Numbers: Xavier Goaoc, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner.- Ruled Surface Theory and Incidence Geometry: Larry Guth.- Approximating the k-Level in Three-Dimensional Plane Arrangements: Sariel Har-Peled, Haim Kaplan, and Micha Sharir.- Schrijver Graphs and Projective Quadrangulations: Tomas Kaiser and Matej Stehlik.- Near-Optimal Lower Bounds for nets for Halfspaces and Low Complexity Set Systems: Andrey Kupavskii, Nabil H. Mustafa, and Janos Pach.- Random Simplicial Complexes -- Around the Phase Transition: Nathan Linial and Yuval Peled.- Nullspace Embeddings for Outerplanar Graphs: Laszlo Lovasz and Alexander Schrijver.- Homology of Spaces of Directed Paths in Euclidean Pattern Spaces: Roy Meshulam and Martin Raussen.- Sperner's Colorings and Optimal Partitioning of the Simplex: Maryam Mirzakhani and Jan Vondrak.- Teaching and Compressing for Low VC-Dimension: Shay Moran, Amir Shpilka, Avi Wigderson, and Amir Yehudayo.- Restricted Invertibility Revisited: Assaf Naor and Pierre Youssef.- Rational Polygons: Odd Compression Ratio and Odd Plane Coverings: Rom Pinchasi and Yuri Rabinovich.- First Order Probabilities for Galton{Watson Trees: Moumanti Podder and Joel Spencer.- Crossing-Free Perfect Matchings in Wheel Point Sets: Andres J. Ruiz-Vargas and Emo Welzl.- Network Essence: Page Rank Completion and Centrality-Conforming Markov Chains: Shang-Hua Teng.- Anti-Concentration Inequalities for Polynomials: Van Vu.
|
| 520 |
|
|
|a This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition - something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek's numerous areas of mathematical interest.--
|c Provided by publisher.
|
| 600 |
1 |
0 |
|a Matoušek, Jiří,
|d 1963-
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Combinatorial analysis.
|
| 650 |
|
2 |
|a Mathematics.
|
| 650 |
|
2 |
|a Electronic Data Processing.
|
| 650 |
|
6 |
|a Informatique
|x Mathématiques.
|
| 650 |
|
6 |
|a Mathématiques.
|
| 650 |
|
6 |
|a Informatique.
|
| 650 |
|
6 |
|a Analyse combinatoire.
|
| 650 |
|
7 |
|a Combinatorics & graph theory.
|2 bicssc.
|
| 650 |
|
7 |
|a Geometry.
|2 bicssc.
|
| 650 |
|
7 |
|a Operational research.
|2 bicssc.
|
| 650 |
|
7 |
|a Algebraic topology.
|2 bicssc.
|
| 650 |
|
7 |
|a Mathematical theory of computation.
|2 bicssc.
|
| 650 |
|
7 |
|a Numerical analysis.
|2 bicssc.
|
| 650 |
|
7 |
|a MATHEMATICS
|x General.
|2 bisacsh.
|
| 650 |
|
7 |
|a Matemáticas discretas.
|2 embne.
|
| 650 |
0 |
7 |
|a Diseños combinatorios y configuraciones.
|2 embucm.
|
| 650 |
|
7 |
|a Computer science.
|2 fast.
|
| 650 |
|
7 |
|a Combinatorial analysis.
|2 fast.
|
| 650 |
|
7 |
|a Computer science
|x Mathematics.
|2 fast.
|
| 650 |
|
7 |
|a Mathematics.
|2 fast.
|
| 700 |
1 |
|
|a Loebl, Martin,
|e editor.
|
| 700 |
1 |
|
|a Nešetřil, Jaroslav,
|e editor.
|
| 700 |
1 |
|
|a Thomas, Robin,
|d 1962-
|1 https://id.oclc.org/worldcat/entity/E39PBJv8FYKHG67XKQrR4FqYT3,
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319444789.
|
| 907 |
|
|
|a .b57144059
|b multi
|c -
|d 171128
|e 240516
|
| 998 |
|
|
|a (3)cue
|a cu
|b 240404
|c m
|d z
|e -
|f eng
|g sz
|h 2
|i 2
|
| 948 |
|
|
|a MARCIVE Overnight, in 2024.04
|
| 948 |
|
|
|a MARCIVE Overnight, in 2023.01
|
| 948 |
|
|
|a MARCIVE Over, 07/2021
|
| 948 |
|
|
|a MARCIVE Comp, 2019.12
|
| 948 |
|
|
|a MARCIVE Comp, 2018.05
|
| 948 |
|
|
|a MARCIVE Q4, 2017
|
| 994 |
|
|
|a 92
|b COM
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2024.04
|
| 995 |
|
|
|a Loaded with m2btab.elec in 2024.04
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2023.01
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2021.07
|
| 995 |
|
|
|a Loaded with m2btab.elec in 2021.06
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2019.12
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2018.06
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2018.01
|
| 995 |
|
|
|a Loaded with m2btab.elec in 2017.11
|
| 999 |
|
|
|e z
|
| 999 |
|
|
|a cue
|
| 989 |
|
|
|d cueme
|e - -
|f - -
|g -
|h 0
|i 0
|j 200
|k 240404
|l $0.00
|m
|n - -
|o -
|p 0
|q 0
|t 0
|x 0
|w SpringerLink
|1 .i151483954
|u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/978-3-319-44479-6
|3 SpringerLink
|z Click here for access
|