Остановите войну!
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 672 matches
- 2011
- Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. CoRR abs/1104.4190 (2011) - Vasco Brattka, Joseph S. Miller, André Nies:
Randomness and Differentiability. CoRR abs/1104.4465 (2011) - Daniel J. Hsu, Sham M. Kakade, Tong Zhang:
Dimension-free tail inequalities for sums of random matrices. CoRR abs/1104.1672 (2011) - Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-white threshold graphs. CoRR abs/1104.3917 (2011) - Jing-Qing Xiao, Haijun Zhou:
Partition function loop series for a general graphical model: free energy corrections and message-passing equations. CoRR abs/1104.3631 (2011) - Joshua Zahl:
An improved bound on the number of point-surface incidences in three dimensions. CoRR abs/1104.4987 (2011) - Denis S. Krotov:
On the binary codes with parameters of triply-shortened 1-perfect codes. CoRR abs/1104.0005 (2011) - Christoph Adami, Jifeng Qian, Matthew Rupp, Arend Hintze:
Information content of colored motifs in complex networks. CoRR abs/1104.0025 (2011) - Guanfeng Liang, Nitin H. Vaidya:
Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links. CoRR abs/1104.0043 (2011) - Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman:
Peer Effects and Stability in Matching Markets. CoRR abs/1104.0052 (2011) - Yoo Chung:
Distributed Denial of Service is a Scalability Problem. CoRR abs/1104.0057 (2011) - Shuo-Tsung Chen, Huang-Nan Huang, Chur-Jen Chen:
Adaptive Audio Watermarking via the Optimization Point of View on the Wavelet-Based Entropy. CoRR abs/1104.0085 (2011) - Shuo-Tsung Chen, Huang-Nan Huang, Shu-Yi Tu:
Quantization Audio Watermarking with Optimal Scaling on Wavelet Coefficients. CoRR abs/1104.0087 (2011) - Yi Gai, Bhaskar Krishnamachari:
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access. CoRR abs/1104.0111 (2011) - George C. Alexandropoulos, Agisilaos Papadogiannis, Paschalis C. Sofotasios:
A Comparative Study of Relaying Schemes with Decode-and-Forward over Nakagami-m Fading Channels. CoRR abs/1104.0118 (2011) - Alireza Yazdani, Paul Jeffrey:
Complex network analysis of water distribution systems. CoRR abs/1104.0121 (2011) - Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. CoRR abs/1104.0122 (2011) - Fabian Abel, Ilknur Celik, Claudia Hauff, Laura Hollink, Geert-Jan Houben:
U-Sem: Semantic Enrichment, User Modeling and Mining of Usage Data on the Social Web. CoRR abs/1104.0126 (2011) - Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol:
The Decidability Frontier for Probabilistic Automata on Infinite Words. CoRR abs/1104.0127 (2011) - Vera Hollink, Arjen P. de Vries:
Towards an automated query modification assistant. CoRR abs/1104.0128 (2011) - Jörg Bühler, Gerhard Wunder:
On Interference Alignment and the Deterministic Capacity for Cellular Channels with Weak Symmetric Cross Links. CoRR abs/1104.0136 (2011) - Sumit Kumar, Deepti Singhal, Garimella Rama Murthy:
Doubly Cognitive Architecture Based Cognitive Wireless Sensor Network. CoRR abs/1104.0142 (2011) - Tom Britton, Mathias Lindholm, Tatyana S. Turova:
A dynamic network in a dynamic population: asymptotic properties. CoRR abs/1104.0148 (2011) - Dong-Mei Shi, Yong Zhuang, Bing-Hong Wang:
Effect of depreciation of the public goods in spatial public goods games. CoRR abs/1104.0151 (2011) - Relinde P. M. J. Jurrius:
Weight enumeration of codes from finite spaces. CoRR abs/1104.0172 (2011) - Michael Chertkov, Mikhail G. Stepanov, Feng Pan, Ross Baldick:
Exact and Efficient Algorithm to Discover Extreme Stochastic Events in Wind Generation over Transmission Power Grids. CoRR abs/1104.0183 (2011) - Martin Grohe, Marc Thurley:
Counting Homomorphisms and Partition Functions. CoRR abs/1104.0185 (2011) - Luca Valori, Francesco Picciolo, Agnes Allansdottir, Diego Garlaschelli:
Reconciling long-term cultural diversity and short-term collective social behavior. CoRR abs/1104.0186 (2011) - Ugo Dal Lago, Margherita Zorzi:
Probabilistic Operational Semantics for the Lambda Calculus. CoRR abs/1104.0195 (2011) - Boris D. Lubachevsky:
Why The Results of Parallel and Serial Monte Carlo Simulations May Differ. CoRR abs/1104.0198 (2011)
skipping 642 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-06-06 13:10 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