Jonathan Bloom

According to our database, Jonathan Bloom authored at least 17 papers between 2003 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Multimodal single cell data integration challenge: Results and lessons learned.

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

Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

2020

On Cyclic Schur-Positive Sets of Permutations.

Jonathan Bloom, Sergi Elizalde, Yuval Roichman

Electron. J. Comb., 2020

2019

On criteria for rook equivalence of Ferrers boards.

Jonathan Bloom, Dan Saracino

Eur. J. Comb., 2019

2018

Rook and Wilf equivalence of integer partitions.

Jonathan Bloom, Dan Saracino

Eur. J. Comb., 2018

2016

Pattern avoidance for set partitions à la Klazar.

Jonathan Bloom, Dan Saracino

Discret. Math. Theor. Comput. Sci., 2016

Proofs and generalizations of a homomesy conjecture of Propp and Roby.

Jonathan Bloom, Oliver Pechenik, Dan Saracino

Discret. Math., 2016

Two vignettes on full rook placements.

Jonathan Bloom, Vincent Vatter

Australas. J Comb., 2016

Egge triples and unbalanced Wilf equivalence.

Jonathan Bloom, Alexander Burstein

Australas. J Comb., 2016

2014

A refinement of Wilf-equivalence for patterns of length 4.

Jonathan Bloom

J. Comb. Theory, Ser. A, 2014

2013

Pattern Avoidance in Matchings and Partitions.

Jonathan Bloom, Sergi Elizalde

Electron. J. Comb., 2013

2012

Modified growth diagrams, permutation pivots, and the BWX map <i>φ*</i>.

Jonathan Bloom, Dan Saracino

J. Comb. Theory, Ser. A, 2012

2011

Large-Scale Experiments on Data-Driven Design of Commercial Spoken Dialog Systems.

David Suendermann, Jackson Liscombe, Jonathan Bloom, Grace Li, Roberto Pieraccini

Proceedings of the INTERSPEECH 2011, 2011

2010

Another look at bijections for pattern-avoiding permutations.

Jonathan Bloom, Dan Saracino

Adv. Appl. Math., 2010

2009

On bijections for pattern-avoiding permutations.

Jonathan Bloom, Dan Saracino

J. Comb. Theory, Ser. A, 2009

2004

Multimodal conversational systems for automobiles.

Roberto Pieraccini, Krishna Dayanidhi, Jonathan Bloom, Jean-Gui Dahan, Michael Phillips, Bryan R. Goodman, K. Venkatesh Prasad

Commun. ACM, 2004

2003

Three Proper Subgroups Covering a Group: 10911.

Greg Martin, Jonathan Bloom, Dan Saracino

Am. Math. Mon., 2003

A multimodal conversational interface for a concept vehicle.

Roberto Pieraccini, Krishna Dayanidhi, Jonathan Bloom, Jean-Gui Dahan, Michael Phillips, Bryan R. Goodman, K. Venkatesh Prasad

Proceedings of the 8th European Conference on Speech Communication and Technology, EUROSPEECH 2003, 2003