Publication

Infinite labeled trees: From rational to Sturmian trees

Related publications (33)

From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem

Kathryn Hess Bellwald, Lida Kanari, Adélie Eliane Garin

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general position, based ...

2024

A general framework to evaluate different rebalancing operations strategies in one-way car sharing systems

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Car sharing systems (CSSs) are one of the environmentally beneficial solutions in urban transportation. However, the operators still struggle to make these systems profitable. One of the main contributors in operational cost is rebalancing operations. Ther ...

Springer2023

The splay-list: a distribution-adaptive concurrent skip-list

Amirkeivan Mohtashami, Dan Alistarh

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

From Trees to Barcodes and Back Again:A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...

EPFL2022

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Vehicle sharing systems: Does demand forecasting yield a better service?

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Although the idea of vehicle sharing systems (VSSs) emerges back in 1940s, sustaining such a system became simpler with the improvements in technology in the past decade. In addition to that, people have become more concerned about environmental effects an ...

2020

Bike Sharing Systems: Does demand forecasting yield a better service?

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Although the idea of vehicle sharing systems (VSSs) emerged back in 1940s, sustaining such a system became simpler with the improvements in technology in the past decade. In addition to that, people have become more concerned about environmental effects an ...

2020

Analysis of the value of demand forecasting within vehicle sharing systems

Jasso Espadaler Clapés

Vehicle sharing systems (VSSs) are becoming increasingly popular, primarily due to their financial and environmental advantages. However, VSSs face many operational challenges, including inventory management of vehicles and parking spots, vehicle load bala ...

2019

Algorithmic Resource Verification

Ravichandhran Kandhadai Madhavan

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

EPFL2017

Symbolic Resource Bound Inference

Viktor Kuncak, Ravichandhran Kandhadai Madhavan

We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the boun ...

2014

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.