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

Mohammadtaghi Hajiaghayiمشاهده پروفایل

استاد

• Design and Analysis of Algorithms
• Approximation Algorithms
• Fixed-Parameter Algorithms
• +۸ مورد دیگر

Mohammadtaghi Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at the University of Maryland, College Park. He is affiliated with the Robert H. Smith School of Business and holds Research Affiliate positions at MIT CSAIL and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). His research focuses on algorithms, game theory, and network design, supported by NSF, ONR, and industry grants. He has received prestigious awards including ACM Fellow (2018) and EATCS Nerode Prize (2015) for his work on bidimensionality theory. Education: PhD from MIT (2005), postdocs at CMU and MIT, MSc from University of Waterloo, and BSc from Sharif University. He teaches courses like Data Science and Algorithms at UMD. Industry experience includes roles at Amazon, Google, and AT&T Labs. Over 20 students have graduated under his advisement, many in academia and industry. His work spans approximation algorithms, game theory, and big data. Projects include BigDND with Erik Demaine. He serves on editorial boards of Algorithmica, SODA, and others. Awards also include IEEE Fellow (2020) and Blavatnik Honoree (2020).

• Algorithmic and data justice
• Internet studies
• Technology and society
• +۹ مورد دیگر

Juan Carlos De Martin is a Full Professor of Computer Engineering at the Polytechnic of Turin, where he is also co-founder and co-director of the Nexa Center for Internet & Society. He holds a Faculty Associate position at the Berkman Klein Center for Internet & Society at Harvard University and is a member of the Scientific Council of the Treccani Institute and the Steering Committee of Biennale Democracy. He previously served as Vice Rector for Culture and Communication at the Polytechnic of Turin (2018–2023) and as president of its libraries (2007–2015). His research centers on the societal implications of digital technologies, with a strong emphasis on algorithmic and data justice, digital power, and the democratic challenges posed by modern technology. He advocates for a more democratic and ethical technological future, particularly critiquing the dominance of smartphones and promoting digital sovereignty. His recent publications reflect a clear trend toward ethical AI, data protection, and the social impact of algorithms. He has published on gender bias in language models, GDPR compliance tools, and non-discrimination audits in software, demonstrating a sustained commitment to fairness, transparency, and accountability in digital systems. Best Student Paper Award IEEE ISCC 2011 Best Student Paper Award IEEE ICME 2005 Fellow at Harvard University (Berkman Klein Center) (2011–2015, 2016–2024) Faculty Associate at Collège d'études mondos, France (2016) De Martin has advised PhD students like Marco Rondina on Responsible AI and has led numerous EU-funded research projects such as COMMUNIA and DECODE. He has also played a key role in public policy, serving on ministerial working groups on AI and online hate. He is the founder of the Biennale Tecnologia and has authored influential books on the future of universities and technology, all published under Creative Commons licenses. He leads the Nexa Center for Internet & Society, a multidisciplinary research group focused on the legal, economic, and social aspects of the Internet. The center fosters collaboration between computer scientists, legal scholars, and social scientists to address pressing digital challenges.

Paul Neville Balisterمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +۴ مورد دیگر

Professor Paul Neville Balister is a faculty member and Fellow in the Mathematical Institute at the University of Oxford, where he serves as a University Lecturer and Professor of Mathematics. His research is centered in combinatorics and discrete mathematics, with strong ties to probabilistic methods and theoretical computer science. His research interests include combinatorics, graph theory, random graphs, probabilistic combinatorics, cellular automata, and discrete probability. These areas are evident from his extensive publication record in top-tier mathematical journals such as the Journal of the European Mathematical Society and Random Structures and Algorithms . The recent publications demonstrate a consistent focus on structural and probabilistic aspects of discrete systems, particularly in monotone cellular automata, graph saturation games, and random graph orderings. His work often explores threshold phenomena, extremal configurations, and asymptotic behavior in combinatorial models. While no formal awards are listed in the provided text, his active collaboration with leading mathematicians and publication in premier venues indicate significant recognition in the field. Professor Balister advises students and contributes to research grants, though specific names and projects are not detailed. He is part of the Combinatorics research group at Oxford, which fosters collaborative work in discrete mathematics and its applications.

