default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIngmar Meinecke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]Ingmar Meinecke, Karin Quaas:
Parameterized model checking of weighted networks. Theor. Comput. Sci. 534: 69-85 (2014)- 2012
- [j6]Manfred Droste, Ingmar Meinecke:
Weighted automata and weighted MSO logics for average and long-time behaviors. Inf. Comput. 220: 44-59 (2012) - 2011
- [j5]Manfred Droste, Ingmar Meinecke:
Weighted Automata and Regular Expressions over Valuation Monoids. Int. J. Found. Comput. Sci. 22(8): 1829-1844 (2011) - [j4]Dietrich Kuske, Ingmar Meinecke:
Construction of tree automata from regular expressions. RAIRO Theor. Informatics Appl. 45(3): 347-370 (2011) - [c13]Manfred Droste, Doreen Götze, Steffen Märcker, Ingmar Meinecke:
Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics. Algebraic Foundations in Computer Science 2011: 30-55 - [c12]Ingmar Meinecke:
Valuations of Weighted Automata: Doing It in a Rational Way. Algebraic Foundations in Computer Science 2011: 309-346 - [c11]Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic
:
A Cascade Decomposition of Weighted Finite Transition Systems. Developments in Language Theory 2011: 472-473 - [c10]Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic:
A Cascade Decomposition of Weighted Finite Transition Systems. NCMA 2011: 137-152 - 2010
- [j3]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. Log. Methods Comput. Sci. 6(3) (2010) - [c9]Manfred Droste, Ingmar Meinecke:
Describing Average- and Longtime-Behavior by Weighted MSO Logics. MFCS 2010: 537-548 - [c8]Manfred Droste, Ingmar Meinecke:
Regular Expressions on Average and in the Long Run. CIAA 2010: 211-221
2000 – 2009
- 2009
- [c7]Ingmar Meinecke:
A Weighted µ-Calculus on Words. Developments in Language Theory 2009: 384-395 - 2008
- [c6]Dietrich Kuske, Ingmar Meinecke:
Construction of Tree Automata from Regular Expressions. Developments in Language Theory 2008: 491-503 - 2007
- [c5]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. FSTTCS 2007: 303-315 - [c4]Benedikt Bollig, Ingmar Meinecke:
Weighted Distributed Systems and Their Logics. LFCS 2007: 54-68 - 2006
- [c3]Ingmar Meinecke:
Weighted Logics for Traces. CSR 2006: 235-246 - 2005
- [j2]Ingmar Meinecke:
The Hadamard Product of Sequential-Parallel Series. J. Autom. Lang. Comb. 10(2/3): 313-346 (2005) - [c2]Ingmar Meinecke:
Gewichtete verzweigende Automaten. GI Jahrestagung (1) 2005: 391-394 - 2004
- [j1]Dietrich Kuske, Ingmar Meinecke:
Branching automata with costs - a way of reflecting parallelism in costs star. Theor. Comput. Sci. 328(1-2): 53-75 (2004) - 2003
- [c1]Dietrich Kuske, Ingmar Meinecke:
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. CIAA 2003: 150-162
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-04-24 22:53 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:
