activity
20082025
most citedHardness and Algorithms for Rainbow Connectivity

10 citations · 31 across the 16 of their papers we have counts for

collaborators

27 papers

math.CO2025

Effective MC-finiteness

Yuval Filmus, Eldar Fischer, Johann A. Makowsky

An integer sequence is \emph{MC-finite} if for all , the sequence is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \m…

math.LO2024

Pixelating Relations and Functions Without Adding Substructures

Eldar Fischer

We investigate models of relations over a bounded continuous segment of real numbers, along with the natural linear order over the reals being provided as a "hard-coded" relation.…

cs.DS2023

Support Testing in the Huge Object Model

Tomer Adar, Eldar Fischer, Amit Levi

The Huge Object model is a distribution testing model in which we are given access to independent samples from an unknown distribution over the set of strings , but are…

cs.DS2023

Refining the Adaptivity Notion in the Huge Object Model

Tomer Adar, Eldar Fischer

The Huge Object model for distribution testing, first defined by Goldreich and Ron in 2022, combines the features of classical string testing and distribution testing. In this mode…

math.CO2023

Counting Finite Topologies

Eldar Fischer, Johann A. Makowsky

In this paper we study the number of finite topologies on an -element set subject to various restrictions.

math.CO2023★ 1 cited

MC-finiteness of restricted set partition functions

Yuval Filmus, Eldar Fischer, Johann A. Makowsky +1

A sequence of integers is MC-finite if for every the sequence is ultimately periodic. We discuss various ways of proving and di…