World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
6208
World Ranking
8494
National Ranking
198

Research.com Recognitions

  • 2016 - ACM Fellow For contributions to branch prediction and cache memory design.

Overview

André Seznec is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their primary field of study is Computer Science, with a focus on several subfields including Hardware and Architecture, Computer Networks and Communications, Artificial Intelligence, Information Systems, and Electrical and Electronic Engineering.

The main topics covered in their work include:

  • Parallel Computing and Optimization Techniques
  • Advanced Data Storage Technologies
  • Algorithms and Data Compression
  • Embedded Systems Design Techniques
  • Cloud Computing and Resource Management
  • Ferroelectric and Negative Capacitance Devices

Selected recent publications by André Seznec include:

  • "Understanding Cache Compression" (2021), published in ACM Transactions on Architecture and Code Optimization
  • "SIMT-X" (2020), published in ACM Transactions on Architecture and Code Optimization
  • "Leveraging Value Equality Prediction for Value Speculation" (2020), published in ACM Transactions on Architecture and Code Optimization

They have collaborated frequently with several co-authors, including:

  • Daniel Rodrigues Carvalho
  • Anita Tino
  • Caroline Collange
  • Kleovoulos Kalaitzidis

All their recent publications appear in the venue ACM Transactions on Architecture and Code Optimization, reflecting a concentration in this journal for disseminating their research findings.

In recognition of their contributions, André Seznec was awarded the status of ACM Fellow in 2016. The citation for this award noted their work on branch prediction and cache memory design.

Best Publications

  • A case for two-way skewed-associative caches

    André Seznec

  • A case for (partially) TAgged GEometric history length branch prediction.

    André Seznec;Pierre Michaud

  • Trading conflict and capacity aliasing in conditional branch predictors

    Pierre Michaud;André Seznec;Richard Uhlig

  • Design tradeoffs for the alpha EV8 conditional branch predictor

    André Seznec;Stephen Felix;Venkata Krishnan;Yiannakis Sazeides

  • Performance implications of single thread migration on a chip multi-core

    Theofanis Constantinou;Yiannakis Sazeides;Pierre Michaud;Damien Fetis

  • Decoupled sectored caches: conciliating low tag implementation cost

    A. Seznec

  • Choosing representative slices of program execution for microarchitecture simulations: a preliminary application to the data stream

    Thierry Lafage;André Seznec

  • Analysis of the O-GEometric History Length Branch Predictor

    Andre Seznec

  • Multiple-block ahead branch predictors

    André Seznec;Stéphan Jourdan;Pascal Sainrat;Pierre Michaud

  • Improving cache behavior of dynamically allocated data structures

    D. N. Truong;F. Bodin;A. Seznec

  • Data-flow prescheduling for large instruction windows in out-of-order processors

    P. Michaud;A. Seznec

  • A new case for the TAGE branch predictor

    Andre Seznec

  • Tarantula: a vector extension to the alpha architecture

    Roger Espasa;Federico Ardanaz;Joel Emer;Stephen Felix

  • The strict avalanche criterion randomness test

    Julio Cesar Hernandez Castro;José María Sierra;Andre Seznec;Antonio Izquierdo

  • Zero-content augmented caches

    Julien Dusser;Thomas Piquet;André Seznec

  • Practical and secure PCM systems by online detection of malicious write streams

    Moinuddin K. Qureshi;Andre Seznec;Luis A. Lastras;Michele M. Franceschini

  • Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs

    Junjie Lai;Andre Seznec

  • Skewed-associative Caches

    André Seznec;François Bodin

  • The L-TAGE Branch Predictor.

    André Seznec

  • A 64-Kbytes ITTAGE indirect branch predictor

    André Seznec

Frequent Co-Authors

Alex Ramirez
Alex Ramirez Google (United States)
Per Stenström
Per Stenström Chalmers University of Technology
Michael F. P. O'Boyle
Michael F. P. O'Boyle University of Edinburgh
Rizos Sakellariou
Rizos Sakellariou University of Manchester
Stefanos Kaxiras
Stefanos Kaxiras Uppsala University
Richard Uhlig
Richard Uhlig Intel (United States)
Erik Hagersten
Erik Hagersten Uppsala University
Guang R. Gao
Guang R. Gao University of Delaware
Eduard Ayguadé
Eduard Ayguadé Barcelona Supercomputing Center
Wayne Luk
Wayne Luk Imperial College London

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens a range of flexible learning and career options online. Many students and professionals are increasingly interested in easy certifications to get online, which can quickly boost skills in coding, IT support, and network security—often leading to well-paid entry-level roles.

For those seeking to advance their careers faster, the shortest masters degree programs offer opportunities to gain an accredited qualification in as little as 12 months. These programs are designed for those looking to accelerate their pathway to in-demand tech positions.

If you are considering your long-term prospects, it’s worth exploring the best masters degree to get in technology fields. These degrees are highly valued by employers and can open doors to specialized roles in areas such as data science, software engineering, and artificial intelligence.

Not ready for a full bachelor’s or master’s program? You can start with associates degrees online, which are flexible and affordable while providing foundational knowledge and a solid stepping stone to higher education or entry-level jobs in tech.

Best Scientists Citing André Seznec

Trending Scientists

Recently Published Articles