×
Compute Distance To:
Author ID: gelbukh.alexander Recent zbMATH articles by "Gelbukh, Alexander"
Published as: Gelbukh, Alexander; Gelbukh, A.

Publications by Year

Citations contained in zbMATH Open

5 Publications have been cited 8 times in 8 Documents Cited by Year
Zipf and heaps laws’ coefficients depend on language. Zbl 0977.68792
Gelbukh, Alexander; Sidorov, Grigori
3
2001
A fast scheduling algorithm in AND-OR graphs. Zbl 1036.90037
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
2
2001
Computational linguistics and intelligent text processing. 2nd international conference, CICLing 2001, Mexico City, Mexico, February 18–24, 2001. Proceedings. Zbl 0976.68583
1
2001
On fast path-finding algorithms in AND-OR graphs. Zbl 1069.90103
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
1
2002
Mathematical properties of soft cardinality: enhancing Jaccard, Dice and cosine similarity measures with element-wise distance. Zbl 1428.68300
Jimenez, Sergio; Gonzalez, Fabio A.; Gelbukh, Alexander
1
2016
Mathematical properties of soft cardinality: enhancing Jaccard, Dice and cosine similarity measures with element-wise distance. Zbl 1428.68300
Jimenez, Sergio; Gonzalez, Fabio A.; Gelbukh, Alexander
1
2016
On fast path-finding algorithms in AND-OR graphs. Zbl 1069.90103
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
1
2002
Zipf and heaps laws’ coefficients depend on language. Zbl 0977.68792
Gelbukh, Alexander; Sidorov, Grigori
3
2001
A fast scheduling algorithm in AND-OR graphs. Zbl 1036.90037
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
2
2001
Computational linguistics and intelligent text processing. 2nd international conference, CICLing 2001, Mexico City, Mexico, February 18–24, 2001. Proceedings. Zbl 0976.68583
1
2001

Citations by Year