جستجوی استاد راهنمای دانشگاهی

Christian Rossowمشاهده پروفایل

استاد

• Software Security
• System Security
• Network Security
• +۱۵ مورد دیگر

Christian Rossow is Faculty at CISPA – Helmholtz Center for Information Security in Dortmund, Germany, where he leads the System Security research group. He holds dual academic appointments as a professor in the Computer Science department at Saarland University and as an honorary professor at TU Dortmund University. His research spans systems, software, and network security, with a focus on cyber attacks, defenses, and privacy. Research Interests: His primary research areas include software and system security (e.g., exploitation techniques, compiler-assisted defenses, AI-assisted (in)security), network security (e.g., DDoS mitigation, attack attribution, traffic analysis), and cybercrime (e.g., malware analysis, data-driven studies). He emphasizes foundational research with practical applications. Publication Trends: His recent work (2023–2025) shows a strong focus on microarchitectural attacks (e.g., cache side-channels, prefetcher analysis), browser and web security (e.g., sandbox escapes, CSS fingerprinting), network protocol vulnerabilities (e.g., TCP spoofing, infinite loops), and applied cryptography (e.g., ISA extensions for key management). His research consistently targets top-tier venues like IEEE S&P, USENIX Security, ACM CCS, and NDSS. Distinguished Paper Award at IEEE EuroS&P 2021 Best Student Paper Award at MIT Spam Conference 2010 Advising and Grants: He actively supervises PhD students and postdoctoral researchers, with alumni placed in industry (NVIDIA, Crowdstrike, Continental) and academia. His research is supported by major grants including EU H2020 SISSDEN, BMBF-funded BOB, DFG-funded anonymous communication, and RAMSES. He regularly serves in leadership roles in the community, including PC Chair for RAID 2022/2023 and USENIX WOOT 2018, and Track Chair for ACM CCS 2026. Labs and Teams: He leads the System Security research group at CISPA, a world-leading institution for security and privacy. The group comprises talented full-time researchers and focuses on cutting-edge research with strong individual supervision and worldwide collaborations.

Oliver Gasserمشاهده پروفایل

پژوهشگر

• Internet Measurement
• IPv6
• BGP
• +۹ مورد دیگر

Oliver Gasser is a researcher at the Max Planck Institute for Informatics (MPI-INF) and the Technical University of Munich (TUM), where he has co-lectured courses such as Advanced Computer Networking and Master Course Computer Networks. His research focuses on Internet measurement, security, and privacy, with a strong emphasis on IPv6, DNS, BGP, and web tracking technologies. His research interests include Internet measurement, IPv6 deployment, BGP security, DNS infrastructure, web tracking, privacy technologies, and network resilience. He has made significant contributions to understanding IPv6 hitlists, router fingerprinting, hypergiant content delivery networks, and consent banner manipulation on the web. His work combines large-scale active measurements with data analysis to uncover systemic issues in Internet infrastructure and privacy practices. The recent publications highlight a consistent focus on measurement-driven research across networking, security, and privacy. Trends include analyzing IPv6 adoption patterns, detecting covert tracking mechanisms in web cookies, evaluating security of Internet protocols like DNS and BGP, and improving measurement methodologies for large-scale network studies. His work often involves developing open tools and datasets that advance reproducibility in networking research. PAM 2023 Best Paper Award TMA 2023 Best Paper Award TMA 2023 Fast Track Award PAM 2018 Best Paper Award IRTF Applied Networking Research Prize 2018 IMC 2017 Community Contribution Award TMA 2017 Best Dataset Award CoNEXT 2023 Community Contribution Award Oliver Gasser has advised or co-advised over 40 master’s and bachelor’s theses at MPI-INF and TUM, demonstrating strong mentorship in academic research. He has led several measurement projects that have received external funding, including development of the IPv6 Hitlist Service and tools for analyzing web tracking. His community service includes extensive participation in program committees for major networking conferences such as IMC, CoNEXT, PAM, and TMA. He leads and contributes to several open research initiatives including the IPv6 Hitlist Service, SNMPv3 Measurement Service, MPTCP Measurement Service, DNS Observatory, and the BannerClick tool for automated cookie banner interaction. These platforms provide valuable resources for the global networking research community and support reproducible science.

