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-Marie Tagant

dblp:97/4223 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 3

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
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design		 0.011990
A general and flexible switchbox router: CARIOCA · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Electronic design automation › physical design
routing		 0.011990
A general and flexible switchbox router: CARIOCA · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Electronic design automation › physical design › routing › detailed routing
switchbox routing		 0.011990
A general and flexible switchbox router: CARIOCA · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Electronic design automation › physical design › routing
steiner tree		 0.011990
A general and flexible switchbox router: CARIOCA · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990

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

minimum steiner tree · 0.0expert system · 0.0blackboard architecture · 0.0
YearPublicationVenuePosition
1992 A new tool for random testability evaluation using simulation and formal proof
abstract
A set of tools is described, allowing one to compute random testability measurement for combinational circuits, based on a black box worst case hypothesis. These tools provide enough information to allow circuit modification, in order to meet a prescribed testability value. The efficiency of these tools is due to the use of a statistical method combined with formal proof mechanisms. The random testability of the complete ISCAS benchmark of combinational circuits is computed. For the least testable circuits, a few modifications, guided by the testability measurements, are shown to be sufficient to make them randomly testable.>
Emmanuel Simeu, Anura Puissochet, Jean-Luc Rainard, Anne-Marie Tagant, Michel Poize
 VTS4
1990 A general and flexible switchbox router: CARIOCA
abstract
A switchbox router utilizing layers is presented. Each net is first partitioned into a set of subnets. This decomposition is driven by the minimum Steiner tree. The construction is then carried out on a step-by-step basis, which allows the system to dynamically take new information on the problem into account. The information is examined by a set of expert systems which decide which subnet should be routed next. This part has been implemented with a blackboard architecture. The router can handle pins that are not on a grid on one set of parallel edges. The program has been implemented in the LISP programming language. Many test cases have been run successfully, and some results, including Burstein's difficult switchbox, are presented.>
Pierre-François Dubois, Alain Puissochet, Anne-Marie Tagant
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1988 Carioca-A 'smart' and flexible switch-box router
abstract
A two-dimensional router utilizing two layers is presented. The routing technique can be described as follows: After partitioning of the nets into a set of subnets, the construction is carried out on a step-by-step basis, which allows the system to dynamically take into account new information. This part has been implemented with a blackboard architecture. The router can handle pins that are not on a grid on one set of parallel edges. To provide a solution to a given problem, the router expands the switch-box by adding rows dynamically where they are needed. Many test cases have been run successfully, and some results, including Burstein's difficult switch-box, are presented.>
Pierre-François Dubois, Alain Puissochet, Anne-Marie Tagant
 ICCAD3