Остановите войну!
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 21 matches
- 2011
- Maram Alnafie, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov:
Sequential Optimization of Binary Search Trees for Multiple Cost Functions. CATS 2011: 41-44 - John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy:
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. CATS 2011: 31-40 - Gianfranco Bilardi, Carlo Fantozzi:
New Area-Time Lower Bounds for the Multidimensional DFT. CATS 2011: 111-120 - Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 - Michael J. Dinneen, Masoud Khosravani:
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. CATS 2011: 145-150 - Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. CATS 2011: 69-74 - Aniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov:
Descriptional Complexity of Determinization and Complementation for Finite Automata. CATS 2011: 95-104 - James Harland:
Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created). CATS 2011: 151-160 - Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-White Threshold Graphs. CATS 2011: 121-130 - Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS 2011: 3-10 - Naoyuki Kamiyama, Tomomi Matsui:
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS 2011: 137-144 - Alexandra Kolla, James Lee:
Sparsest Cut on Quotients of the Hypercube. CATS 2011: 11-22 - Paraschos Koutris, Aris Pagourtzis:
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS 2011: 161-168 - John Christopher McCabe-Dansted:
On the Succinctness of RoCTL*. CATS 2011: 85-94 - Eiji Miyano, Hirotaka Ono:
Maximum Domination Problem. CATS 2011: 55-62 - N. S. Narayanaswamy, N. Sadagopan:
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS 2011: 45-54 - Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS 2011: 63-68 - Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing Mod Functions. CATS 2011: 105-110 - Tadao Takaoka, Mashitoh Hashim:
Sharing Information in All Pairs Shortest Path Algorithms. CATS 2011: 131-136 - Simon Ware, Robi Malik:
A Process-Algebraic Semantics for Generalised Nonblocking. CATS 2011: 75-84 - Alex Potanin, Taso Viglas:
Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011. CRPIT 119, Australian Computer Society 2011, ISBN 978-1-920682-98-9 [contents]
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-10 19:55 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