Andrea Bastoniمشاهده پروفایل

پژوهشگر ارشد

• Real-Time Systems
• Cyber-Physical Systems
• Operating System Design
• +۵ مورد دیگر

Dr. Andrea Bastoni is a Postdoctoral Researcher and Research Fellow at the Chair of Cyber-Physical Systems in Production Engineering at Technical University of Munich (TUM), Faculty of Mechanical Engineering. He is also the CTO and co-founder of Minerva Systems , developing operating system solutions for AI-ready embedded applications. His expertise spans real-time operating systems, cyber-physical systems, and predictable system design for heterogeneous platforms. His research focuses on enhancing predictability of memory hierarchies in complex SoCs through techniques like memory bandwidth regulation and cache partitioning. This work has industrial applications in safety-critical domains such as avionics and railways, where he contributes to certifiable hypervisors and operating systems. As former Software Architect of the PikeOS hypervisor at SYSGO GmbH (2012-2020), he specialized in DO-178C, IEC 61508, and EN 50128 standards. His academic background includes a Ph.D. in Computer Engineering from the University of Rome Tor Vergata (2007-2011), where he developed LITMUS^RT as part of UNC's Real-Time Systems Group during a visiting researcher period (2009-2010). His publications reflect ongoing work on Multicore Real-Time Scheduling , Mixed-Criticality Task Isolation, and Arm DynamIQ shared unit analysis. He actively participates in program committees for conferences like RTSS, DSN, and DATE.

• Algorithms for Big Data
• Parallel Computing
• External-Memory Algorithms
• +۵ مورد دیگر

Ulrich Meyer is a Professor at the Institute for Computer Science at Goethe University Frankfurt. He serves as a prominent researcher in algorithms for big data, with extensive contributions to parallel and external-memory graph algorithms. His work spans theoretical foundations and practical implementations for processing large-scale data sets. Spokesperson of the DFG priority program (SPP 1736) on Algorithms for Big Data in Germany SEA23 Symposium on Experimental Algorithms, Steering Committee Chair ALENEX23 Algorithm Engineering and Experiments, Program Committee Member Professor Meyer's research interests focus on the theoretical and experimental aspects of processing large data sets on advanced computational models. His work particularly emphasizes parallel and external-memory graph algorithms, with recent focus on efficient large-scale network generation according to various stochastic models. His research has produced significant contributions including the parallel Delta-Stepping algorithm (which received the ESA Test of Time Award in 2019) and the first BFS approach with sublinear I/O. He has also explored more specialized topics like energy-efficient sorting (with records in the JouleSort competition 2009/10 and the Germany Land of Ideas Award) and fragile computing (which earned him a best-paper award at ESA 2019). His recent publications demonstrate a strong focus on graph algorithms, network generation, and parallel computing techniques. The research trends show consistent advancement in scalable algorithms for massive graphs, with particular emphasis on efficient sampling methods, shortcutting techniques, and communication-free distributed approaches. His work bridges theoretical computer science with practical engineering considerations for real-world big data applications. ESA Test of Time Award 2019 for Parallel Delta-Stepping algorithm Records in the JouleSort competition 2009/10 Germany Land of Ideas Award Best-paper award at ESA 2019 for fragile computing research Professor Meyer has made substantial contributions to the academic community through his leadership in the DFG priority program on Algorithms for Big Data, which has fostered significant research collaborations across Germany. His extensive publication record in top venues demonstrates sustained research productivity and impact in the algorithms community. While specific grant details aren't provided in the text, his role as spokesperson for a major DFG priority program indicates substantial research funding and leadership responsibilities. His work appears to be conducted within collaborative research environments focused on algorithm engineering and experimental evaluation. His research appears to be conducted within the Institute for Computer Science at Goethe University Frankfurt, likely involving collaborations with other researchers in the Algorithms for Big Data priority program. The extensive list of co-authored publications suggests active participation in research teams focused on parallel algorithms, graph processing, and network generation.

