Boban Velickovic

Orcid: 0000-0002-0563-4024

According to our database1, Boban Velickovic authored at least 17 papers between 1986 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Guessing models and the approachability ideal.
J. Math. Log., 2021

2017
A direct proof of the five element basis theorem.
Math. Log. Q., 2017

2015
Positional Strategies in Long Ehrenfeucht-FraïSSé Games.
J. Symb. Log., 2015

2010
PCF structures of height less than omega<sub>3</sub>.
J. Symb. Log., 2010

2009
Maharam algebras.
Ann. Pure Appl. Log., 2009

2004
Collapsing functions.
Math. Log. Q., 2004

Games played on partial isomorphisms.
Arch. Math. Log., 2004

1999
Analytic Ideals and Cofinal Types.
Ann. Pure Appl. Log., 1999

The basis problem for CCC posets.
Proceedings of the Set Theory: The Hajnal Conference, 1999

1998
Efficient approximation of product distributions.
Random Struct. Algorithms, 1998

Complexity of Reals in Inner Models of Set Theory.
Ann. Pure Appl. Log., 1998

1997
Delta<sub>1</sub>-Definability.
Ann. Pure Appl. Log., 1997

1996
On Deterministic Approximation of DNF.
Algorithmica, 1996

1993
Borel Partitions of Infinite Subtrees of a Perfect Tree.
Ann. Pure Appl. Log., 1993

Deterministic Approximate Counting of Depth-2 Circuits.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992
Approximations of General Independent Distributions
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1986
Jensen's Principles and the Novak Number of Partially Ordered Sets.
J. Symb. Log., 1986


  Loading...