default search action
Jonathan Bloom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c3]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: 162-176 - 2020
- [j14]Jonathan Bloom, Sergi Elizalde
On Cyclic Schur-Positive Sets of Permutations. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [j13]Jonathan Bloom
On criteria for rook equivalence of Ferrers boards. Eur. J. Comb. 76: 199-207 (2019) - 2018
- [j12]Jonathan Bloom
Rook and Wilf equivalence of integer partitions. Eur. J. Comb. 71: 246-267 (2018) - 2016
- [j11]Jonathan Bloom, Vincent Vatter:
Two vignettes on full rook placements. Australas. J Comb. 64: 77-87 (2016) - [j10]Jonathan Bloom, Alexander Burstein:
Egge triples and unbalanced Wilf equivalence. Australas. J Comb. 64: 232-251 (2016) - [j9]Jonathan Bloom, Oliver Pechenik
Proofs and generalizations of a homomesy conjecture of Propp and Roby. Discret. Math. 339(1): 194-206 (2016) - [j8]Jonathan Bloom, Dan Saracino:
Pattern avoidance for set partitions à la Klazar. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - 2014
- [j7]Jonathan Bloom:
A refinement of Wilf-equivalence for patterns of length 4. J. Comb. Theory A 124: 166-177 (2014) - 2013
- [j6]Jonathan Bloom, Sergi Elizalde:
Pattern Avoidance in Matchings and Partitions. Electron. J. Comb. 20(2): 5 (2013) - 2012
- [j5]Jonathan Bloom, Dan Saracino:
Modified growth diagrams, permutation pivots, and the BWX map φ*. J. Comb. Theory A 119(6): 1280-1298 (2012) - 2011
- [c2]David Suendermann, Jackson Liscombe, Jonathan Bloom, Grace Li, Roberto Pieraccini:
Large-Scale Experiments on Data-Driven Design of Commercial Spoken Dialog Systems. INTERSPEECH 2011: 813-816 - 2010
- [j4]Jonathan Bloom, Dan Saracino:
Another look at bijections for pattern-avoiding permutations. Adv. Appl. Math. 45(3): 395-409 (2010)
2000 – 2009
- 2009
- [j3]Jonathan Bloom, Dan Saracino:
On bijections for pattern-avoiding permutations. J. Comb. Theory A 116(8): 1271-1284 (2009) - 2004
- [j2]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): 47-49 (2004) - 2003
- [j1]Greg Martin, Jonathan Bloom, Dan Saracino:
Three Proper Subgroups Covering a Group: 10911. Am. Math. Mon. 110(8): 743-744 (2003) - [c1]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: 2233-2236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: