Del i serien Lecture Notes in Computer Science

Information Theory, Combinatorics, and Search Theory

In Memory of Rudolf Ahlswede

Häftad, Engelska, 2013

AvHarout Aydinian,Ferdinando Cicalese,Christian Deppe

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011. The four macro-topics of this workshop: theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching; information coding and spreading and patrolling on networks; provide a comprehensive picture of the vision Rudolf Ahlswede put forward of a broad and systematic theory of search.

Produktinformation

Utgivningsdatum2013-03-16
Mått155 x 235 x 44 mm
Vikt1 212 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor773
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642368981

Tillhör följande kategorier

I. Information Theory.- 1 Two New Results for Identification for Sources.- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order.- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme.- 4 Strong Secrecy for Multiple Access Channels.- 5 Capacity Results for Arbitrarily Varying Wiretap Channels.- 6 On Oblivious Transfer Capacity.- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay.- 8 Uniformly Generating Origin Destination Tables.- 9 Identification via Quantum Channels.- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel.- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities.- 12 On the Value of Multiple Read/Write Streams for Data Compression.- 13 How to Read a Randomly Mixed Up Message.- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification.- II. Combinatorics 15 Family Complexity and VC-Dimension.- 16 The Restricted Word Shadow Problem.- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals.- 18 Generic Algorithms for Factoring Strings.- 19 On Data Recovery in Distributed Databases.- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution.- 21 Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions.- 22 Threshold Functions for Distinct Parts: Revisiting Erd¨os–Lehner.- 23 On Some Structural Properties of Star and Pancake Graphs.- III. Search Theory.- 24 Threshold and Majority Group Testing.- 25 Superimposed Codes and Threshold Group Testing.- 26 New Construction of Error-Tolerant Pooling Designs.- 27 Density-Based Group Testing.- 28 Group Testing with Multiple Mutually-Obscuring Positives.- 29 An Efficient Algorithm for Combinatorial Group Testing.- 30 Randomized Post-optimization for t-Restrictions.- 31 Search for Sparse Active Inputs: A Review.- 32 SearchWhen the Lie Depends on the Target.- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs.- 34 Remarks on History and Presence of Game Tree Search and Research.- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture.- Michael Bodewig 36 Creating Order and Ballot Sequences.- Obituaries and Personal Memories.- Abschied.- 38 Rudi.- 39 Gedenkworte f¨ur Rudolf Ahlswede.- 40 In Memoriam Rudolf Ahlswede 1938 - 2010.- 41 Rudolf Ahlswede 1938-2010.- 42 Remembering Rudolf Ahlswede.- 43 Rudi Ahlswede.- 44 The Happy Connection between Rudi and Japanese Researchers.- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede.- 46 Mr. Schimanski and the Pragmatic Dean.- 47 Broken Pipes.- 48 Rudolf Ahlswede’s Funny Character.- 49 Two Anecdotes of Rudolf Ahlswede.- Bibliography of Rudolf Ahlswede’s Publications.

Mer från samma författare

General Theory of Information Transfer and Combinatorics

Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian

Häftad, 2006

1 489 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

General Theory of Information Transfer and Combinatorics

Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian

Häftad, 2006

1 489 kr

Del 15

Probabilistic Methods and Distributed Information

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2019

1 449 kr

Del 9133

Combinatorial Pattern Matching

Ferdinando Cicalese, Ely Porat, Ugo Vaccaro

Häftad, 2015

749 kr

Fault-Tolerant Search Algorithms

Ferdinando Cicalese

Häftad, 2016

749 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 229 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2017

1 729 kr

Riccardo Bassoli, Holger Boche, Christian Deppe, Roberto Ferrara, Frank H. P. Fitzek, Gisbert Janssen, Sajad Saeedinaeeni - Quantenkommunikationsnetze, Inbunden

Del 23

Quantenkommunikationsnetze

Riccardo Bassoli, Holger Boche, Christian Deppe, Roberto Ferrara, Frank H. P. Fitzek, Gisbert Janssen, Sajad Saeedinaeeni

Inbunden, 2023

1 619 kr

Christian Deppe, Andreas Winter, Raymond W. Yeung, Holger Boche, Ingo Althöfer, Jens Stoye, Ulrich Tamm, Rami Ezzine - Information Theory and Related Fields, Häftad

Del 14620

Information Theory and Related Fields

Christian Deppe, Andreas Winter, Raymond W. Yeung, Holger Boche, Ingo Althöfer, Jens Stoye, Ulrich Tamm, Rami Ezzine

Häftad, 2025

1 299 kr

Del 16

Identification and Other Probabilistic Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2021

2 309 kr

Fault-Tolerant Search Algorithms

Ferdinando Cicalese

Inbunden, 2013

749 kr

Del i serien Lecture Notes in Computer Science

Information Theory, Combinatorics, and Search Theory

In Memory of Rudolf Ahlswede

Häftad, Engelska, 2013

AvHarout Aydinian,Ferdinando Cicalese,Christian Deppe

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2013-03-16
Mått155 x 235 x 44 mm
Vikt1 212 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor773
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642368981

Tillhör följande kategorier

I. Information Theory.- 1 Two New Results for Identification for Sources.- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order.- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme.- 4 Strong Secrecy for Multiple Access Channels.- 5 Capacity Results for Arbitrarily Varying Wiretap Channels.- 6 On Oblivious Transfer Capacity.- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay.- 8 Uniformly Generating Origin Destination Tables.- 9 Identification via Quantum Channels.- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel.- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities.- 12 On the Value of Multiple Read/Write Streams for Data Compression.- 13 How to Read a Randomly Mixed Up Message.- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification.- II. Combinatorics 15 Family Complexity and VC-Dimension.- 16 The Restricted Word Shadow Problem.- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals.- 18 Generic Algorithms for Factoring Strings.- 19 On Data Recovery in Distributed Databases.- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution.- 21 Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions.- 22 Threshold Functions for Distinct Parts: Revisiting Erd¨os–Lehner.- 23 On Some Structural Properties of Star and Pancake Graphs.- III. Search Theory.- 24 Threshold and Majority Group Testing.- 25 Superimposed Codes and Threshold Group Testing.- 26 New Construction of Error-Tolerant Pooling Designs.- 27 Density-Based Group Testing.- 28 Group Testing with Multiple Mutually-Obscuring Positives.- 29 An Efficient Algorithm for Combinatorial Group Testing.- 30 Randomized Post-optimization for t-Restrictions.- 31 Search for Sparse Active Inputs: A Review.- 32 SearchWhen the Lie Depends on the Target.- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs.- 34 Remarks on History and Presence of Game Tree Search and Research.- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture.- Michael Bodewig 36 Creating Order and Ballot Sequences.- Obituaries and Personal Memories.- Abschied.- 38 Rudi.- 39 Gedenkworte f¨ur Rudolf Ahlswede.- 40 In Memoriam Rudolf Ahlswede 1938 - 2010.- 41 Rudolf Ahlswede 1938-2010.- 42 Remembering Rudolf Ahlswede.- 43 Rudi Ahlswede.- 44 The Happy Connection between Rudi and Japanese Researchers.- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede.- 46 Mr. Schimanski and the Pragmatic Dean.- 47 Broken Pipes.- 48 Rudolf Ahlswede’s Funny Character.- 49 Two Anecdotes of Rudolf Ahlswede.- Bibliography of Rudolf Ahlswede’s Publications.