Jordan Shropshireمشاهده پروفایل

استاد

• Information Security
• Data Center Management
• Systems Architecture
• +۳ مورد دیگر

Dr. Jordan Shropshire is the Lawrence Minto Sylvestre Endowed Chair in Computing and a Professor in the Information Systems and Technology Department at the University of South Alabama's School of Computing. His academic journey includes a Ph.D. in Management Information Systems from Mississippi State University (2008) and a B.S. in Business Administration from the University of Florida (2004). Dr. Shropshire's research focuses on cybersecurity, data center management, cloud computing, IoT ecosystems, and systems architecture. His work addresses critical challenges such as post-quantum cryptography, embedded system vulnerabilities, and compliance frameworks for autonomous systems. He has also contributed to studies on developer platform risks, real-time operating system security, and AI-driven systems hardening. Education: Ph.D. – Management Information Systems, Mississippi State University, 2008 B.S. – Business Administration, University of Florida, 2004 His teaching career spans roles at the University of South Alabama (2008–present) and Georgia Southern University, where he held tenure (2008–2014). His publications emphasize practical cybersecurity solutions, including tools for drone compliance and frameworks for secure cloud infrastructure. He has also explored behavioral aspects of security policy adherence and IT professional retention. Dr. Shropshire's work often bridges theoretical research and real-world implementation, with a focus on mitigating emerging threats in cloud systems, IoT, and embedded devices. His research has been supported by grants such as the NSF TWC Small Grant for hypervisor security detection techniques.

• Combinatorics
• Graph Theory
• Algebraic Combinatorics
• +۴ مورد دیگر

Lluis Vena Cros is a distinguished researcher in the Department of Mathematics at Universitat Politècnica de Catalunya - BarcelonaTech (UPC-BarcelonaTech), affiliated with the Faculty of Mathematics and Statistics. He is a core member of the GAPCOMB research group, which specializes in Geometric, Algebraic and Probabilistic Combinatorics. His research spans multiple domains within combinatorics, with particular emphasis on graph theory, algebraic combinatorics, geometric combinatorics, and probabilistic combinatorics. Vena Cros has made significant theoretical contributions to the understanding of graph homomorphisms, Tutte polynomials, Ramsey theory, and extremal combinatorial structures. His work often explores the deep connections between combinatorial objects and other mathematical disciplines such as topology, algebra, and discrete geometry. An analysis of his recent publications reveals a consistent focus on combinatorial structures with applications across multiple mathematical domains. His work on Tutte polynomials for various graph structures demonstrates a unifying approach to graph invariants, while his research in Ramsey theory explores structural properties of large combinatorial objects. The recurring theme across his publications is the investigation of extremal properties and computational aspects of combinatorial configurations. Vena Cros actively participates in multiple research projects including 'Structure, Randomness and Computational Methods in Extremal Combinatorics,' 'COntemporary COmbinatorics and Applications (COCOA),' and the 'Grup GAPCOMB de la UPC.' These projects involve collaborations with numerous researchers across Spain and internationally, reflecting his significant standing in the combinatorial mathematics community. His work has been supported by various funding bodies including the Spanish State Research Agency and the European Union's Horizon 2020 program. As a member of the GAPCOMB research group, Vena Cros contributes to a vibrant mathematical community focused on advancing combinatorial theory and its applications. The group maintains strong connections with other research centers and regularly participates in international conferences and collaborative projects, fostering the exchange of ideas across the global combinatorial mathematics community.

• Software Engineering
• Model Checking
• Formal Verification
• +۴ مورد دیگر

