Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Anne-Cécile Fabret

dblp:12/1650 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 44% Hardware accelerators and domain-specific architectures · 44% Integrated circuit design · 13%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › systolic array
linear systolic array		 0.011996
A Modular Systolic Linearization of the Warshall-Floyd Algorithm · IEEE Trans. Parallel Distributed Syst. 1996
Parallel and multicore computing › parallel algorithms › parallel algorithm design
systolic algorithms		 0.011996
A Modular Systolic Linearization of the Warshall-Floyd Algorithm · IEEE Trans. Parallel Distributed Syst. 1996
Graph algorithms and graph theory
graph algorithms		 0.011996
A Modular Systolic Linearization of the Warshall-Floyd Algorithm · IEEE Trans. Parallel Distributed Syst. 1996
Integrated circuit design
VLSI design		 0.011996
A Modular Systolic Linearization of the Warshall-Floyd Algorithm · IEEE Trans. Parallel Distributed Syst. 1996

Methods — techniques the papers use, named apart from their topics

modular linearization · 0.0geometric methods · 0.0geometric method · 0.0
YearPublicationVenuePosition
1999 On the Complexity of Deadlock Detection in Families of Planar Nets
Bruno Durand 0001, Anne-Cécile Fabret
 Theor. Comput. Sci.2
1996 A Modular Systolic Linearization of the Warshall-Floyd Algorithm
abstract
In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as fast as the fully-pipelined existing ones and, moreover, they need less cells.
Jean Frédéric Myoupo, Anne-Cécile Fabret
 IEEE Trans. Parallel Distributed Syst.2
1995 On the Undecidability of Deadlock Detection in Families of Nets
Anne-Cécile Fabret, Antoine Petit 0001
 STACS1