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

Koenraad Audenaert

dblp:77/6367 · also Koenraad M. R. Audenaert · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2025
0009-0009-2270-3413ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
2 papers
Quantum computing and quantum information · 75% Information theory · 25% Distributed computing theory · 0%
Computer networks
2 papers
Wireless sensing and localization · 71% Physical-layer communications · 29%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum information theory
continuity bound
0.912025
Continuity Bounds for Quantum Entropies Arising From a Fundamental Entropic Inequality · IEEE Trans. Inf. Theory 2025
Information theory › information measures › information inequalities
entropic inequalities
0.912025
Continuity Bounds for Quantum Entropies Arising From a Fundamental Entropic Inequality · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum information theory
quantum entropy
0.912025
Continuity Bounds for Quantum Entropies Arising From a Fundamental Entropic Inequality · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum information theory
0.912025
Continuity Bounds for Quantum Entropies Arising From a Fundamental Entropic Inequality · IEEE Trans. Inf. Theory 2025
Distributed computing theory
logical clocks
0.011997
Clock Trees: Logical Clocks for Programs with Nested Parallelism · IEEE Trans. Software Eng. 1997
Wireless sensing and localization › acoustic sensing
ultrasonic sensing
0.011993
A high-resolution sensor based on tri-aural perception · IEEE Trans. Robotics Autom. 1993
Wireless sensing and localization › ranging
acoustic ranging
0.011992
Accurate ranging of multiple objects using ultrasonic sensors · ICRA 1992
Physical-layer communications
signal processing for communications
0.011992
Accurate ranging of multiple objects using ultrasonic sensors · ICRA 1992

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

jordan-hahn decomposition · 0.9audenaert-fannes inequality · 0.9vector clocks · 0.0triangulation · 0.0transputer parallelism · 0.0signal processing · 0.0noise modeling · 0.0arrival time estimation · 0.0
YearPublicationVenuePosition
2025 Continuity Bounds for Quantum Entropies Arising From a Fundamental Entropic Inequality
abstract
We establish a tight upper bound for the difference in von Neumann entropies between two quantum states,$\rho _{1}$and$\rho _{2}$. This bound is expressed in terms of the von Neumann entropies of the mutually orthogonal states derived from the Jordan-Hahn decomposition of the difference operator$(\rho _{1} - \rho _{2})$. This yields a novel entropic inequality that implies the well-known Audenaert-Fannes (AF) inequality. In fact, it also leads to a refinement of the AF inequality. We employ this inequality to obtain a uniform continuity bound for the quantum conditional entropy of two states whose marginals on the conditioning system coincide. We additionally use it to derive a continuity bound for the quantum relative entropy in both variables. Interestingly, the fundamental entropic inequality is also valid in infinite dimensions.
Koenraad Audenaert, Bjarne Berg, Nilanjana Datta, Michael G. Jabbour, Angela Capel, Paul Gondolf
IEEE Trans. Inf. Theory1
1997 Clock Trees: Logical Clocks for Programs with Nested Parallelism
abstract
A vector clock is a valuable tool for maintaining run time concurrency information in parallel programs. A novel method is presented for modifying vector clocks to make them suitable for programs with nested fork join parallelism (having a variable number of tasks). The resulting kind of clock is called a clock tree, due to its tree structure. The clock tree method compares favorably with other timestamping methods for variable parallelism: task identifier reuse and task recycling. The worst case space requirements of clock trees equals the best case for the latter two methods, and the average size of a clock tree is much smaller than the size of a vector with task recycling. Furthermore, the algorithm for maintaining clock trees does not require a shared data structure and thus avoids the serialization bottleneck that task recycling suffers from.
Koenraad Audenaert
IEEE Trans. Software Eng.1
1993 A high-resolution sensor based on tri-aural perception
abstract
The authors present a high-resolution sensor composed of three ultrasonic sensors, one transmitter/receiver and two extra receivers, which allows a significant improvement in the information-extraction process. With this sensor the position (distance and bearing) of all isolated objects in an approximately 25 degrees field of view can be determined using information contained in one single snapshot of a moderately complex scene. Within limits, the sensor system can also discriminate between different types of reflectors, in particular, walls and edges, based on their radius of curvature. These results are all based on the determination of the arrival times of the echoes present at the three receivers. A noise model that accounts for the measured variations of the arrival times is used to derive limits on the resolution of the results provided by the sensor. Based on this model it is shown that, to a large extent, the sensor results are impervious to measurement variations common to all three receivers. Results obtained in a realistic environment are compared with those obtained from a conventional time-of-flight sensor.>
Herbert Peremans, Koenraad Audenaert, Jan M. Van Campenhout
IEEE Trans. Robotics Autom.2
1992 Accurate ranging of multiple objects using ultrasonic sensors
abstract
The authors propose a measurement setup consisting of a number of ultrasonic sensors used in parallel to perform triangulation measurements. The sensor system is based on two ideas. The first idea was to use signal processing techniques borrowed from existing radar and sonar systems. This allows the accurate determination of the position of multiple objects. Processing data in real time demands a fairly powerful processing system. The second idea was to assign a microprocessor to each transducer. To support the use of multiple sensors in the final measurement setup, transputers were used as processing elements as they offer easy scalability because of their serial links. This sensor measured the distance to multiple objects very accurately and with a resolution of 2 cm. It is shown that these techniques could be implemented in a cost-effective manner.>
Koenraad Audenaert, Herbert Peremans, Y. Kawahara, Jan M. Van Campenhout
ICRA1