Topic
- Computing and Processing
- Components, Circuits, Devices and Systems
- Communication, Networking and Broadcast Technologies
- Power, Energy and Industry Applications
- Signal Processing and Analysis
- Robotics and Control Systems
- General Topics for Engineers
- Fields, Waves and Electromagnetics
- Engineered Materials, Dielectrics and Plasmas
- Bioengineering
- Transportation
- Photonics and Electrooptics
- Engineering Profession
- Aerospace
- Geoscience
- Nuclear Engineering
- Career Development
- Emerging Technologies
- Telecommunications
- English for Technical Professionals
Karl Bringmann
Affiliation
Saarland University and Max Planck Institute for Informatics Saarland Informatics Campus, Saarbrücken, Germany
Topic
Running Time,Basic Problem,Combination Of Algorithms,Context-free Grammar,Edit Distance,Linear Time,Lower Bound,Pattern Matching,Problem In Time,String Length,Algorithm For Problem,Alphabet Size,Arbitrary Matrix,Binary Search,Bioinformatics Problems,Case Assumptions,Central Problem,Classification Algorithms,Common Subsequence,Components Of The Graph,Compression Scheme,Computer Code,Conjecture,Constant Factor,Constant Probability,Convolution,Dijkstra’s Algorithm,Directed Graph,Divisible,Divisor,Edge Weights,Edit Operations,Exact Algorithm,Exhaustive Search,Fast Fourier Transform,Fine-grained Complexity,Gold Standard,Graph Problems,Hamming Distance,Hardness Results,High Probability,Homogeneous Expression,Inner Nodes,Input Graph,Linear Graph,Lowest Position,Machine Model,Matching Algorithm,Matrix Multiplication,Matrix Production,
Biography
Karl Bringmann received the M.Sc. degree in computer science and mathematics from Saarland University, Saarbrücken, Germany, in 2011. He is currently working toward the Ph.D. degree at Algorithms and Complexity Group, Max Planck Institute for Informatics, Saarbrücken.
His research interests include randomized algorithms (including sampling algorithms and evolutionary algorithms), computational geometry, and lower bounds.
Mr. Bringmann received the Google Europe Fellowship in Randomized Algorithms in 2012.
His research interests include randomized algorithms (including sampling algorithms and evolutionary algorithms), computational geometry, and lower bounds.
Mr. Bringmann received the Google Europe Fellowship in Randomized Algorithms in 2012.