ERD

Temporal Graph Realization from Fastest Paths

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

Lower Bounds for Regular Resolution over Parities

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

On the parameterized complexity of interval scheduling with eligible machine sets,Journal of Computer and System Science...

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

. On Finding Separators in Temporal Split and Permutation Graphs

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

Temporal reachability minimization: Delaying vs. deleting

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

Algorithmic aspects of temporal betweenness

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

How to Make Knockout Tournaments More Popular?

Project: Interactive

Updated at: 28-08-2024

Show more information

Project acronym Interactive

Tight Bounds for General Computation in Noisy Broadcast Networks.

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Protecting Single-Hop Radio Networks from Message Drops

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Periodic Reporting for period 2 - Interactive (Coding for Interactive Communication and the Power of Adaptivity)

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Realizing temporal graphs from fastest travel times

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly dist...

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

On the $$\alpha $$-lazy version of Markov chains in estimation and testing problems

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

{Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds}

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

On the coefficients of the distinct monomials in the expansion of $x_1(x_1+x_2)\cdots(x_1+x_2+\cdots+x_n)$

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Optimal Short-Circuit Resilient Formulas

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Counting Temporal Paths

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Computation over the Noisy Broadcast Channel with Malicious Parties.

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

The Rate of Interactive Codes Is Bounded Away from 1

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Binary Codes with Resilience Beyond 1/4 via Interaction

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Interactive Coding with Small Memory

Project: Interactive

Updated at: 27-04-2024

Show more information

Project acronym Interactive

Resources

Selected filters:

Temporal Graph Realization from Fastest Paths

Lower Bounds for Regular Resolution over Parities

On the parameterized complexity of interval scheduling with eligible machine sets,Journal of Computer and System Science...

. On Finding Separators in Temporal Split and Permutation Graphs

Temporal reachability minimization: Delaying vs. deleting

Algorithmic aspects of temporal betweenness

How to Make Knockout Tournaments More Popular?

Tight Bounds for General Computation in Noisy Broadcast Networks.

Protecting Single-Hop Radio Networks from Message Drops

Periodic Reporting for period 2 - Interactive (Coding for Interactive Communication and the Power of Adaptivity)

Realizing temporal graphs from fastest travel times

The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly dist...

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

On the $$\alpha $$-lazy version of Markov chains in estimation and testing problems

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

{Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds}

On the coefficients of the distinct monomials in the expansion of $x_1(x_1+x_2)\cdots(x_1+x_2+\cdots+x_n)$

Optimal Short-Circuit Resilient Formulas

Counting Temporal Paths

Computation over the Noisy Broadcast Channel with Malicious Parties.

The Rate of Interactive Codes Is Bounded Away from 1

Binary Codes with Resilience Beyond 1/4 via Interaction

Interactive Coding with Small Memory