Rolf Wankaمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Swarm Intelligence
• +۳ مورد دیگر

Prof. Dr. Rolf Wanka is a Professor at the Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), specializing in efficient algorithms and combinatorial optimization. His research focuses on swarm intelligence, discrete optimization algorithms, and scheduling problems, particularly in timetabling and robotics applications. Education : Sc.D. (Dr. rer. nat.) in Computer Science His work includes theoretical and experimental analyses of particle swarm optimization (PSO) algorithms, addressing runtime complexity, stagnation behavior, and convergence properties. He has developed novel heuristics for timetabling and sorting problems, with applications in multi-robot systems and medical imaging. Notable collaborations include studies on Markov chain-based PSO and fairness in academic scheduling. Key trends in his recent publications span swarm intelligence , discrete optimization , and scheduling heuristics , with a focus on robust timetabling , runtime analysis , and stochastic algorithm behavior . While no explicit scientific awards are listed, his mentorship in the Max Weber-Programm highlights his advisory role in academia. His publications demonstrate interdisciplinary applications of algorithms in robotics , medical imaging , and parallel computing , leveraging both theoretical rigor and practical experimentation. The full description below provides exhaustive details on his academic contributions and affiliations.

Manuel Penschuckمشاهده پروفایل

پژوهشگر ارشد

• Algorithm Engineering
• Random Graphs
• Parallel and Distributed Computing
• +۳ مورد دیگر

Manuel Penschuck is a Research Fellow at the Institute of Computer Science , Goethe University Frankfurt, Germany. His research focuses on algorithm engineering, graph theory, and scalable network generation, with emphasis on parallel computing, I/O-efficient algorithms, and random graph models. He actively contributes to conferences like ESA, SEA, and IPDPS, and has co-authored publications in top venues including LIPIcs , IEEE Transactions , and SIAM . His work includes engineering algorithms for non-linear preferential attachment , parallel shuffling , and hyperbolic graph generation . He has co-organized program committees for ESA, EuroPar, and SEA, and his collaborations span institutions such as MPI-INF, TU Darmstadt, and Australian National University. Recent publications highlight advances in uniform graph sampling, geometric network models, and distributed systems. His research integrates theoretical rigor with practical implementation, addressing challenges in big data and high-performance computing. He is a key contributor to the Networkit toolkit for large-scale network analysis.

Benjamin Sugerمشاهده پروفایل

پژوهشگر

• Robotics
• Autonomous Systems
• Traversability Analysis
• +۶ مورد دیگر

Benjamin Suger is a researcher in the Department of Computer Science at the University of Freiburg, affiliated with the Autonomous Intelligent Systems group within the Faculty of Engineering. His work centers on robotics and intelligent systems, particularly in autonomous navigation and environment modeling. Diploma in Mathematics, University of Freiburg (2003–2011) PhD Student, Autonomous Intelligent Systems Group, University of Freiburg (2011–2017) His research interests include traversability analysis, SLAM, 3D modeling, and mobile robotics. He applies machine learning and computer vision techniques to enable robust robot navigation in complex and dynamic environments. His work often integrates sensor data from 3D lidar and visual systems to improve perception and localization. The recent publications highlight a strong focus on long-term autonomy, outdoor navigation, and memory-efficient SLAM algorithms. Key themes include handling perceptual changes, terrain adaptability, and integration of open geospatial data like OpenStreetMap. His work bridges theoretical algorithm development with real-world robotic applications. Scientific recognition includes being a finalist for the Best Conference Paper Award. This reflects the impact and quality of his contributions to the robotics community. Best Conference Paper Award Finalist Benjamin Suger has contributed significantly to research projects such as LifeNav and has served as a teaching assistant for the Introduction to Mobile Robotics course. While no direct advising of students is listed, his collaborative work with prominent researchers like Wolfram Burgard indicates active participation in a larger academic and research team. He has not received external grant mentions in the provided text. He is part of the Autonomous Intelligent Systems lab at the University of Freiburg, a leading group in robotics research, where he contributes to advancing the state of the art in autonomous navigation and environmental understanding for mobile robots.

