Expertini Research Research

Browse Research Papers

155+ open-access research outputs.

✕ Clear
🔍 frederic berdoz 📂 Computer Science
Showing 155 results for "frederic berdoz" in Computer Science
Computer Science Preprint PDF DOI

Local Node Differential Privacy

Sofya Raskhodnikova, Adam Smith, Connor Wagaman, Anatoly Zavyalov · 2026

We initiate an investigation of node differential privacy for graphs in the local model of private data analysis. In our model, dubbed LNDP*, each node sees its own edge list and releases the output o…

Read Paper →
Computer Science Preprint PDF DOI

Self-referential instances of the dominating set problem are irreducible

Guangyan Zhou · 2026

We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exh…

Read Paper →
Computer Science Preprint PDF DOI

Information-Theoretic Limits on Exact Subgraph Alignment Problem

Chun Hei Michael Shiu, Hei Victor Cheng, Lele Wang · 2026

The graph alignment problem aims to identify the vertex correspondence between two correlated graphs. Most existing studies focus on the scenario in which the two graphs share the same vertex set. How…

Read Paper →
Computer Science Preprint PDF DOI

Discrimination, intelligence artificielle et decisions algorithmiques

Frederik Zuiderveen Borgesius · 2025

Artificial intelligence (AI) has a huge impact on our personal lives and also on our democratic society as a whole. While AI offers vast opportunities for the benefit of people, its potential to embed…

Read Paper →
Computer Science Preprint PDF DOI

Discrimination, artificial intelligence, and algorithmic decision-making

Frederik Zuiderveen Borgesius · 2025

Artificial intelligence (AI) has a huge impact on our personal lives and also on our democratic society as a whole. While AI offers vast opportunities for the benefit of people, its potential to embed…

Read Paper →
Computer Science Preprint PDF DOI

Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests

Abdulkader Hajjouz, Elena Avksentieva · 2025

We develop a consolidated theory for the detectability of network-borne attacks under two canonical observation models: (i) a static graph drawn from an Erdos-Renyi background with a planted anomalous…

Read Paper →
Computer Science Preprint PDF DOI

Ordered Consensus with Equal Opportunity

Yunhao Zhang, Haobin Ni, Soumya Basu, Shir Cohen, Maofan Yin, Lorenzo Alvisi, Robbert van Renesse, Qi Chen, Lidong Zhou · 2025

The specification of state machine replication (SMR) has no requirement on the final total order of commands. In blockchains based on SMR, however, order matters, since different orders could provide …

Read Paper →
Computer Science Preprint PDF DOI

A Compute-Matched Re-Evaluation of TroVE on MATH

Tobias Sesterhenn, Ian Berlot-Attwell, Janis Zenkner, Christian Bartelt · 2025

Reusing established theorems and formulas is central to mathematical problem solving, serving as essential building blocks for tackling increasingly complex challenges. Recent work, TroVE, argues that…

Read Paper →
Computer Science Preprint PDF DOI

Leveraging Network Methods for Hub-like Microservice Detection

Alexander Bakhtin, Matteo Esposito, Valentina Lenarduzzi, Davide Taibi · 2025

Context: Microservice Architecture is a popular architectural paradigm that facilitates flexibility by decomposing applications into small, independently deployable services. Catalogs of architectural…

Read Paper →
Computer Science Preprint PDF DOI

Upper bounds on the theta function of random graphs

Uriel Feige, Vadim Grinberg · 2025

The theta function of Lovasz is a graph parameter that can be computed up to arbitrary precision in polynomial time. It plays a key role in algorithms that approximate graph parameters such as maximum…

Read Paper →
Computer Science Preprint PDF DOI

A Method for Generating Connected Erdos-Renyi Random Graphs

Boris Chinyaev · 2025

We propose a novel exact algorithm for generating connected Erdos-Renyi random graphs $G(n,p)$. The method couples the graph exploration process to an inhomogeneous Poisson random walk, which yields a…

Read Paper →
Computer Science Preprint PDF DOI

Limiting Disease Spreading in Human Networks

Gargi Bakshi, Sujoy Bhore, Suraj Shetiya · 2025

The outbreak of a pandemic, such as COVID-19, causes major health crises worldwide. Typical measures to contain the rapid spread usually include effective vaccination and strict interventions (Nature …

Read Paper →
Computer Science Preprint PDF DOI

New centrality measure: ksi-centrality

Mikhail Tuzhilin · 2025

We introduce new centrality measures, called ksi-centrality and normalized ksi-centrality measure the importance of a node up to the importance of its neighbors. First, we show that normalized ksi-cen…

Read Paper →
Computer Science Preprint PDF DOI

Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs

Jeff Xu · 2024

In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the u…

Read Paper →
Computer Science Preprint PDF DOI

Neural Corrective Machine Unranking

Jingrui Hou, Axel Finke, Georgina Cosma · 2024

Machine unlearning in neural information retrieval (IR) systems requires removing specific data whilst maintaining model performance. Applying existing machine unlearning methods to IR may compromise …

Read Paper →
Computer Science Preprint PDF DOI

Long-Form Text-to-Music Generation with Adaptive Prompts: A Case Study in Tabletop Role-Playing Games Soundtracks

Felipe Marra, Lucas N. Ferreira · 2024

This paper investigates the capabilities of text-to-audio music generation models in producing long-form music with prompts that change over time, focusing on soundtrack generation for Tabletop Role-P…

Read Paper →
Computer Science Preprint PDF DOI

Fast Reroute with Highly Connected Routes Based on Maximum Flow Evaluation

Leon Okida, Maverson E. Schuze-Rosa, Elias P. Duarte Jr · 2024

Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configu…

Read Paper →
Computer Science Preprint PDF DOI

Low-degree Security of the Planted Random Subgraph Problem

Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik · 2024

The planted random subgraph detection conjecture of Abram et al. (TCC 2023) asserts the pseudorandomness of a pair of graphs $(H, G)$, where $G$ is an Erdos-Renyi random graph on $n$ vertices, and $H$…

Read Paper →
Computer Science Preprint PDF DOI

Generating Temporal Contact Graphs Using Random Walkers

Anton-David Almasan, Sergey Shvydun, Ingo Scholtes, Piet Van Mieghem · 2024

We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequences based on indepen…

Read Paper →
Computer Science Preprint PDF DOI

Evaluating the Accuracy of the Labeling System in Web of Science for the Sustainable Development Goals

Yu Zhao, Li Li, Zhesi Shen · 2024

Monitoring and fostering research aligned with the Sustainable Development Goals (SDGs) is crucial for formulating evidence-based policies, identifying best practices, and promoting global collaborati…

Read Paper →
Page 1 of 8 Next →