Professor Tomoji Kishi is a distinguished faculty member at Waseda University's School of Creative Science and Engineering, where he has been serving since 2009. Previously, he held academic positions at Japan Advanced Institute of Science and Technology (2003-2009) following a 21-year career at NEC Corporation (1982-2003). He earned his Ph.D. in Information Science from Japan Advanced Institute of Science and Technology in 2002, building upon his earlier engineering graduate studies at Kyoto University. Professor Kishi's research focuses on software engineering, particularly in software product line development, model checking, formal verification, and aspect-oriented modeling. His work bridges theoretical formal methods with practical applications in embedded systems, automotive software, and IoT technologies. He has made significant contributions to scalability challenges in model checking for configurable systems and has pioneered approaches to variability management and approximate modeling techniques. His publication record demonstrates remarkable consistency and evolution, with 42 papers and 153 citations according to Scopus data (h-index: 7), spanning from foundational work in software architecture in the 1990s to cutting-edge research on AI-enhanced verification methods in 2025. His recent work shows increasing application of machine learning techniques to traditional formal methods problems, particularly in the context of highly configurable systems and IoT applications. ITS Standardization Activity Merit Prize (2022) from Society of Automotive Engineers of Japan IPSJ/ITSCJ Standardization Contribution Award (2017) IPSJ/ITSCJ Project Editor Award (2016 and 2013) Information Processing Society of Japan Society Activity Contribution Award (2010) IPA/SEC Journal Best Paper Award (2007) Information Processing Society of Japan Yamashita Memorial Research Award (1998) Professor Kishi has led multiple JSPS-funded research projects, including recent work on 'variability management methods prioritizing usability through variability mining' (2020-2023) and 'utility-first modeling method' (2017-2020). His industry collaborations, particularly with automotive systems developers, demonstrate the practical impact of his research. He maintains active membership in major professional societies including IEEE Computer Society, ACM, and the Information Processing Society of Japan.

Michael Eichbergمشاهده پروفایل

استاد

• Software Engineering
• Static Analysis
• Software Development Tools
• +۳ مورد دیگر

Michael Eichberg is a Professor at Technische Universität Darmstadt, Germany, where his work centers on software engineering, static analysis, programming languages, and secure software development tools. He is the principal architect of the OPAL framework for Java bytecode analysis and has an extensive publication record spanning PLDI, ICSE, ESEC/FSE, ISSTA, ASE, FSE, SOAP, and other premier venues. Research Interests: Static program analysis and its scalability to real-world code bases Software security, particularly cryptographic API misuse and Android app repackaging detection Concurrent and parallel programming models, including deterministic concurrency in Scala Software architecture conformance, drift and erosion detection, and rule reuse Development of open extensible tools and frameworks (OPAL, LectureDoc, QScope, Sextant, XIRC, IRC) Publication Trends: His recent work (2015-2022) demonstrates a strong focus on empirical evaluation of static analysis techniques, modular composition of analyses, and security-related program understanding. Key themes include unsoundness in call graph construction, purity and immutability analyses, parallelization of static analyses, and large-scale studies of cryptographic API misuse. Tools & Frameworks: OPAL – A flexible Java bytecode analysis and manipulation framework (core developer until 2019) LectureDoc 2 – Web-based lecture material authoring and presentation system QScope – Open extensible metrics framework for modern software projects Sextant – Eclipse-integrated software exploration tool XIRC/IRC – Frameworks for enforcing system-wide properties and architectural constraints

• Parallel Programming
• Communicating Sequential Processes
• Software Systems
• +۴ مورد دیگر

