default search action
Vera Koponen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Vera Koponen, Felix Weitkämper:
On the relative asymptotic expressivity of inference frameworks. Log. Methods Comput. Sci. 20(4) (2024) - [i4]Vera Koponen, Yasmin Tousinejad:
Random expansions of trees with bounded height. CoRR abs/2410.11775 (2024) - 2023
- [j16]Vera Koponen, Felix Weitkämper
:
Asymptotic elimination of partially continuous aggregation functions in directed graphical models. Inf. Comput. 293: 105061 (2023) - [i3]Vera Koponen, Felix Weitkämper
A general approach to asymptotic elimination of aggregation functions and generalized quantifiers. CoRR abs/2304.07865 (2023) - 2022
- [i2]Vera Koponen, Felix Weitkämper
On the relative asymptotic expressivity of inference frameworks. CoRR abs/2204.09457 (2022) - 2021
- [i1]Vera Koponen, Felix Weitkämper:
Asymptotic elimination of partially continuous aggregation functions in directed graphical models. CoRR abs/2106.10122 (2021) - 2020
- [j15]Vera Koponen:
Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination. Theor. Comput. Sci. 848: 1-27 (2020)
2010 – 2019
- 2019
- [j14]Vera Koponen:
Supersimple ω-categorical theories and pregeometries. Ann. Pure Appl. Log. 170(12) (2019) - 2018
- [j13]Vera Koponen:
Binary simple homogeneous structures. Ann. Pure Appl. Log. 169(12): 1335-1368 (2018) - [j12]Vera Koponen:
On Constraints and dividing in Ternary homogeneous Structures. J. Symb. Log. 83(4): 1691-1721 (2018) - 2017
- [j11]Vera Koponen:
Binary Primitive homogeneous Simple Structures. J. Symb. Log. 82(1): 183-207 (2017) - [j10]Vera Koponen:
Homogeneous 1-based structures and interpretability in random structures. Math. Log. Q. 63(1-2): 6-18 (2017) - [j9]Ove Ahlman
Random ℓ-colourable structures with a pregeometry. Math. Log. Q. 63(1-2): 32-58 (2017) - 2015
- [j8]Vera Koponen:
Typical automorphism groups of finite nonrigid structures. Arch. Math. Log. 54(5-6): 571-586 (2015) - [j7]Ove Ahlman, Vera Koponen:
Limit laws and automorphism groups of random nonrigid structures. J. Log. Anal. 7 (2015) - [j6]Vera Koponen, Tapani Hyttinen
On Compactness of Logics That Can Express Properties of Symmetry or Connectivity. Stud Logica 103(1): 1-20 (2015) - 2013
- [j5]Vera Koponen:
A limit law of almost l-partite graphs. J. Symb. Log. 78(3): 911-936 (2013) - 2012
- [j4]Vera Koponen:
Asymptotic probabilities of extension properties and random l-colourable structures. Ann. Pure Appl. Log. 163(4): 391-438 (2012) - [j3]Vera Koponen:
Random graphs with bounded maximum degree: asymptotic structure and a logical limit law. Discret. Math. Theor. Comput. Sci. 14(2): 229-254 (2012) - 2011
- [p1]Vera Koponen:
Some connections between finite and infinite model theory. Finite and Algorithmic Model Theory 2011: 109-139
2000 – 2009
- 2009
- [j2]Vera Koponen:
Entropy of formulas. Arch. Math. Log. 48(6): 515-522 (2009) - [j1]Vera Koponen:
Independence and the finite submodel property. Ann. Pure Appl. Log. 158(1-2): 58-79 (2009)
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-11-27 20:32 CET 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: