Muutke küpsiste eelistusi

Building Bridges: Between Mathematics and Computer Science 2008 [Pehme köide]

  • Formaat: Paperback / softback, 595 pages, kõrgus x laius: 242x170 mm, kaal: 934 g, 595 p., 1 Paperback / softback
  • Sari: Bolyai Society Mathematical Studies 19
  • Ilmumisaeg: 02-Jan-2013
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642098967
  • ISBN-13: 9783642098963
  • Pehme köide
  • Hind: 95,02 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 111,79 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 595 pages, kõrgus x laius: 242x170 mm, kaal: 934 g, 595 p., 1 Paperback / softback
  • Sari: Bolyai Society Mathematical Studies 19
  • Ilmumisaeg: 02-Jan-2013
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642098967
  • ISBN-13: 9783642098963
Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovászs 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.
Contents 5(2)
Preface 7(4)
Curriculum Vitae of Laszlo Lovasz 11(4)
Publications of Laszlo Lovasz 15(16)
On the Power of Linear Dependencies
31(16)
I. Barany
Surplus of Graphs and the Lovasz Local Lemma
47(56)
J. Beck
Deformable Polygon Representation and Near-Mincuts
103(34)
A. A. Benczur
M. X. Goemans
Variations for Lovasz' Submodular Ideas
137(28)
K. Berczi
A. Frank
Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-organizing Libraries
165(40)
A. Bjorner
The Finite Field Kakeya Problem
205(14)
A. Blokhuis
F. Mazzocca
An Abstract Szemeredi Regularity Lemma
219(22)
B. Bollobas
V. Nikiforov
Isotropic PCA and Affine-Invariant Clustering
241(42)
S. C. Brubaker
S. S. Vempala
Small Linear Dependencies for Binary Vectors of Low Weight
283(26)
U. Feige
Plunnecke's Inequality for Different Summands
309(12)
K. Gyarmati
M. Matolcsi
I. Z. Ruzsa
Decoupling and Partial Independence
321(12)
R. Kannan
Combinatorial Problems in Chip Design
333(36)
B. Korte
J. Vygen
Structural Properties of Sparse Graphs
369(58)
J. Nesetril
P. Ossona de Mendez
Recent Progress in Matching Extension
427(28)
M. D. Plummer
The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) x n
455(32)
H. E. Scarf
Graph Invariants in the Edge Model
487(12)
A. Schrijver
Incidences and the Spectra of Graphs
499(16)
J. Solymosi
The Maturation of the Probabilistic Method
515(10)
J. Spencer
A Structural Approach to Subset-Sum Problems
525
V. Vu
Gyula O.H. Katona, President of the Bolyai Society, member of the Hungarian Academy of Sciences, honorary member of the Bulgarian Academy of Sciences









Martin Grötschel, Secretary of the International Mathematical Union, Vice President of Konrad-Zuse-Zentrum Berlin