![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Koenraad Audenaert
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [i1]Koenraad Audenaert, Nilanjana Datta, Maris Ozols
:
Entropy power inequalities for qudits. CoRR abs/1503.04213 (2015) - 2014
- [j7]Koenraad M. R. Audenaert:
Comparisons between quantum state distinguishability measures. Quantum Inf. Comput. 14(1-2): 31-38 (2014) - 2011
- [c8]Koenraad Audenaert:
Telescopic Relative Entropy. TQC 2011: 39-52
2000 – 2009
- 2007
- [j6]Koenraad Audenaert, Chris D. Godsil
, Gordon F. Royle
, Terry Rudolph:
Symmetric squares of graphs. J. Comb. Theory B 97(1): 74-90 (2007) - 2004
- [j5]Koenraad M. R. Audenaert, Christopher A. Fuchs, C. King, A. Winter:
Multiplicativity of accessible fidelity and quantumness for sets of quantum states. Quantum Inf. Comput. 4(1): 1-11 (2004)
1990 – 1999
- 1997
- [j4]Koenraad Audenaert:
Clock Trees: Logical Clocks for Programs with Nested Parallelism. IEEE Trans. Software Eng. 23(10): 646-658 (1997) - [c7]Koenraad Audenaert:
Maintaining Concurrency Information for On-the-fly Data Race Detection. PARCO 1997: 319-326 - 1995
- [c6]Koenraad Audenaert, Luk Levrouw:
Space efficient data race detection for parallel programs with series-parallel task graphs. PDP 1995: 508-515 - 1994
- [j3]Koenraad M. R. Audenaert, Luk Levrouw:
Interrupt replay: a debugging method for parallel programs with interrupts. Microprocess. Microsystems 18(10): 601-612 (1994) - [c5]Luk Levrouw, Koenraad Audenaert, Jan M. Van Campenhout:
Execution Replay with Compact Logs for Shared-Memory Programs. Applications in Parallel and Distributed Computing 1994: 125-134 - [c4]Luk Levrouw, Koenraad Audenaert:
Minimizing the Log Size for Execution Replay of Shared-Memory Programs. CONPAR 1994: 76-87 - [c3]Luk Levrouw, Koenraad M. R. Audenaert, Jan M. Van Campenhout
:
A New Trace And Replay System For Shared Memory Programs Based On Lamport Clocks. PDP 1994: 471-478 - 1993
- [j2]Marnik Brunfaut, Herbert Peremans
, Koenraad Audenaert, Ronny Blomme, Jan Van Campenhout
:
A correlation coprocessor for accurate real-time ultrasonic ranging of multiple objects using the transputer. Microprocess. Microsystems 17(10): 571-577 (1993) - [j1]Herbert Peremans
, Koenraad Audenaert, Jan M. Van Campenhout
:
A high-resolution sensor based on tri-aural perception. IEEE Trans. Robotics Autom. 9(1): 36-48 (1993) - [c2]Luk Levrouw, Koenraad Audenaert:
An efficient record-replay mechanism for shared memory programs. PDP 1993: 169-176 - 1992
- [c1]Koenraad Audenaert, Herbert Peremans, Y. Kawahara, Jan Van Campenhout
:
Accurate ranging of multiple objects using ultrasonic sensors. ICRA 1992: 1733-1738
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint