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

Tatjana Petrovic

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

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

Artificial intelligence and machine learning · 1Systems, 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 · 33% High-performance computing · 33% Processor architecture and microarchitecture · 33%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms
parallel algorithm design		 0.011992
Parallel computation of symbolic robot models and control laws: theory and application on transputer networks · ICRA 1992
High-performance computing › parallel numerical algorithms
parallel robot dynamics computation		 0.011992
Parallel computation of symbolic robot models and control laws: theory and application on transputer networks · ICRA 1992
Processor architecture and microarchitecture › instruction scheduling
pipelined processor scheduling		 0.011992
Parallel computation of symbolic robot models and control laws: theory and application on transputer networks · ICRA 1992
Robotics › Motion planning and robot control › robot dynamics
inverse dynamics		 0.011992
Parallel computation of symbolic robot models and control laws: theory and application on transputer networks · ICRA 1992
Robotics › Motion planning and robot control
robot dynamics		 0.011992
Parallel computation of symbolic robot models and control laws: theory and application on transputer networks · ICRA 1992

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

symbolic robot models · 0.0scheduling algorithm · 0.0
YearPublicationVenuePosition
1992 Parallel computation of symbolic robot models and control laws: theory and application on transputer networks
abstract
The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors connected by a complete crossbar interconnection network. The main feature of the algorithms is that they take into account the communication delays between processors and minimize both the execution time and the communication cost. The algorithms were verified by experiments on an INMOS T800 transputer-based system. The experimental results showed that the most complicated dynamic control laws could be executed in a submillisecond range.>
Nenad Kircanski, Tatjana Petrovic, Miomir Vukobratovic
 ICRA2