Остановите войну!
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 287 matches
- 2008
- Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath:
The Pursuit For Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. CoRR abs/0810.4840 (2008) - Pavel Chebotarev:
A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances. CoRR abs/0810.2717 (2008) - Xinjia Chen:
Robust Estimation of Mean Values. CoRR abs/0810.4727 (2008) - Xinjia Chen:
A Theory of Truncated Inverse Sampling. CoRR abs/0810.5551 (2008) - Shigeru Furuichi:
An axiomatic characterization of a two-parameter extended relative entropy. CoRR abs/0810.5399 (2008) - Anil N. Hirani, K. B. Nakshatrala, Jehanzeb Hameed Chaudhry:
Numerical method for Darcy flow derived using Discrete Exterior Calculus. CoRR abs/0810.3434 (2008) - Michael H. Freedman:
Complexity Classes as Mathematical Axioms. CoRR abs/0810.0033 (2008) - Matthias Fischer, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, Martin Ziegler:
Planar Visibility Counting. CoRR abs/0810.0052 (2008) - Salim Y. El Rouayheb, Alexander Sprintson, Costas N. Georghiades:
On the Index Coding Problem and its Relation to Network Coding and Matroid Theory. CoRR abs/0810.0068 (2008) - Alvaro H. Salas:
Acerca del Algoritmo de Dijkstra. CoRR abs/0810.0075 (2008) - Murat Alanyali, Maxim Dashouk:
Occupancy distributions of homogeneous queueing systems under opportunistic scheduling. CoRR abs/0810.0135 (2008) - Wilson Wong, Wei Liu, Mohammed Bennamoun:
Determining the Unithood of Word Sequences using a Probabilistic Approach. CoRR abs/0810.0139 (2008) - Koichiro Kitagawa, Toshiyuki Tanaka:
Optimization of sequences in CDMA systems: a statistical-mechanics approach. CoRR abs/0810.0154 (2008) - Wilson Wong, Wei Liu, Mohammed Bennamoun:
Determining the Unithood of Word Sequences using Mutual Information and Independence Measure. CoRR abs/0810.0156 (2008) - Andrij A. Rovenchak, Ján Macutek, Charles Riley:
Distribution of complexities in the Vai script. CoRR abs/0810.0200 (2008) - David R. Musser, Gor V. Nishanov:
A Fast Generic Sequence Matching Algorithm. CoRR abs/0810.0264 (2008) - K. B. Nakshatrala, Albert J. Valocchi:
Non-negative mixed finite element formulations for a tensorial diffusion equation. CoRR abs/0810.0322 (2008) - Lu Lu, Soung Chang Liew, Shengli Zhang:
Collision Resolution by Exploiting Symbol Misalignment. CoRR abs/0810.0326 (2008) - Aldar C.-F. Chan:
Cryptographic Defence against Misbehaving TCP Receivers. CoRR abs/0810.0328 (2008) - Wilson Wong, Wei Liu, Mohammed Bennamoun:
Enhanced Integrated Scoring for Cleaning Dirty Texts. CoRR abs/0810.0332 (2008) - Filipe Cabecinhas, Nuno P. Lopes, Renato Crisostomo, Luís Veiga:
Optimizing Binary Code Produced by Valgrind (Project Report on Virtual Execution Environments Course - AVExe). CoRR abs/0810.0372 (2008) - Péter Fülöp, Benedek Kovács, Sándor Imre:
Mobility Management Framework. CoRR abs/0810.0394 (2008) - Pawel Sobkowicz:
Peer-review in the Internet age. CoRR abs/0810.0486 (2008) - Amin Jafarian, Sriram Vishwanath:
On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels. CoRR abs/0810.0503 (2008) - Bart de Keijzer:
Three New Complexity Results for Resource Allocation Problems. CoRR abs/0810.0532 (2008) - Andrew Thangaraj, Safitha J. Raj:
Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding. CoRR abs/0810.0567 (2008) - Siddharth Barman, Shuchi Chawla:
Packing multiway cuts in capacitated graphs. CoRR abs/0810.0674 (2008) - Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. CoRR abs/0810.0693 (2008) - Jaeok Park, Mihaela van der Schaar:
Stackelberg Contention Games in Multi-User Networks. CoRR abs/0810.0745 (2008) - Ravi Tandon, Sennur Ulukus:
A New Upper Bound on the Capacity of a Class of Primitive Relay Channels. CoRR abs/0810.0747 (2008)
skipping 257 more matches
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-03-29 02:49 CET 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