Laxman Dhulipalaمشاهده پروفایل

استادیار

• Parallel Algorithms
• Graph Processing
• Parallel Clustering
• +۷ مورد دیگر

Laxman Dhulipala is an Assistant Professor in the Department of Computer Science at the University of Maryland, College Park, and a research scientist at Google Research in the Graph Mining team. He holds a Ph.D. from Carnegie Mellon University, advised by Guy Blelloch, and was a postdoctoral researcher at MIT with Julian Shun. Ph.D., Carnegie Mellon University Postdoctoral Research, MIT His research focuses on efficient parallel algorithms, particularly for graph processing and clustering. He explores theoretical and practical models of parallel computation aligned with modern hardware. His work spans parallel graph algorithms, computational geometry, and scalable systems for massive datasets. The recent publications demonstrate a strong trend in scalable and dynamic graph algorithms, with a focus on hierarchical clustering, connectivity, and benchmarking. Key themes include batch-dynamic updates, memory-efficient data structures, and practical parallel implementations for massive-scale problems. Many works appear in top venues such as SPAA, VLDB, NeurIPS, and SIGMOD. Best Paper Award at VLDB'25 Best Paper Award at SPAA'22 Best Paper Runner Up at VLDB'22 Distinguished Paper Award at PLDI'19 Best Paper Award at SPAA'18 Memorable Paper Award Finalist at NVMW'20 Honorable Mention, CMU SCS Dissertation Award Nominated for ACM Dissertation Award Dhulipala has advised and collaborated with numerous students and researchers, including Quinten De Man, Shangdi Yu, Jessica Shi, and others, contributing to influential projects such as Aspen, ParGeo, GBBS, and ParlayLib. He has received recognition for both theoretical and practical contributions to parallel computing. He teaches courses such as CMSC858N (Scalable Parallel Algorithms and Data Structures) and CMSC451 (Design and Analysis of Computer Algorithms). He is actively involved in building tools and frameworks for parallel algorithm development and evaluation, including benchmark suites and graph processing systems. His dual affiliation with academia and Google Research enables impactful, scalable research bridging theory and practice.

Andrey I. Lyakhovمشاهده پروفایل

استاد

• Wireless Networks
• IEEE 802.11 Protocol
• Network Performance Analysis
• +۳ مورد دیگر

Andrey I. Lyakhov is a Professor and Doctor of Computer Science at the Institute for Information Transmission Problems of the Russian Academy of Sciences. He serves as the Head of Laboratory №18 and has been active since 1959. His research focuses on wireless networks, particularly IEEE 802.11 and 802.16 protocols. Position: Laboratory Chief Affiliation: Institute for Information Transmission Problems, Russian Academy of Sciences Research Interests: Wireless Networks, MAC Protocol Analysis, Network Performance, Distributed Control, Multicast QoS, Channel Assignment His work includes analytical modeling of data transmission, beaconing in mesh networks, and studies on network unfairness and congestion. He has contributed to patents in wireless sensor networks and piconet beacon management. Notable publications span wireless LANs, WiMAX, and sensor network optimization. Lyakhov's research has involved collaborations with international conferences and journals, focusing on throughput estimation, channel contention, and quality of service in wireless systems. Recent publications include studies on bandwidth piggybacking (2010), intra-flow interference in mesh networks (2010), and multicast QoS support in WLANs (2007). Earlier works from 1983-2008 cover foundational topics in queueing theory, cache efficiency, and distributed control systems.

• Numerical Linear Algebra
• High Performance Computing
• Krylov Subspace Methods
• +۴ مورد دیگر