Professor Jon Kerridge is a distinguished academic at the School of Computing, Edinburgh Napier University, where he has made significant contributions to parallel programming, software systems, and database applications. With a career spanning several decades, he has published extensively in the field of computer science and has supervised numerous PhD students. BSc, MSc, PhD Fellow of the British Computer Society (FBCS) Chartered IT Professional (CITP) Fellow of the Higher Education Academy (FHEA) Chartered Engineer (CEng) Professor Kerridge's research primarily focuses on parallel programming models, particularly through his work on the Groovy Parallel Patterns Library and Communicating Sequential Processes (CSP). His research spans multiple domains including software engineering, database systems, and interdisciplinary work in neuroscience related to dyslexia. He has also made significant contributions to pedestrian movement modeling and evolutionary algorithms. His publications demonstrate a consistent focus on practical software engineering solutions for parallel and distributed systems. The research trajectory shows progression from foundational work in computer architecture education in the 1980s through database systems in the 1990s-2000s to modern parallel programming frameworks. His interdisciplinary work connecting computer science with visual processing in dyslexia represents an innovative application of computational approaches to neuroscience problems. Fellow of the British Computer Society (FBCS) Chartered IT Professional (CITP) Fellow of the Higher Education Academy (FHEA) Chartered Engineer (CEng) Professor Kerridge has supervised several PhD students to completion, including Kevin Chalmers (Investigating communicating sequential processes for Java to support ubiquitous computing) and Robert Kukla (A software framework for the microscopic modelling of pedestrian movement). His research has been supported by Edinburgh Napier University funding, with applications ranging from healthcare systems to pedestrian flow optimization. He is a key member of the Centre for Algorithms, Visualisation and Evolving Systems at Edinburgh Napier University, where his work continues to influence both theoretical and applied aspects of computing.

Jörg Pohleمشاهده پروفایل

پژوهشگر

• Informatics and Law
• Informatics and Sociology
• Data Protection
• +۶ مورد دیگر

Dr. Jörg Pohle is a PostDoc researcher at the Humboldt Institute for Internet and Society (HIIG) where he heads the research programme 'Data, actors, infrastructures: The governance of data-driven innovation and cyber security' and the 'Global Privacy Governance' project. His interdisciplinary work bridges Informatics, Law, and Sociology, focusing on data protection theory and practice, privacy governance, and the societal implications of digital technologies. Pohle completed his doctorate at Humboldt-Universität zu Berlin with a dissertation on the history and theory of data protection and its implications for ICT system design. His academic background spans Law, Political Science, and Computer Science, with early work examining security of voting computers and related security discourse. His research interests include the intersections of Informatics and Law, Informatics and Sociology, modellification processes, and data protection by design. He has developed critical frameworks like 'Welt → Modell → Technik → Welt' for analyzing how power structures become embedded in sociotechnical systems. His work often takes historical perspectives on data protection debates while addressing contemporary challenges in technology governance. Analysis of his recent publications reveals a strong focus on translating data protection principles into practical applications, particularly in healthcare contexts like nursing care and pandemic response. His research increasingly addresses AI governance challenges, examining large language models' impact on scientific practices and developing legal design patterns for law-technology translation. He advocates for freedom-preserving approaches to digital governance and information separation of powers in digital environments. Pohle serves as a board member of the Working Group on Digitalization as a Challenge for Sociological Theory within the German Sociological Society. He has contributed to significant research projects including 'Strengthening Digital Skills through Micro-Credentials,' 'DUCAH @ HIIG,' and 'Making Repositories and AI Systems Usable in Everyday Nursing Care.' He is a prolific organizer of the annual Interdisciplinary Workshop on Privacy, Data Protection & Surveillance and regularly contributes to policy discussions through media appearances in Handelsblatt, Leipziger Volkszeitung, and specialized podcasts examining the intersection of IT and law.

Reiner Schulzeمشاهده پروفایل

استاد

• German law of obligations
• European contract law
• European tort law
• +۴ مورد دیگر

