We stand with Ukraine  

Maciej Bendkowski

According to our database1, Maciej Bendkowski authored at least 20 papers between 2015 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Olivier Bodini
,
Sergey Dovgal
Comb. Probab. Comput., 2022

Automatic compile-time synthesis of entropy-optimal Boltzmann samplers.
[BibTeX]
[DOI]
Maciej Bendkowski
CoRR, 2022

2021
A note on the asymptotic expressiveness of ZF and ZFC.
[BibTeX]
[DOI]
Maciej Bendkowski
J. Log. Comput., 2021

2020
How to generate random lambda terms?
[BibTeX]
[DOI]
Maciej Bendkowski
CoRR, 2020

2019
On the enumeration of closures and environments with an application to random generation.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Pierre Lescanne
Log. Methods Comput. Sci., 2019

Statistical Properties of Lambda Terms.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Olivier Bodini
,
Sergey Dovgal
Electron. J. Comb., 2019

Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus.
[BibTeX]
[DOI]
Maciej Bendkowski
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018
Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Paul Tarau
Theory Pract. Log. Program., 2018

Towards the average-case analysis of substitution resolution in λ-calculus.
[BibTeX]
[DOI]
Maciej Bendkowski
CoRR, 2018

Counting Environments and Closures.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Pierre Lescanne
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Combinatorics of Explicit Substitutions.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Pierre Lescanne
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

Polynomial tuning of multiparametric combinatorial samplers.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Olivier Bodini
,
Sergey Dovgal
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
On the likelihood of normalization in combinatory logic.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Marek Zaionc
J. Log. Comput., 2017

Combinatorics of $$\lambda$$-terms: a natural approach.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Pierre Lescanne
,
Marek Zaionc
J. Log. Comput., 2017

Normal-order reduction grammars.
[BibTeX]
[DOI]
Maciej Bendkowski
J. Funct. Program., 2017

Boltzmann Samplers for Closed Simply-Typed Lambda Terms.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Paul Tarau
Proceedings of the Practical Aspects of Declarative Languages, 2017

2016
On the likelihood of normalisation in combinatory logic.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Marek Zaionc
CoRR, 2016

Combinatorics of λ-terms: a natural approach.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Pierre Lescanne
,
Marek Zaionc
CoRR, 2016

A Natural Counting of Lambda Terms.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Pierre Lescanne
,
Marek Zaionc
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
Asymptotic Properties of Combinatory Logic.
[BibTeX]
[DOI]
Maciej Bendkowski
,
Katarzyna Grygiel
,
Marek Zaionc
Proceedings of the Theory and Applications of Models of Computation, 2015


  Loading...