Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino. STACS, volume 2285 of Lecture Notes in Computer Science, page 133-141. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vladimir Dyakonov

Vladimir Spokoiny

Vladimir Milutinovi

Vladimir Borisov

Vladimir Bondarev

Other publications of authors with the same name

Avoidability beyond paths.V. Gurvich, M. Krnc, M. Milanic, and M. Vyalyi. CoRR, (2022)Perfect graphs, kernels, and cores of cooperative games.E. Boros, and V. Gurvich. Discret. Math., 306 (19-20): 2336-2354 (2006)A corrected version of the Duchet kernel conjecture.E. Boros, and V. Gurvich. Discret. Math., 179 (1-3): 231-233 (1998)Stable effectivity functions and perfect graphs.E. Boros, and V. Gurvich. Math. Soc. Sci., 39 (2): 175-194 (2000)A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions.E. Boros, K. Elbassioni, V. Gurvich, and K. Makino. ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 220-231. Springer, (2013)Screw discrete dynamical systems and their applications to exact slow NIM.V. Gurvich, and M. Naumova. Discret. Appl. Math., (2024)Computer-assisted verification of confining two-rooted graphs with certain cages.V. Gurvich, M. Krnc, M. Milanic, and M. Vyalyi. (August 2022)On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.E. Boros, and V. Gurvich. Math. Soc. Sci., 46 (2): 207-241 (2003)Neighborhood hypergraphs of bipartite graphs.E. Boros, V. Gurvich, and I. Zverovich. J. Graph Theory, 58 (1): 69-95 (2008)On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.E. Boros, K. Elbassioni, V. Gurvich, and K. Makino. Oper. Res. Lett., 41 (4): 357-362 (2013)

BibSonomy

Disambiguation of "Gurvich, Vladimir"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.

Please choose a person to relate this publication to

Vladimir Dyakonov

Vladimir Spokoiny

Vladimir Milutinovi

Vladimir Borisov

Vladimir Bondarev

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Gurvich, Vladimir"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.

Please choose a person to relate this publication to

Vladimir Dyakonov

Vladimir Spokoiny

Vladimir Milutinovi

Vladimir Borisov

Vladimir Bondarev

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.