default search action
Mikael Vejdemo-Johansson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i22]Hengrui Luo, Jisu Kim, Alice Patania
, Mikael Vejdemo-Johansson:
Topological Learning for Motion Data via Mixed Coordinates. CoRR abs/2310.19960 (2023) - 2022
- [i21]Jie Chu, Mikael Vejdemo-Johansson, Ping Ji:
An improved algorithm for Generalized Čech complex construction. CoRR abs/2209.15574 (2022) - 2021
- [c7]Hengrui Luo, Jisu Kim, Alice Patania
Topological Learning for Motion Data via Mixed Coordinates. IEEE BigData 2021: 3853-3859 - 2020
- [j9]Denis Khryashchev
A Distributed Approach to the Evasion Problem. Algorithms 13(6): 149 (2020) - [j8]Leo Carlsson, Mikael Vejdemo-Johansson
Fibers of Failure: Classifying Errors in Predictive Processes. Algorithms 13(6): 150 (2020) - [i20]Hengrui Luo, Alice Patania, Jisu Kim, Mikael Vejdemo-Johansson:
Generalized Penalty for Circular Coordinate Representation. CoRR abs/2006.02554 (2020)
2010 – 2019
- 2019
- [c6]J. Frederico Carvalho, Mikael Vejdemo-Johansson, Florian T. Pokorny, Danica Kragic:
Long-term Prediction of Motion Trajectories Using Path Homology Clusters. IROS 2019: 765-772 - 2018
- [j7]J. Frederico Carvalho
An algorithm for calculating top-dimensional bounding chains. PeerJ Comput. Sci. 4: e153 (2018) - [c5]J. Frederico Carvalho
Path Clustering with Homology Area. ICRA 2018: 7346-7353 - [i19]Leo Carlsson, Gunnar E. Carlsson, Mikael Vejdemo-Johansson:
Fibres of Failure: Classifying errors in predictive processes. CoRR abs/1803.00384 (2018) - [i18]Mikael Vejdemo-Johansson, Alisa Leshchenko:
Certified Mapper: Repeated testing for acyclicity and obstructions to the nerve lemma. CoRR abs/1808.09933 (2018) - [i17]Mikael Vejdemo-Johansson, Sayan Mukherjee:
Multiple testing with persistent homology. CoRR abs/1812.06491 (2018) - 2017
- [i16]J. Frederico Carvalho
An algorithm for calculating top-dimensional bounding chains. PeerJ Prepr. 5: e3151 (2017) - [i15]Mikael Vejdemo-Johansson
Weighted growth functions of automatic groups. PeerJ Prepr. 5: e3256 (2017) - 2015
- [j6]Mikael Vejdemo-Johansson
Cohomological learning of periodic motion. Appl. Algebra Eng. Commun. Comput. 26(1-2): 5-26 (2015) - [j5]Erin Wolf Chambers
Computing Minimum Area Homologies. Comput. Graph. Forum 34(6): 13-21 (2015) - [j4]Daniel P. Hirsch, Ingemar Markström, Meredith L. Patterson, Anders Sandberg
More ties than we thought. PeerJ Comput. Sci. 1: e2 (2015) - 2014
- [c4]Mikael Vejdemo-Johansson
[Demo abstract] using Haskell as DSL for controlling immersive media experiences: Ludic support and deep immersion in nordic technology-supported LARP. FARM@ICFP 2014: 23 - [c3]Henry Adams, Andrew Tausz, Mikael Vejdemo-Johansson
javaPlex: A Research Software Package for Persistent (Co)Homology. ICMS 2014: 129-136 - [i14]Daniel P. Hirsch, Meredith L. Patterson, Anders Sandberg, Mikael Vejdemo-Johansson:
More ties than we thought. CoRR abs/1401.8242 (2014) - [i13]João Pita Costa, Primoz Skraba, Mikael Vejdemo-Johansson:
Aspects of an internal logic for persistence. CoRR abs/1409.3762 (2014) - [i12]João Pita Costa, Mikael Vejdemo-Johansson, Primoz Skraba:
Variable sets over an algebra of lifetimes: a contribution of lattice theory to the study of computational topology. CoRR abs/1409.8613 (2014) - [i11]Erin Wolf Chambers, Mikael Vejdemo-Johansson:
Computing minimum area homologies. CoRR abs/1410.2320 (2014) - 2013
- [i10]Primoz Skraba, Mikael Vejdemo-Johansson:
Persistence modules: Algebra and algorithms. CoRR abs/1302.2015 (2013) - [i9]Jesse Berwald, Marian Gidea, Mikael Vejdemo-Johansson:
Automatic recognition and tagging of topologically different regimes in dynamical systems. CoRR abs/1312.2482 (2013) - 2012
- [i8]Mikael Vejdemo-Johansson:
Interleaved equivalence of categories of persistence modules. CoRR abs/1210.7913 (2012) - [i7]Mikael Vejdemo-Johansson:
Sketches of a platypus: persistent homology and its algebraic foundations. CoRR abs/1212.5398 (2012) - 2011
- [j3]Vin de Silva, Dmitriy Morozov, Mikael Vejdemo-Johansson
Persistent Cohomology and Circular Coordinates. Discret. Comput. Geom. 45(4): 737-759 (2011) - [j2]Bei Wang, Brian Summa
Branching and Circular Features in High Dimensional Data. IEEE Trans. Vis. Comput. Graph. 17(12): 1902-1911 (2011) - [i6]Mikael Vejdemo-Johansson, Emil Sköldberg, Jason Dusek:
A parallel Buchberger algorithm for multigraded ideals. CoRR abs/1105.5509 (2011) - [i5]Mikael Vejdemo-Johansson:
Interleaved computation for persistent homology. CoRR abs/1105.6305 (2011) - [i4]Vin de Silva, Dmitriy Morozov, Mikael Vejdemo-Johansson:
Dualities in persistent (co)homology. CoRR abs/1107.5665 (2011) - [i3]David Lipsky, Primoz Skraba, Mikael Vejdemo-Johansson:
A spectral sequence for parallelized persistence. CoRR abs/1112.1245 (2011) - 2010
- [c2]Vladimir Dotsenko
Operadic Gröbner Bases: An Implementation. ICMS 2010: 249-252
2000 – 2009
- 2009
- [c1]Vin de Silva, Mikael Vejdemo-Johansson
Persistent cohomology and circular coordinates. SCG 2009: 227-236 - [i2]Vin de Silva, Mikael Vejdemo-Johansson:
Persistent Cohomology and Circular Coordinates. CoRR abs/0905.4887 (2009) - [i1]Vladimir Dotsenko
Implementing Gröbner bases for operads. CoRR abs/0909.4950 (2009) - 2008
- [j1]Mikael Vejdemo-Johansson
Enumerating the Saneblidze-Umble diagonal in Haskell (abstract only). ACM Commun. Comput. Algebra 42(1-2): 20 (2008)
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-08-05 20:23 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: