Остановите войну!
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 941 matches
- 2012
- Chris Aholt, Luke Oeding:
The ideal of the trifocal variety. CoRR abs/1205.3776 (2012) - Tao Wang:
On Murty-Simon Conjecture. CoRR abs/1205.4397 (2012) - Mahmoud A. Abdel-Aty:
Indices to Quantify the Ranking of Arabic Journals and Research Output. CoRR abs/1205.0003 (2012) - Christina Aperjis, Bernardo A. Huberman:
A Market for Unbiased Private Data: Paying Individuals According to their Privacy Attitudes. CoRR abs/1205.0030 (2012) - David J. Rosenbaum:
Optimal Quantum Circuits for Nearest-Neighbor Architectures. CoRR abs/1205.0036 (2012) - Fergal Reid, Aaron F. McDaid, Neil J. Hurley:
Percolation Computation in Complex Networks. CoRR abs/1205.0038 (2012) - Eyal Cohen, Shlomi Dolev, Sergey Frenkel, Boris Kryzhanovsky, Alexandr Palagushkin, Michael Rosenblit, Victor N. Zakharov:
Optical Solver of Combinatorial Problems: Nano-Technological Approach. CoRR abs/1205.0040 (2012) - Mateusz Ujma, Nastaran Shafiei:
jpf-concurrent: An extension of Java PathFinder for java.util.concurrent. CoRR abs/1205.0042 (2012) - Ankur Moitra:
A Singly-Exponential Time Algorithm for Computing Nonnegative Rank. CoRR abs/1205.0044 (2012) - Soummya Kar, José M. F. Moura, H. Vincent Poor:
$QD$-Learning: A Collaborative Distributed Strategy for Multi-Agent Reinforcement Learning Through Consensus + Innovations. CoRR abs/1205.0047 (2012) - Giacomo Como, Ketan Savla, Daron Acemoglu, Munther A. Dahleh, Emilio Frazzoli:
Robust Distributed Routing in Dynamical Networks with Cascading Failures. CoRR abs/1205.0076 (2012) - Julien Mairal, Bin Yu:
Complexity Analysis of the Lasso Regularization Path. CoRR abs/1205.0079 (2012) - Keonkook Lee, Chan-Byoung Chae, Joonhyuk Kang:
Spectrum Leasing via Cooperation for Enhanced Physical-Layer Secrecy. CoRR abs/1205.0085 (2012) - Nebojsa Skrbina, Toni Stojanovski:
Using parallel processing for file carving. CoRR abs/1205.0103 (2012) - Marko Vuckovic, Toni Stojanovski:
Migration of data for iKnow application at EURM - a case study. CoRR abs/1205.0104 (2012) - Verche Cvetanoska, Toni Stojanovski:
Using high performance computing and Monte Carlo simulation for pricing american options. CoRR abs/1205.0106 (2012) - Jung-Hun Yang, Dick Ettema, Koen Frenken, Frank Van Oort, Evert-Jan Visser:
Modelling spatial patterns of economic activity in the Netherlands. CoRR abs/1205.0110 (2012) - Emile Simon:
Alternatives for optimization in systems and control: convex and non-convex approaches. CoRR abs/1205.0111 (2012) - Jagbeer Singh, Satyendra Prasad Singh:
Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm. CoRR abs/1205.0124 (2012) - Arpine Khachatryan, Rafayel R. Kamalian:
On the parameter μ21 of a complete bipartite graph. CoRR abs/1205.0125 (2012) - Rafayel R. Kamalian:
It was not known about simple cycles. CoRR abs/1205.0128 (2012) - Rafayel R. Kamalian:
On one-sided interval edge colorings of biregular bipartite graphs. CoRR abs/1205.0130 (2012) - Rafael R. Kamalian:
Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs. CoRR abs/1205.0131 (2012) - Marius Buliga:
$λ$-Scale, a lambda calculus for spaces with dilations. CoRR abs/1205.0139 (2012) - Eden Chlamtac, Michael Dinitz, Robert Krauthgamer:
Everywhere-Sparse Spanners via Dense Subgraphs. CoRR abs/1205.0144 (2012) - M. A. Sumour, M. A. Radwan:
Non-Universality in Semi-Directed Barabasi-Albert Networks. CoRR abs/1205.0149 (2012) - Maggie E. Habeeb, Delaram Kahrobaei, Vladimir Shpilrain:
A Secret Sharing Scheme Based on Group Presentations and the Word Problem. CoRR abs/1205.0157 (2012) - Mohammad Shaqfeh, Hussein M. Alnuweiri:
Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels. CoRR abs/1205.0162 (2012) - Czeslaw Bylinski, Jesse Alama:
New developments in parsing Mizar. CoRR abs/1205.0170 (2012) - Anupam Gupta, Viswanath Nagarajan:
Approximating Sparse Covering Integer Programs Online. CoRR abs/1205.0175 (2012)
skipping 911 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 12:11 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