![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 33 matches
- 2001
- Marcus Hutter:
General Loss Bounds for Universal Sequence Prediction. CoRR cs.AI/0101019 (2001) - James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. CoRR cs.CE/0101015 (2001) - Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church:
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. CoRR cs.CE/0101016 (2001) - Ming-Yang Kao:
Tree Contractions and Evolutionary Trees. CoRR cs.CE/0101030 (2001) - Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. CoRR cs.CE/0101031 (2001) - Marshall W. Bern, David Eppstein:
Optimal Moebius Transformations for Information Visualization and Meshing. CoRR cs.CG/0101006 (2001) - Jörn Müller-Quade, Hideki Imai:
More Robust Multiparty Protocols with Oblivious Transfer. CoRR cs.CR/0101020 (2001) - Ming-Yang Kao:
Total Protection of Analytic Invariant Information in Cross Tabulated Tables. CoRR cs.CR/0101032 (2001) - Ming-Yang Kao:
Data Security Equals Graph Connectivity. CoRR cs.CR/0101034 (2001) - Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. CoRR cs.CV/0101010 (2001) - Nick Chater, Paul M. B. Vitányi:
The Generalized Universal Law of Generalization. CoRR cs.CV/0101036 (2001) - Péter Gács:
Deterministic computations whose history is independent of the order of asynchronous updating. CoRR cs.DC/0101026 (2001) - Simeon Warner:
Open Archives Initiative protocol development and implementation at arXiv. CoRR cs.DL/0101027 (2001) - Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. CoRR cs.DM/0101028 (2001) - Kevin K. H. Cheung, Michele Mosca:
Decomposing Finite Abelian Groups. CoRR cs.DS/0101004 (2001) - Xin He, Ming-Yang Kao, Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. CoRR cs.DS/0101021 (2001) - Ming-Yang Kao, Stephen R. Tate:
On-Line Difference Maximization. CoRR cs.DS/0101024 (2001) - Xin He, Ming-Yang Kao, Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. CoRR cs.DS/0101033 (2001) - Ming-Yang Kao:
Multiple-Size Divide-and-Conquer Recurrences. CoRR cs.GL/0101011 (2001) - Paul Hildreth, Chris Kimble, Peter C. Wright:
Communities of Practice in the Distributed International Environment. CoRR cs.HC/0101012 (2001) - Paul M. Aoki, Amy Hurst, Allison Woodruff:
Tap Tips: Lightweight Discovery of Touchscreen Targets. CoRR cs.HC/0101029 (2001) - Allison Woodruff, Paul M. Aoki, Amy Hurst, Margaret H. Szymanski:
The Guidebook, the Friend, and the Room: Visitor Experience in a Historic House. CoRR cs.HC/0101035 (2001) - Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin:
A Classification of Symbolic Transition Systems. CoRR cs.LO/0101013 (2001) - Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. CoRR cs.LO/0101014 (2001) - Ulrich Ultes-Nitsche, Pierre Wolper:
Checking Properties within Fairness and Behavior Abstractions. CoRR cs.LO/0101017 (2001) - Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. CoRR cs.LO/0101022 (2001) - Jorge J. Moré:
Automatic Differentiation Tools in Optimization Software. CoRR cs.MS/0101001 (2001) - Steven Benson, Lois C. McInnes, Jorge J. Moré:
GPCG: A Case Study in the Performance and Scalability of Optimization Algorithms. CoRR cs.MS/0101018 (2001) - Federico Fontana, Davide Rocchesso:
Signal-Theoretic Characterization of Waveguide Mesh Geometries for Models of Two-Dimensional Wave Propagation in Elastic Media. CoRR cs.NA/0101003 (2001) - Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of Input-Consuming Derivations. CoRR cs.PL/0101023 (2001)
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-08-31 14:51 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