Mathematics in BerlinHeinrich Begehr, Helmut Koch, Jürg Kramer, Norbert Schappacher, Ernst-Jochen Thiele Springer Science & Business Media, 21 июл. 1998 г. - Всего страниц: 216 This little book is conceived as a service to mathematicians attending the 1998 International Congress of Mathematicians in Berlin. It presents a comprehensive, condensed overview of mathematical activity in Berlin, from Leibniz almost to the present day (without, however, including biographies of living mathematicians). Since many towering figures in mathematical history worked in Berlin, most of the chapters of this book are concise biographies. These are held together by a few survey articles presenting the overall development of entire periods of scientific life at Berlin. Overlaps between various chapters and differences in style between the chap ters were inevitable, but sometimes this provided opportunities to show different aspects of a single historical event - for instance, the Kronecker-Weierstrass con troversy. The book aims at readability rather than scholarly completeness. There are no footnotes, only references to the individual bibliographies of each chapter. Still, we do hope that the texts brought together here, and written by the various authors for this volume, constitute a solid introduction to the history of Berlin mathematics. |
Содержание
Mathematics at the Prussian Academy | 17 |
Gustav Peter Lejeune Dirichlet | 34 |
Carl Gustav Jacob Jacobi | 42 |
Keynote Papers | 1 |
Invited Papers | 24 |
Integrating Semantics for ObjectOriented System Models 40 | 40 |
Modelling with Partial Orders Why and Why Not? 61 | 61 |
71 | 63 |
Total Colorings of Degenerated Graphs | 506 |
Decidable Properties of Graphs of AllOptical Networks | 519 |
Language Theory Codes and Automata | 543 |
Mathematics at the Berlin Technische | 555 |
Combinatorics of ThreeInterval Exchanges | 567 |
Decision Questions Concerning Semilinearity Morphisms | 579 |
The Trace Coding Problem Is Undecidable | 603 |
Minimal TailBiting Trellises for Certain Cyclic Block Codes | 627 |
Algebraic and Circuit Complexity | 80 |
On Generating All Minimal Integer Solutions for a Monotone System | 92 |
Division Is in Uniform TC0 | 104 |
Algorithm Analysis | 115 |
Einstein in Berlin | 117 |
The Nazi era the Berlin way | 127 |
A Characterization of Temporal Locality and Its Portability across | 128 |
The University of Berlin from | 137 |
The Complexity of Constructing Evolutionary Trees Using Experiments | 140 |
Helmut Hasse Hermann Ludwig Schmid | 143 |
H Begehr Freie Universität Berlin a summary of its history | 151 |
Hidden Pattern Statistics | 152 |
Combinatorics and Algorithms on LowDiscrepancy Roundings | 166 |
AllPairs Shortest Paths Computation in the BSP Model | 178 |
Fast Algorithms Fast Computers | 183 |
Approximation and Optimization | 190 |
Approximation Hardness of TSP with Bounded Metrics | 201 |
The RPR2 Rounding Technique for Semidefinite Programs | 213 |
Approximation Algorithms for Partial Covering Problems | 225 |
On the Online Bin Packing Problem 237 | 239 |
Quick kMedian kCenter and Facility Location for Sparse Graphs | 249 |
Complexity | 257 |
Subexponential Parameterized Algorithms Collapse the WHierarchy | 273 |
New Imperfect Random Source with Applications to CoinFlipping | 297 |
Sources of photographs 197 | 301 |
WeisfeilerLehman Refinement Requires at Least a Linear Number | 322 |
On Interactive Proofs with a Laconic Prover 334 | 337 |
Lower Bounds in the Quantum Cell Probe Model | 358 |
Noninterference for Concurrent Programs | 382 |
Distributed Controller Synthesis for Local Specifications | 396 |
Towards Quantitative Verification of Probabilistic Transition Systems | 421 |
Efficient Datastructures | 433 |
VisibilityBased PursuitEvasion in a Polygonal Region by a Searcher 456 | 459 |
Graph Algorithms | 481 |
Structural Complexity | 629 |
Model Checking of Unrestricted Hierarchical State Machines | 652 |
Symbolic Trace Analysis of Cryptographic Protocols | 667 |
Tree Automata with One Memory Set Constraints | 682 |
Acyclicity and HypertreeWidth | 708 |
Networks and Routing | 732 |
Routing in Trees | 757 |
Online Packet Routing on Linear Arrays and Rings | 773 |
Reasoning and Verification | 797 |
A SetTheoretic Framework for AssumeGuarantee Reasoning | 821 |
Foundations for Circular Compositional Reasoning | 835 |
Scheduling | 848 |
The Buffer Minimization Problem for Multiprocessor Scheduling | 862 |
On Minimizing Average Weighted Completion Time of Multiprocessor | 875 |
Secure Computation | 898 |
Secure Multiparty Computation of Approximations | 927 |
Specification and Deduction | 951 |
KnuthBendix Constraint Solving Is NPComplete | 979 |
Amalgamation in CASL via Enriched Signatures | 993 |
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution | 1005 |
FiniteState Dimension | 1028 |
Communication Gap for Finite Memory Devices | 1052 |
Separating Quantum and Classical Learning | 1065 |
Author Index | 1081 |
Accelerating Matrix Product on Reconfigurable Hardware for Signal | 101 |
Synthesizing RTL Hardware from Java Byte Codes 123 | 123 |
Encryption | 142 |
JBitsTM Implementations of the Advanced Encryption Standard | 162 |
The Mathematical Institute of | 177 |
ChipBased Reconfigurable Task Management 182 | 182 |
Addresses of authors and editors 199 | 199 |
Graphics and Vision | 205 |
Reconfigurable FrameGrabber for RealTime Automated Visual | 223 |
Другие издания - Просмотреть все
Mathematics in Berlin Heinrich Begehr,Helmut Koch,Jürg Kramer,Norbert Schappacher,Ernst-Jochen Thiele Ограниченный просмотр - 2012 |
Mathematics in Berlin Heinrich Begehr,Helmut Koch,Jürg Kramer,Norbert Schappacher,Ernst-Jochen Thiele Ограниченный просмотр - 1998 |
Часто встречающиеся слова и выражения
algebra ambient apply approximation algorithm assume automata automaton binary bisimulation bits Büchi automaton cache CDAG coloring competitive ratio complexity components Computer Science configuration consider constraints construct corresponding defined definition denote edge exists finite formal formal power series formula fractional coloring function given graph G Hence HSMs hypergraph ICALP input instance integer labeled language Lemma length linear LNCS lower bound M₁ machine mathematics matrix minimal model checking Moore machines node NP-hard obtained optimal pair paper parameterized path permutation planar graphs polynomial probabilistic problem Proc proof Proposition protocol prove quantum query random rewriting rounding rule satisfies schedule Section semantics sequence server simulation solution Springer-Verlag string structure subset symbol Theorem theory trace monoids transition tree trellis V₁ variables vectors vertex VERTEX COVER vertices weight