Dr. Hussam Al Daas is a Postdoctoral Research Fellow at the Max Planck Institute for Dynamics of Complex Technical Systems since January 2019, specializing in numerical algorithms for large-scale scientific computing. His work bridges theoretical numerical analysis and high-performance implementation. Education: PhD in Applied Mathematics, Inria-Paris and Sorbonne University (2015-2018), funded by TOTAL Master in Fundamental and Applied Mathematics, Paris-Sud University (2012-2014) His research centers on developing communication-avoiding algorithms for sparse linear systems and tensor computations, with emphasis on robust preconditioners (algebraic two-level Schwarz, domain decomposition), Krylov subspace methods, and low-rank approximations. He addresses critical challenges in parallel scalability through rigorous complexity analysis and memory-efficient implementations, particularly for distributed-memory architectures. Analysis of his 2022-2025 publications reveals three dominant trends: (1) Algebraic multilevel preconditioners achieving robustness for ill-conditioned sparse systems, (2) Theoretical communication lower bounds with optimal algorithm design for tensor/matrix operations, and (3) Novel extensions of Krylov methods for sequences of shifted systems and tensor train decompositions. These contributions target reservoir simulation, PDE-constrained optimization, and high-dimensional data problems. Funded by TOTAL during his PhD and currently by the Max Planck Society, his work shows no evidence of student advisement or external grant leadership. He contributes to the Computational Methods in Systems and Control Theory group, focusing on scalable solvers for complex dynamical systems through collaborative software development and algorithmic innovation.

Peer Neubertمشاهده پروفایل

استاد

• Robotics
• Computer Vision
• Artificial Intelligence
• +۳ مورد دیگر

Prof. Dr. Peer Neubert is a Professor and Head of the Intelligent Autonomous Systems (INTAS) Working Group at the University of Koblenz. He is affiliated with the Department of Computer Visualistics (Department 4) and serves as Head of the Institute of Computational Visualistics. His academic roles include membership in the Department Council and Library Committee of FB4. His research focuses on robotics, computer vision, and autonomous systems, with particular emphasis on visual place recognition, SLAM, hyperdimensional computing, and adaptive navigation in dynamic environments. Neubert's work spans theoretical advancements and practical implementations, such as benchmarking systems (e.g., HS3-Bench), efficient algorithms (FETCH, LocalSPED), and sensor-based solutions (HealthWalk). His team addresses challenges in long-term navigation, environmental adaptation, and data-efficient learning. Collaborations include external PhD students like Kenny Schlegel and projects like MineSweeper, demonstrating interdisciplinary impact. His contributions are reflected in over 50 publications since 2007, covering topics from hyperspectral segmentation to biomedical applications. While no formal educational details are provided, his extensive research output and leadership roles underscore his expertise in computational visualistics and autonomous systems.

Ulrich Meyerمشاهده پروفایل

استاد

• Algorithm Engineering
• Big Data
• High Performance Computing
• +۵ مورد دیگر

Prof. Dr. Ulrich Meyer is a full Professor of Computer Science at Goethe University Frankfurt, where he joined as a full professor in 2007 at the age of 35. He is also a Fellow at the Frankfurt Institute for Advanced Studies (FIAS) since 2020 and serves as the spokesperson for the DFG priority program "Algorithms for Big Data" (SPP 1736), which spans over 15 sites across Germany, Austria, and Switzerland. Professor Meyer received his Ph.D. in computer science from Saarland University in 2002. Following his doctorate, he worked as a postdoc and later as a senior researcher (W2) at the Max-Planck Institute for Computer Science in Saarbrücken before joining Goethe University Frankfurt. His research focuses on the design and engineering of algorithms and data structures for very large data sets, with particular emphasis on parallelism (Shared-Memory, clusters, GPUs), memory hierarchies (caches, SSDs, hard disks), and energy efficiency. His work spans the spectrum from theoretical worst-case results and average-case analyses to experimental evaluation of heuristics. A significant portion of his research involves graph algorithms, where his group has achieved more than a thousand-fold speed-up over state-of-the-art methods through algorithms with better access patterns. His recent work has focused on memory-efficient graph exploration in dynamically changing data, approximate solutions, and efficient generation of randomized graph test data. Professor Meyer has received numerous prestigious awards including the 2019 ESA Test of Time Award for the Delta-Stepping Algorithm, Best Paper Awards at ESA 2019 for research on Fragile Computing and Graph Generation, the 2011 Award Germany Land of Ideas for Ecosort, records in the JouleSort Competition in 2009/10, and the 2003 Best Dissertation Award from the University of Saarland. As spokesperson for the DFG priority program SPP 1736 "Algorithms for Big Data," Professor Meyer coordinates research across multiple institutions. His Algorithm Engineering group is also part of the DFG Research Unit FOR 2971 "Algorithms, Dynamics, and Information Flow in Networks" and the LOEWE Priority Programme CMMS. His research has been supported by various grants that have enabled significant contributions to parallel and external-memory graph algorithms, large-scale network generation, and energy-efficient computing. Professor Meyer's research group forms part of the Computer Sciences and AI Systems division at FIAS. They collaborate extensively with researchers across Europe through the DFG priority program and other initiatives. The group is particularly known for their work on memory-efficient graph algorithms, large-scale network generation, and contributions to understanding the algorithmic foundations of big data processing.

