General Theory of Information Theory and Combinatorics
10.10. | Y. Shtarkov | Joint Matrix Universal Codes of Sequences of Independent Symbols |
15.10. | V. Blinovsky | Large deviations in the commutative and non-commutative case |
17.10. | M. Kyureghian | Complexity of Monotonicity Checking |
C. Heup | The Design of Rijndael, the Advanced Encryption Standard | |
22.10. | Y. Shtarkov | On the Complexity of Coding |
29.10. | C. Heup | Specifications of Rijndael |
12.11. | Y. Shtarkov | Buffer Overflow Problems in Source Coding |
N. Cai | Zero-Error Capacity of noisy channels and average-error capacity of | |
AVC for codes with d-delay and feedback | ||
19.11. | P. Harremoes | A new metric associated with transmission rate |
V. Balakirsky | On hierarchical source coding | |
21.11. | P. Harremoes | New bounds on information divergence related to Poisson`s law |
V. Balakirsky | Estimates of the bit error probabilities and decoding algorithms for | |
binary input memoryless channels | ||
26.11. | C. Deppe | The Product Conjecture in Language Evolution |
V. Blinovsky | On Counting of Hypergraphs with given Degree Sequence | |
03.12. | E. Haroutunian | Combinatorial Proof of the Sphere Packing Bound for E-Capacity of |
the Discrete Memoryless Channel | ||
05.12. | P. L. Erdös | An Application of the Splitting Property, A Finite Word Poset |
10.12. | L. Bäumer | Identification in Prediction Theory |
17.12. | H. Aydinian | Shifting Techniques in Extremal Set Theory |
07.01. | H. Mashurian | Some Properties of Fix Free Codes |
09.01. | Zhaozhi Zhang | A Simplified Method for Computing the Key Equivocation for |
Additive-Like Instantaneous Block Encipherers | ||
14.01. | P. Algoet | Log-Optimum Selection in Convex Families |
16.01. | C. Mauduit | On finite pseudorandom binary sequences |
23.01. | V. Blinovsky | Correlation Inequalities |
29.01. | A. Sarkozy | Construction of binary sequences with good pseudo-random properties |
30.01. | J. Cassaigne | Recurrence in infinite words |
P. Harremoes | A unified model for information theory, cryptology, thermodynamics | |
and gambling | ||
11.02. | J. Gruska | Advanced Basic on Quantum Information Processing |
C. Deppe | Quasi Perfect q-ary Search with Unreliable Tests | |
13.02. | A. Uhlmann | On the Problem of Entanglement |
A. Winter | On Additivity of Entanglement and Capacity | |
18.02. | E. Haroutunian | On Asymptotically Optimal Hypotheses Testing and Identification |
M. Lewenstein | String Matching With k-Mismatches | |
R. Giancarlo | Improving Table Compression with Combinatorial Optimization | |
19.02. | R. Giancarlo | Optimal Partitions of Strings: A New Class of Burrows Wheeler |
Compression Algorithms | ||
L. Parida | Varun - A Flexible Pattern Detection Engine | |
G. M. Landau | A Sub-Quadratic Sequence Alignment Algorithm for Unrestricted | |
Scoring Matrices | ||
20.02. | N. Cai | A Strong Converse Theorem for Quantum Multiple Access Channels, |
Quantum Privacy and Quantum Wiretap Channel | ||
M. Lewenstein | Function Matching | |
G.M. Landau | Sparse LCS Common Substring Alignment |
25.02. | Y. Orlov | DNA Sequence Complexity |
A. Winter | Commitment Capacity of Noisy Channels | |
27.02. | R. Ahlswede | Hypergraph Covering Lemmas and |
a related Measure of Complexity | ||
Zhe-Xian Wan | Geometry of Matrices of L.K. Hua | |
28.02. | I. Althoefer, | |
U. Tamm | Computer Chess Experiment | |
04.03. | A. Apostolico | A Pattern Discovery Primer (I) |
H. Juergensen | Decidability of Code Properties | |
01.04. | G. Brinkmann | Two Generation Problems from Mathematical Chemistry |
M. Kyureghyan | Some Properties of Monotonicity Checking | |
03.04. | A. Apostolico | A Pattern Discovery Primer (II) |
H. Mashurian | On Comma-Free Codes | |
08.04. | J. Stoye | Some Combinatorial Aspects of Genome Informatics |
A. Apostolico | A Pattern Discovery Primer (III) | |
09.04. | V. Levenshtein | Reconstruction of sequences |
E. Konstantinova | Reversal metric and reconstruction of permutations | |
10.04. | E. Konstantinova | New Problems of Graph Reconstruction |
V. Levenshtein | A Universal Bound for a Covering in Regular Posets | |
and its Application to Pool Testing | ||
15.04. | T. Kalinowski | An Optimization Problem from Radiotherapy Planning |
A. Dyachkov | Statistical Estimation of Average Deletion Distance Between | |
Random Strings Generated by Markov Sources | ||
17.04. | V. Prelov | On the Thinnest Covering of Ellipsoids With Balls |
in Euclidean and Hamming Spaces | ||
V. Balakirsky | Algorithm for Estimating Transmitted Code Bits for Binary | |
Linear Block Codes and Binary-Input Additive Channels | ||
24.04. | P. Algoet | On the Value of Side Information |
C. Guerra | Indexing Techniques for Protein Structure Comparison | |
29.04. | M. Lewenstein | Maximum Asymmetric TSP |
A. Apostolico | Compression and the Wheel of Fortune | |
06.05. | R. Giancarlo | Complexity Results for Table Compression |
S. Carpin | Algorithmic Motion Planning: From Robotics to Proteins | |
08.05. | V. Damerow | Smoothed Motion Complexity |
C. Sohler | Property Testing and Abstract Combinatorial Programs | |
13.05. | M. Naguib | Animal communication: an introduction |
B. Siemers | Sensory and foraging ecology - how do bats and | |
other insectivorous mammals gather information on the | ||
availability, whereabouts and characteristics of prey, Part I | ||
15.05. | B. Siemers | Sensory and foraging ecology - how do bats and |
other insectivorous mammals gather information on the | ||
availability, whereabouts and characteristics of prey, Part II | ||
R. Apfelbach | Signal transduction and processing | |
in the vertebrate olfactory pathway | ||
20.05. | T. Peake | Animal Communication Networks |
M. Naguib | Sensory Ecology in Birds | |
22.05. | H. R. Wiley | Signal Detection and the Evolution of Animal Communication |
M. Fendt | Innate Fear and its Neuronal Mechanisms | |
27.05. | R. Mundry | Rules of Organization in Trush Nightingale Song |
H. Brumm | Directional Singing and Song Amplitude Regulation | |
in a Territorial Songbird |
28.05. | H. R. Wiley | Communication and Speciation |
R. Mundry | The Behavior of Cooperatively Breeding Arabian Babblers | |
in the Presence of Predators: Effects of Urgency and Social Rank | ||
03.06. | G. Klump | Mechanisms of Auditory Object Formation |
M. Bee | Auditory Streaming | |
05.06. | B. Adolph | How Animals Can Learn to Play at Nash Equilibrium - |
Communication, Incomplete Information and the Problem of Trust | ||
K. Hammerschmidt | Motivational Structural Rules Revisited: | |
Nonhuman Primate Alarm Calls | ||
10.06. | T. Spircu | Analysing Bonobo Vocalizations by Using Computer |
- Results and Limitations | ||
K. Hammerschmidt | Call Frequency as an Indicator of the Intensity of | |
Affective States in Nonhuman Primates and Humans | ||
12.06. | A. Holevo | On Additivity Problems in Quantum Information Theory |
J. Gruska | On Succinctness of Quantum Finite Automata | |
17.06. | W. Prinz | Experiments on Cognition and Action |
M. Naguib | The Evolution of Communication | |
18.06. | M. Gregoratti | Quantum Error Correction by Classical Feedback |
A. Holevo | On Additivity Problems in Quantum Information Theory | |
24.06. | Ph. Blanchard | Five Scenarios for Decoherence Induced Processes |
I. Bjelakovic | The Shannon-McMillan Theorem for Quantum | |
Relative Entropy | ||
25.06. | N. Cai | On Lossless Quantum Data Compression With a |
Classical Helper | ||
V. Balakirsky | An Efficient Algorithm for Estimating the State Sequence | |
of a Finite State Machine Given an Output Sequence | ||
26.06. | A. Sanpera | Separability versus Entanglement: Still an Open Problem |
R. Siegmund-Schultze | An Ergodic Theorem for the Quantum Relative Entropy | |
01.07. | P. Slater | Biology of Bird Song: Temperate and Tropical Perspectives |
M. Vancatova | Communication Between Human and Gray Parrot | |
(Psittacus erithacus): Two Learning Models | ||
03.07. | J. Heinze | Chemical Communication in Social Insects: |
Pheromones in Honest Signalling and Deception | ||
K. Reinhold | Evolutionary Ecology of Female Choice in a Grasshopper | |
10.07. | J. Krause | Collective Behavior |
R. James | Aggregation Behavior | |
15.07. | J. Krause | Social Networks in Fish |
D. Mundici | Asymmetric Error Correction Below the Sphere | |
Packing Bound | ||
17.07. | V. Janik | Mechanisms of information transfer in marine mammals |
K. Riebel | Developmental influences on female perception of | |
mating signals | ||
22.07. | J. Call | Social Cognition and Gestural Communication in The |
Great Apes | ||
I. Couzin | Collective Animal Behavior | |
23.07. | M. Wolf | Frustration and Entanglement |
M. Keyl | Quantum State Estimation and Large Deviations | |
D. Petz | Sufficiency of Quantum Communication Channels | |
A Vasilieva | On the Reconstruction of Perfect Codes | |
24.07. | H. Markowitsch | Neuropsychology of Memory and Memory Disturbances |
I. Wachsmuth | Embodied Communication |
29.07. | S. Avgustinovich | Multidimensional Permanents |
A. Uhlmann | On the Optimisation Problem in the Definition of | |
Entanglement of Formation and Similar Functions | ||
31.07. | E. Arikan | Creating Correlated Channels for Coding Gains |
H. Nagaoka | Exponential Families of Markov Chains | |
05.08. | Faina Solovyeva | On Ranks and Kernels of Perfect Binary Codes |
V. Lebedev | Upper Bounds on the Rate of Cover Free Codes | |
07.08. | P. Damaschke | Algorithmic Problems With Small Subsets: Threshold |
Group Testing, Hitting Sets and Phylogeny Reconstruction | ||
J. Van Zanten | Separability in Binary and N-ary Gray Codes |
Problem Sessions | ||
---|---|---|
19.08. | C. Elsholtz | Sums of one and multi-dimension sets |
H. Nagaoka | Quantum hypothesis testing | |
R. Ahlswede | Statistics for not completly specified distrubutions | |
C. Deppe | Problems in Information Theory | |
and Language Evolution | ||
V. Blinovsky | Two open problems in coding theory | |
21.08. | K. Kobayashi | The trapdoor channel |
F. Solov'eva | Designs and perfrect codes | |
E. Laber | Hot links assignment on the web | |
T. Klove | Optimal error correcting codes | |
U. Leck | Conjectures in finite fields | |
M. Liskiewicz | Privacy in a non private envirenment | |
26.08. | N. Cai | Private Capacity of the Broadcast Channel |
V. Lebedev | Ridgidity of Hamming Spaces | |
S. Artmann | Organic Codes | |
E. Arikan | Cutoff Rate Enhancment | |
28.08. | H. Aydinian | Some Extremal Problems |
R. Ahlswede | Four Rounds Conjecture | |
R. Ahlswede | Rates needed for extracting one bit | |
R. Ahlswede | Eight Old Problems in Information | |
and Computation |