Reiner Schulze has been Professor of German and European Civil Law at the University of Münster since 1994 and Director of its Institute for Legal History; he concurrently served as a judge at the Higher Regional Court of Hamm (1996-2005) and as Executive Director of Münster’s Centre of European Private Law (1997-2012). Active in European scholarly governance, he was President of the European Law Faculties Association (ELFA) in 2012-13 and remains Chairman of the German section of the Association Henri Capitant. Education & Qualifications 1968 – Abitur 1968-1973 – Law studies, Freie Universität Berlin 1973 – First State Examination in Law 1976 – Doctorate (Dr. iur.), University of Frankfurt a.M. 1978 – Second State Examination in Law 1983 – Post-doctoral degree (Habilitation) Research Interests Schulze’s work straddles dogmatics, history and comparative law, centring on the German and European law of obligations (contract, tort, unjust enrichment), the historical evolution of private law in Europe, and the challenges posed by digitalisation and European integration to traditional contract structures. His recent publications analyse the impact of digital content on European contract rules, the innovative traits of the proposed Common European Sales Law (CESL), and the persistent divergences between French and German contract theories, always embedding doctrinal discussion in wider historical and cultural contexts. Honours & Awards Honorary doctorate (Dr. h.c.), University of Miskolc Member, Real Academia de Jurisprudencia y Legislación (Académicos Honorarios) Member, Accademia Nazionale dei Lincei (Straniero) Officer, Order of Oranje Nassau (for services to German-Dutch legal relations) Academic Leadership & Grants While specific grant details are not listed, Schulze has continuously directed externally funded research projects at the Centre of European Private Law and the Institute for Legal History, hosting numerous international conferences and colloquia that shape the European private-law agenda. Labs & Research Teams He leads the Institute for Legal History at the University of Münster and is the key intellectual motor of the Centre of European Private Law, coordinating a network of doctoral researchers, post-docs and visiting scholars working on historical and comparative aspects of European private law.

Jose M. Vidalمشاهده پروفایل

استاد

• Multiagent Systems
• Agent-based Modeling
• Algorithmic Game Theory
• +۷ مورد دیگر

Jose M. Vidal is a Professor and Director of Undergraduate Studies in the Computer Science and Engineering department at the Molinaroli College of Engineering and Computing, University of South Carolina . He holds a Ph.D. in Computer Science and Engineering from the University of Michigan (1998), an M.S. in Computer Science from Rensselaer Polytechnic Institute (1991), and a B.S. in Computer Science and Engineering from MIT (1990). His research focuses on multiagent systems , spanning theoretical aspects like coordination mechanisms, algorithmic game theory, and distributed algorithms, as well as implementation in agent-based simulations, web services, and mobile applications. He has authored numerous publications in fields including healthcare process optimization, traffic engineering, and sociological theory construction. 2019: Ad Hoc Vehicle Platoon Formation (Traffic Engineering) 2019: Wikitheoria for Sociological Theory Construction 2018: Email Intent Classification using Deep Learning 2017: Intelligent Transportation Systems using Mobile Data 2016: Healthcare Workflow Simulation Models 2014: Behavioral Modeling from Observational Data He has received significant funding from the NSF, Darpa, and industry partners for projects like Wikitheoria (a collaborative theory-building platform), TargetShare (resource allocation), and mobile healthcare applications. His work bridges theoretical research with practical implementations in domains ranging from traffic systems to hospital operations.

Youssef Diouaneمشاهده پروفایل

دانشیار

• Numerical Optimization
• Surrogate Modeling
• Data Science
• +۵ مورد دیگر

Youssef Diouane is an Associate Professor in the Department of Mathematical and Industrial Engineering at Polytechnique Montréal, Canada. Previously, he was a professor in the Department of Complex Systems and Engineering (DISC) at ISAE-SUPAERO in Toulouse, France. He is a member of the Research Group in Decision Analysis (GERAD) and serves as an associate editor for the journal "Computational Optimization and Applications" as well as a guest co-editor for a special issue of "Mathematical Programming" related to the 25th International Symposium on Mathematical Programming. Dr. Diouane's research focuses on numerical optimization and its applications to complex systems, design, and data sciences. His work targets the development of efficient optimization algorithms with optimal guarantees to solve engineering optimization problems. His primary research areas include: Numerical Optimization Surrogate Modeling Data Science and Machine Learning Computational Science and Engineering His recent publication record (57 total publications) demonstrates a strong focus on optimization techniques applicable to aerospace engineering, particularly aircraft design. There's a clear trend toward addressing high-dimensional optimization problems with mixed and categorical variables, often using Bayesian optimization approaches. His work bridges theoretical optimization methods with practical engineering applications, especially in sustainable transport and green aircraft design, reflecting his secondary spheres of excellence in Sustainable Transport and Infrastructures and Industry of the Future and Digital Society. Dr. Diouane has successfully supervised multiple graduate students, including two Master's theses at Polytechnique Montréal completed in 2022 and 2024. His teaching responsibilities include courses on scientific computing for engineers, operational research foundations, and derivative-free optimization, reflecting his commitment to both theoretical and applied aspects of optimization.

