default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranziska Biegler
Person information
- affiliation: Berlin Institute of Technology, Department of Software Engineering and Theoretical Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i1]Lea Helmers, Franziska Horn, Franziska Biegler, Tim Oppermann, Klaus-Robert Müller:
Automating the search for a patent's prior art with a full text similarity search. CoRR abs/1901.03136 (2019)- 2014
- [j9]Alexander Bauer, Nico Görnitz, Franziska Biegler, Klaus-Robert Müller
, Marius Kloft:
Efficient Algorithms for Exact Inference in Sequence Labeling SVMs. IEEE Trans. Neural Networks Learn. Syst. 25(5): 870-881 (2014) - [c7]Franziska Biegler, Ian McQuillan:
On Comparing Deterministic Finite Automata and the Shuffle of Words. CIAA 2014: 98-109 - 2012
- [j8]Franziska Biegler, Mark Daley, Ian McQuillan:
Algorithmic decomposition of shuffle on words. Theor. Comput. Sci. 454: 38-50 (2012) - [c6]Grégoire Montavon, Katja Hansen, Siamac Fazli, Matthias Rupp, Franziska Biegler, Andreas Ziehe, Alexandre Tkatchenko, O. Anatole von Lilienfeld, Klaus-Robert Müller:
Learning Invariant Representations of Molecules for Atomization Energy Prediction. NIPS 2012: 449-457 - 2010
- [j7]Franziska Biegler, Mark Daley, Ian McQuillan:
On the Shuffle Automaton Size for Words. J. Autom. Lang. Comb. 15(1/2): 53-70 (2010)
2000 – 2009
- 2009
- [j6]Franziska Biegler, Kai Salomaa:
On the synchronized derivation depth of context-free grammars. Theor. Comput. Sci. 410(35): 3198-3208 (2009) - [j5]Franziska Biegler, Mark Daley, Markus Holzer, Ian McQuillan:
On the uniqueness of shuffle on words and finite languages. Theor. Comput. Sci. 410(38-40): 3711-3724 (2009) - [c5]Franziska Biegler, Mark Daley, Ian McQuillan:
On the Shuffle Automaton Size for Words. DCFS 2009: 79-89 - 2008
- [j4]Franziska Biegler, Mark Daley, Marjorie Elizabeth Osborne Locke:
Computation by Annotation: Modelling Epigenetic Regulation. Int. J. Found. Comput. Sci. 19(5): 1087-1098 (2008) - [c4]Franziska Biegler, Kai Salomaa:
On the Synchronized Derivation Depth of Context-Free Grammars. DCFS 2008: 73-84 - 2007
- [j3]Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages. J. Autom. Lang. Comb. 12(1-2): 7-24 (2007) - [j2]Franziska Biegler, Michael J. Burrell, Mark Daley:
Regulated RNA rewriting: Modelling RNA editing with guided insertion. Theor. Comput. Sci. 387(2): 103-112 (2007) - [j1]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An infinite hierarchy induced by depth synchronization. Theor. Comput. Sci. 387(2): 113-124 (2007) - 2006
- [c3]Franziska Biegler, Michael J. Burrell, Mark Daley:
Regulated RNA rewriting: modelling RNA editing with guided insertion. DCFS 2006: 70-81 - [c2]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An Infinite Hierarchy Induced by Depth Synchronization. DCFS 2006: 82-93 - 2005
- [c1]Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages. DCFS 2005: 236-244
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 23:17 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:
