Jonathan Bloom

Publication Activity (10 Years)

Years Active: 2003-2021
Publications (10 Years): 8

Top Topics

Previously Unknown

Database Integration

Equivalence Relation

Top Venues

Electron. J. Comb.

Australas. J Comb.

J. Comb. Theory, Ser. A

Publications

Christopher Lance, Malte D. Lücken, Daniel B. Burkhardt, Robrecht Cannoodt, Pia Rautenstrauch, Anna Laddach, Aidyn Ubingazhibov, Zhi-Jie Cao, Kaiwen Deng, Sumeer Khan, Qiao Liu, Nikolay Russkikh, Gleb Ryazantsev, Uwe Ohler, Angela Oliveira Pisco, Jonathan Bloom, Smita Krishnaswamy, Fabian J. Theis
Multimodal single cell data integration challenge: Results and lessons learned. NeurIPS (Competition and Demos) (2021)
Jonathan Bloom, Sergi Elizalde, Yuval Roichman
On Cyclic Schur-Positive Sets of Permutations. Electron. J. Comb. 27 (2) (2020)
Jonathan Bloom, Dan Saracino
On criteria for rook equivalence of Ferrers boards. Eur. J. Comb. 76 (2019)
Jonathan Bloom, Dan Saracino
Rook and Wilf equivalence of integer partitions. Eur. J. Comb. 71 (2018)
Jonathan Bloom, Dan Saracino
Pattern avoidance for set partitions à la Klazar. Discret. Math. Theor. Comput. Sci. 18 (2) (2016)
Jonathan Bloom, Alexander Burstein
Egge triples and unbalanced Wilf equivalence. Australas. J Comb. 64 (2016)
Jonathan Bloom, Vincent Vatter
Two vignettes on full rook placements. Australas. J Comb. 64 (2016)
Jonathan Bloom, Oliver Pechenik, Dan Saracino
Proofs and generalizations of a homomesy conjecture of Propp and Roby. Discret. Math. 339 (1) (2016)
Jonathan Bloom
A refinement of Wilf-equivalence for patterns of length 4. J. Comb. Theory, Ser. A 124 (2014)
Jonathan Bloom, Sergi Elizalde
Pattern Avoidance in Matchings and Partitions. Electron. J. Comb. 20 (2) (2013)
Jonathan Bloom, Dan Saracino
. J. Comb. Theory, Ser. A 119 (6) (2012)
David Suendermann, Jackson Liscombe, Jonathan Bloom, Grace Li, Roberto Pieraccini
Large-Scale Experiments on Data-Driven Design of Commercial Spoken Dialog Systems. INTERSPEECH (2011)
Jonathan Bloom, Dan Saracino
Another look at bijections for pattern-avoiding permutations. Adv. Appl. Math. 45 (3) (2010)
Jonathan Bloom, Dan Saracino
On bijections for pattern-avoiding permutations. J. Comb. Theory, Ser. A 116 (8) (2009)
Roberto Pieraccini, Krishna Dayanidhi, Jonathan Bloom, Jean-Gui Dahan, Michael Phillips, Bryan R. Goodman, K. Venkatesh Prasad
Multimodal conversational systems for automobiles. Commun. ACM 47 (1) (2004)
Roberto Pieraccini, Krishna Dayanidhi, Jonathan Bloom, Jean-Gui Dahan, Michael Phillips, Bryan R. Goodman, K. Venkatesh Prasad
A multimodal conversational interface for a concept vehicle. INTERSPEECH (2003)
Greg Martin, Jonathan Bloom, Dan Saracino
Three Proper Subgroups Covering a Group: 10911. Am. Math. Mon. 110 (8) (2003)