Brigitta Kusterمشاهده پروفایل

استاد

• Cultural Studies
• Migration Studies
• Border Regimes
• +۴ مورد دیگر

Prof. Brigitta Kuster is a Professor at Humboldt University of Berlin's Institute for Cultural Studies, serving as Deputy Director. Her work focuses on migration, border regimes, colonial/postcolonial studies, and film/media theory. She holds leadership roles in interdisciplinary projects like the transdisciplinary NoGoAreas initiative and has organized conferences such as UN/SOUNDING GENDER (2018). Her research critiques digital border control systems (e.g., Eurodac) and explores decolonial archives through film. She co-edited volumes on Med Hondo's cinema and contributed to policy analyses on migration governance. Kuster’s work bridges academic research with artistic practices, emphasizing ethical and political dimensions of cultural production. Education details are unspecified in provided texts, but her career spans over two decades with affiliations at institutions like Ruhr University Bochum and Goethe-Institut Johannesburg. She advises on film research and manages technical resources for student projects through her team. Her global engagements include lectures at universities in Vienna, Thessaloniki, and Dakar, addressing topics like 'Cinema as Care' and 'Decolonial Film Practices.'

• Database Systems
• Big Data Management
• XQuery Processing
• +۳ مورد دیگر

Vinayak R. Borkar is a researcher and software engineer affiliated with the University of California, Irvine, where he completed his PhD in 2016. His work focuses on big data platforms, database systems, and scalable query processing frameworks. PhD in Big Data Processing (UC Irvine, 2016) Contributions to Apache AsterixDB, Hyracks, and Pregelix Industry experience at BEA Systems (2000s) Research interests include database systems , big data management , XQuery optimization , and dataflow engines . His publications analyze scalable similarity queries, memory management, and declarative approaches to machine learning. Recent articles explore Apache AsterixDB , dataflow compilation , and graph analytics . Collaborators include Michael J. Carey and Alexander Behm.

Hannes Mühleisenمشاهده پروفایل

استاد

• Database Systems
• Data Engineering
• Embedded Analytics
• +۳ مورد دیگر

Hannes Mühleisen is Professor of Data Engineering at Radboud University Nijmegen and a Senior Researcher at Centrum Wiskunde & Informatica (CWI) in Amsterdam. He co-founded DuckDB Labs and created the DuckDB database management system. His research focuses on database systems and data engineering , with specific interests in embedded analytics , columnar processing , and query optimization . The DuckDB project has led to innovations in in-process analytical databases and extensible database architectures . Recent publications emphasize parser extensibility , external memory algorithms , and web-based data processing . His work bridges database engineering with data science through techniques like progressive indexing and tensor-accelerated queries . He maintains professional affiliations with: Radboud University Nijmegen (Academic) CWI Amsterdam (Research) DuckDB Labs (Industry) Contact information: Email: hannes@duckdblabs.com Professional profiles: Website , GitHub , LinkedIn