• Artificial Intelligence
• Information Theory
• Computational Creativity
• +۳ مورد دیگر

Lav R Varshney is an Associate Professor with joint appointments in Electrical and Computer Engineering, the Siebel School of Computing and Data Science, Industrial Engineering, Neuroscience, and Digital Agriculture at the University of Illinois. His research spans artificial intelligence, information theory, computational creativity, and quantum computing. He leads projects in neuroengineering and digital agriculture through affiliations with the Beckman Institute and NCSA. With 271+ publications, his recent work includes quantum channel communication (2025), AI evaluation benchmarks (2025), and multimodal language models (2025). His research has examined societal aspects including technology adoption dynamics and privacy-enhancing technologies for public service.

Lars Jaffkeمشاهده پروفایل

استادیار

• Graph Algorithms
• Parameterized Complexity
• Structural Graph Theory
• +۲ مورد دیگر

Lars Jaffke is an Assistant Professor in Informatics at NHH Norwegian School of Economics, Bergen, Norway. Previously, he held postdoctoral positions at IT University of Copenhagen (2024), University of Warsaw (2021-2022), and University of Bergen (2020-2021). He earned his PhD in Computer Science from the University of Bergen in 2020. Research Interests: His work focuses on algorithmic and structural aspects of graphs, particularly width measures (treewidth, pathwidth, mim-width) and their applications to graph classes. He investigates parameterized complexity, optimization problems, and algorithm design for graphs with bounded width parameters. Key Publications Trends: Recent works include algorithmic meta-theorems for mim-width, structural analysis of planar graphs, and complexity studies in graph coloring and domination problems. He develops dynamic programming techniques on specialized decompositions and explores logical characterizations of graph algorithms. Scientific Awards: IPEC Best Paper Award (2022) Travel Grant from L. Meltzer Fund (2021) Scholarship in Applied Computer Science, State of NRW (2012) Teaching & Service: He has served as course co-instructor for Algorithms and Programming with Python (2024) and taught Complexity Theory and graph algorithms at University of Bergen. He has been on program committees for IPEC 2024 and ESA 2023, and regularly reviews for top-tier conferences and journals like FOCS, STOC, SIAM Journal on Computing, and Theoretical Computer Science.

Eduardo Martínez Pedrozaمشاهده پروفایل

استاد

• Geometric Group Theory
• Hyperbolic Groups
• Relatively Hyperbolic Groups
• +۷ مورد دیگر

Dr. Eduardo Martínez Pedroza is a Professor in the Department of Mathematics and Statistics at Memorial University of Newfoundland, where he has maintained an active research and teaching career since at least 2011. His academic profile demonstrates sustained contributions to geometric group theory and its connections to geometry and topology. His primary research interests include: Geometric group theory and its applications to geometry and topology Hyperbolic groups and relatively hyperbolic groups Dehn functions and homological Dehn functions CAT(0) groups and non-positively curved cubical complexes Combinatorial games on graphs in relation to coarse geometry Topological data analysis Dr. Martínez Pedroza's recent publications (2023-2025) reveal a continued focus on geometric group theory with increasing emphasis on coarse geometric properties of groups. His work consistently explores quasi-isometry invariants, particularly through the lens of combinatorial games like the Cops and Robber game, and examines structural properties of hyperbolic and relatively hyperbolic groups. A significant portion of his recent research investigates how geometric properties of groups manifest in combinatorial settings, bridging theoretical mathematics with computational aspects. His research has been continuously supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) since 2012, indicating sustained recognition of his contributions to mathematical research. Dr. Martínez Pedroza actively supervises graduate students and has taught a comprehensive range of courses at Memorial University, from undergraduate offerings like Set Theory and Projective Geometry to advanced graduate courses in topology and group theory. His teaching record spans multiple decades, with documented courses from 2011 through the upcoming 2024-2025 academic year.