Остановите войну!
for scientists:
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 30 matches
- 2007
- Marco Almeida, Nelma Moreira, Rogério Reis:
Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2): 93-102 (2007) - Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007) - Rotem Bennet, Nader H. Bshouty:
Learning attribute-efficiently with corrupt oracles. Theor. Comput. Sci. 387(1): 32-50 (2007) - Franziska Biegler, Michael J. Burrell, Mark Daley:
Regulated RNA rewriting: Modelling RNA editing with guided insertion. Theor. Comput. Sci. 387(2): 103-112 (2007) - Franziska Biegler, Ian McQuillan, Kai Salomaa:
An infinite hierarchy induced by depth synchronization. Theor. Comput. Sci. 387(2): 113-124 (2007) - Brendan J. Cordy, Kai Salomaa:
On the existence of regular approximations. Theor. Comput. Sci. 387(2): 125-135 (2007) - Jürgen Dassow, Bianca Truthe:
On the number of components for some parallel communicating grammar systems. Theor. Comput. Sci. 387(2): 136-146 (2007) - Michael Domaratzki, Kai Salomaa:
Transition complexity of language operations. Theor. Comput. Sci. 387(2): 147-154 (2007) - Peter M. Fenwick:
Burrows-Wheeler compression: Principles and reflections. Theor. Comput. Sci. 387(3): 200-219 (2007) - Paolo Ferragina, Giovanni Manzini, S. Muthukrishnan:
Foreword. Theor. Comput. Sci. 387(3): 197-199 (2007) - Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino:
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. Theor. Comput. Sci. 387(3): 236-248 (2007) - Alexander Golynski:
Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3): 348-359 (2007) - Hermann Gruber, Markus Holzer:
On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387(2): 155-166 (2007) - Hermann Gruber, Markus Holzer, Martin Kutrib:
The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007) - Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter:
Compressed data structures: Dictionaries and data-aware measures. Theor. Comput. Sci. 387(3): 313-331 (2007) - Sanjay Jain, Efim B. Kinber:
Learning multiple languages in groups. Theor. Comput. Sci. 387(1): 67-76 (2007) - Sanjay Jain, Steffen Lange, Sandra Zilles:
A general comparison of language learning from examples and from queries. Theor. Comput. Sci. 387(1): 51-66 (2007) - Haim Kaplan, Shir Landau, Elad Verbin:
A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007) - Juha Kärkkäinen:
Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci. 387(3): 249-257 (2007) - N. Jesper Larsson, Kunihiko Sadakane:
Faster suffix sorting. Theor. Comput. Sci. 387(3): 258-272 (2007) - Hing Leung, Giovanni Pighizzini:
Preface. Theor. Comput. Sci. 387(2): 91-92 (2007) - Veli Mäkinen, Gonzalo Navarro:
Rank and select revisited and extended. Theor. Comput. Sci. 387(3): 332-347 (2007) - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci. 387(3): 298-312 (2007) - Carlo Mereghetti, Beatrice Palano:
Quantum automata for some multiperiodic languages. Theor. Comput. Sci. 387(2): 177-186 (2007) - Frank Nießner, Ulrich Ultes-Nitsche:
A complete characterization of deterministic regular liveness properties. Theor. Comput. Sci. 387(2): 187-195 (2007) - Nick Palmer, Paul W. Goldberg:
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. Theor. Comput. Sci. 387(1): 18-31 (2007) - Hans Ulrich Simon, Etsuji Tomita:
Guest editors' foreword. Theor. Comput. Sci. 387(1): 1-3 (2007) - Binh Dao Vo, Kiem-Phong Vo:
Compressing table data with column dependency. Theor. Comput. Sci. 387(3): 273-283 (2007) - Vladimir Vovk:
Non-asymptotic calibration and resolution. Theor. Comput. Sci. 387(1): 77-89 (2007) - Kazuho Watanabe, Sumio Watanabe:
Stochastic complexity for mixture of exponential families in generalized variational Bayes. Theor. Comput. Sci. 387(1): 4-17 (2007)
loading more results
failed to load more results, please try again later
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-05-30 19:41 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