![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 2021
- Pavel Alaev, Victor L. Selivanov:
Searching for Applicable Versions of Computable Structures. CiE 2021: 1-11 - Melissa Antonelli, Ugo Dal Lago, Paolo Pistone
:
On Measure Quantifiers in First-Order Arithmetic. CiE 2021: 12-24 - Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
:
Learning Languages with Decidable Hypotheses. CiE 2021: 25-37 - Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CiE 2021: 38-49 - Samuel D. Birns, Bjørn Kjos-Hanssen:
On the Degrees of Constructively Immune Sets. CiE 2021: 50-59 - Karl Bringmann:
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry. CiE 2021: 60-70 - Merlin Carl
:
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. CiE 2021: 71-81 - Merlin Carl, Lorenzo Galeotti, Robert Paßmann:
Randomising Realizability. CiE 2021: 82-93 - Lorenzo Carlucci:
Restrictions of Hindman's Theorem: An Overview. CiE 2021: 94-105 - Rayan Chikhi:
A Tale of Optimizing the Space Taken by de Bruijn Graphs. CiE 2021: 120-134 - Liron Cohen:
Formally Computing with the Non-computable. CiE 2021: 135-145 - Barbara F. Csima, Dino Rossegger
, Daniel Yu:
Positive Enumerable Functors. CiE 2021: 385-394 - Vanja Doskoc, Timo Kötzing:
Mapping Monotonic Restrictions in Inductive Inference. CiE 2021: 146-157 - Vanja Doskoc, Timo Kötzing:
Normal Forms for Semantically Witness-Based Learners in Inductive Inference. CiE 2021: 158-168 - Jordan M. Eizenga
, Ryan Lorig-Roach
, Melissa M. Meredith
, Benedict Paten
:
Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted. CiE 2021: 169-177 - Esther Ezra
:
On 3SUM-hard Problems in the Decision Tree Model. CiE 2021: 178-188 - Marat Kh. Faizrahmanov
:
Limitwise Monotonic Spectra and Their Generalizations. CiE 2021: 189-198 - Fernando Ferreira
:
On False Heine/Borel Compactness Principles in Proof Mining. CiE 2021: 199-203 - Till Fluschnik
, Leon Kellerhals
:
Placing Green Bridges Optimally, with a Multivariate Analysis. CiE 2021: 204-216 - Johanna N. Y. Franklin
:
A Church-Turing Thesis for Randomness? CiE 2021: 217-226 - Askar Gafurov, Tomás Vinar
, Brona Brejová:
Probabilistic Models of k-mer Frequencies (Extended Abstract). CiE 2021: 227-236 - Francesco A. Genco, Francesca Poggiolesi:
Defining Formal Explanation in Classical Logic by Substructural Derivability. CiE 2021: 237-247 - Ivan Georgiev
:
Dedekind Cuts and Long Strings of Zeros in Base Expansions. CiE 2021: 248-259 - Eric Goles, Pedro Montealegre
, Martín Ríos-Wilson
, Guillaume Theyssier:
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. CiE 2021: 260-272 - Daniel Silva Graça
, Ning Zhong:
Computability of Limit Sets for Two-Dimensional Flows. CiE 2021: 494-503 - Ardalan Khazraei, Timo Kötzing, Karen Seidel:
Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. CiE 2021: 273-284 - Bjørn Kjos-Hanssen, David J. Webb
:
KL-Randomness and Effective Dimension Under Strong Reducibility. CiE 2021: 457-468 - Leszek Aleksander Kolodziejczyk
, Keita Yokoyama
:
In Search of the First-Order Part of Ramsey's Theorem for Pairs. CiE 2021: 297-307 - Timo Kötzing, Karen Seidel:
Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CiE 2021: 318-329 - Angeliki Koutsoukou-Argyraki
:
On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy. CiE 2021: 285-296
skipping 16 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-15 04:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint