A5082922326- Algorithms and Data Compression
- Parallel Computing and Optimization Techniques
- Data Management and Algorithms
- Advanced Data Storage Technologies
- Interconnection Networks and Systems
- VLSI and FPGA Design Techniques
- Graph Theory and Algorithms
- Advanced Database Systems and Queries
- Advanced Graph Theory Research
- Optimization and Search Problems
- Caching and Content Delivery
- Distributed systems and fault tolerance
- Distributed and Parallel Computing Systems
- Complexity and Algorithms in Graphs
- Scheduling and Optimization Algorithms
- DNA and Biological Computing
- Advanced Image and Video Retrieval Techniques
- Cloud Computing and Resource Management
- Network Packet Processing and Optimization
- Complex Network Analysis Techniques
- Embedded Systems Design Techniques
- Constraint Satisfaction and Optimization
- Mathematical Control Systems and Analysis
- Computational Geometry and Mesh Generation
- Transportation Planning and Optimization
Karlsruhe Institute of Technology
2016-2025
Instituto de Física Teórica
2017-2024
Hologic (Germany)
2024
Utah Valley University
2020-2021
Brigham Young University
2015-2018
University of Bergen
2018
Maxeler Technologies (United Kingdom)
2014-2017
Goethe University Frankfurt
2017
Karlsruhe University of Education
1997-2015
Royal North Shore Hospital
2015
The famous max-flow min-cut theorem states that a source node s can send information through network (V, E) to sink t at rate determined by the separating and t. Recently, it has been shown this also be achieved for multicasting several sinks provided intermediate nodes are allowed re-encode they receive. We demonstrate examples of networks where achievable rates obtained coding arbitrarily larger than if is not allowed. give deterministic polynomial time algorithms even faster randomized...
Suffix trees and suffix arrays are widely used largely interchangeable index structures on strings sequences. Practitioners prefer due to their simplicity space efficiency while theoreticians use linear-time construction algorithms more explicit structure. We narrow this gap between theory practice with a simple algorithm for arrays. The is demonstrated C++ implementation of 50 effective lines code. called DC3, which stems from the central underlying concept difference cover . This view...
Contraction hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handles networks of whole continents. During preprocessing step, we exploit the inherent hierarchical structure by adding shortcut edges. A subsequent modified bidirectional Dijkstra can then find path fraction millisecond, visiting only few hundred nodes. This small search space makes it suitable to implement on mobile device. We present implementation that also...
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n ċ log + m) operations. However, no work-efficient parallel algorithm is known that runs in sublinear time graphs. In this paper we present a rather simple the problem. Our new algorithm, which call Delta-stepping, implemented very efficiently sequential setting large class of For random maximum node degree d, Δ-stepping needs d L) total...
The famous max-flow min-cut theorem states that a source node s can send information through network (V,E) to sink t at data rate determined by the separating and t. Recently it has been shown this also be achieved for multicasting several sinks provided intermediate nodes are allowed reencode they receive. In contrast, we present graphs where without coding must factor Ω(log|V|) smaller. However, so far no fast algorithms constructing appropriate schemes were known. Our main result...
When you drive to somewhere far away, will leave your current location via one of only a few important traffic junctions. Starting from this informal observation, we developed an algorithmic approach, transit node routing, that allows us reduce quickest path queries in road networks small number table lookups. For maps Western Europe and the United States, our best query times improved over previously published figures by two orders magnitude. This is also more than million faster known...
In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations such techniques. These turn out to give the best results many scenarios, including graphs unit disk graphs, grid networks, time-expanded timetables. Besides these quantitative results, we obtain general insights successful combinations.
Processing large complex networks like social or web graphs has attracted considerable interest. To do this in parallel, we need to partition them into pieces of roughly equal size. Unfortunately, previous parallel graph partitioners originally developed for more regular mesh-like not work well networks. Here address problem by parallelizing and adapting the label propagation technique clustering. By introducing size constraints, becomes applicable both coarsening refinement phase multilevel...