default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomaric Duvignau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Romaric Duvignau:
ChatGPT Has Eaten My Assignment: A Student-Centric Experiment on Supervising Writing Processes in the AI Era. EDUCON 2024: 1-3- [c14]Romaric Duvignau:
How to Better Teach Computer Networks to Freshman Engineers Post-Pandemic, A Case Study. EDUCON 2024: 1-10 - [c13]Romaric Duvignau
, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine Multivalued Consensus: (extended abstract). ICDCN 2024: 12-21 - [c12]Jan Körner, Samuel Bach, Albin Karlsson, Linus Sundkvist, Romaric Duvignau:
Efficient Monitoring of CPS and IoT Systems: A Deployment Guide for Empirical Evaluations. MECO 2024: 1-6 - [i6]Romaric Duvignau, Noël Gillet, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. CoRR abs/2410.09434 (2024) - 2023
- [j6]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast. Theor. Comput. Sci. 972: 114070 (2023) - [c11]Martin Björklund, Marcus Julin, Philip Antonsson, Andreas Stenwreth, Malte Åkvist, Tobias Hjalmarsson, Romaric Duvignau:
I See What You're Watching on Your Streaming Service: Fast Identification of DASH Encrypted Network Traces. CCNC 2023: 1116-1122 - [c10]Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou:
Cost-Optimization for Win-Win P2P Energy Systems. ISGT 2023: 1-5 - [c9]Romaric Duvignau, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. LAGOS 2023: 43-52 - [i5]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine Multivalued Consensus. CoRR abs/2311.09075 (2023) - 2022
- [j5]Daniel Brahneborg, Romaric Duvignau, Wasif Afzal, Saad Mubeen:
GeoRep - Resilient Storage for Wide Area Networks. IEEE Access 10: 75772-75788 (2022) - [c8]Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou:
Efficient and scalable geographical peer matching for P2P energy sharing communities. SAC 2022: 187-190 - [c7]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast. SSS 2022: 206-221 - [i4]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine-tolerant Broadcast. CoRR abs/2201.12880 (2022) - 2021
- [j4]Romaric Duvignau, Bastian Havers, Vincenzo Gulisano, Marina Papatriantafilou:
Time- and Computation-Efficient Data Localization at Vehicular Networks' Edge. IEEE Access 9: 137714-137732 (2021) - [i3]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus. CoRR abs/2110.08592 (2021) - [i2]Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou:
Geographical Peer Matching for P2P Energy Sharing. CoRR abs/2112.11286 (2021) - 2020
- [j3]Bastian Havers, Romaric Duvignau, Hannaneh Najdataei, Vincenzo Gulisano, Marina Papatriantafilou, Ashok Chaitanya Koppisetty:
DRIVEN: A framework for efficient Data Retrieval and clustering in Vehicular Networks. Future Gener. Comput. Syst. 107: 1-17 (2020) - [c6]Romaric Duvignau, Verena Heinisch, Lisa Göransson, Vincenzo Gulisano, Marina Papatriantafilou:
Small-Scale Communities Are Sufficient for Cost- and Data-Efficient Peer-to-Peer Energy Sharing. e-Energy 2020: 35-46
2010 – 2019
- 2019
- [c5]Romaric Duvignau, Marina Papatriantafilou, Konstantinos Peratinos, Eric Nordström, Patrik Nyman:
Continuous Distributed Monitoring in the Evolved Packet Core. DEBS 2019: 187-192 - [c4]Bastian Havers, Romaric Duvignau, Hannaneh Najdataei, Vincenzo Gulisano, Ashok Chaitanya Koppisetty, Marina Papatriantafilou:
DRIVEN: a Framework for Efficient Data Retrieval and Clustering in Vehicular Networks. ICDE 2019: 1850-1861 - [c3]Romaric Duvignau, Bastian Havers, Vincenzo Gulisano, Marina Papatriantafilou:
Querying Large Vehicular Networks: How to Balance On-Board Workload and Queries Response Timeƒ. ITSC 2019: 2604-2611 - [c2]Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Vladimir Savic:
Streaming piecewise linear approximation for efficient data management in edge computing. SAC 2019: 593-596 - 2018
- [i1]Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Vladimir Savic:
Piecewise Linear Approximation in Data Streaming: Algorithmic Implementations and Experimental Analysis. CoRR abs/1808.08877 (2018) - 2016
- [j2]Philippe Duchon, Romaric Duvignau:
Preserving the Number of Cycles of Length k in a Growing Uniform Permutation. Electron. J. Comb. 23(4): 4 (2016) - [j1]Julien Bensmail, Romaric Duvignau, Sergey Kirgizov:
The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17(3): 31-42 (2016) - 2015
- [b1]Romaric Duvignau:
Maintenance et simulation de graphes aléatoires dynamiques. (Maintenance and simulation of dynamic random graphs). University of Bordeaux, France, 2015 - 2014
- [c1]Philippe Duchon, Romaric Duvignau:
Local Update Algorithms for Random Graphs. LATIN 2014: 367-378
Coauthor Index
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-11-25 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
