Остановите войну!
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 33 matches
- 2021
- Anand Kalvit, Assaf Zeevi:
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. NeurIPS 2021: 8807-8819 - Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý:
Theory meets Practice: worst case behavior of quantile algorithms. CoRR abs/2102.09299 (2021) - Anand Kalvit, Assaf Zeevi:
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. CoRR abs/2106.02126 (2021) - 2018
- Manuel Heusner, Thomas Keller, Malte Helmert:
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI 2018: 1463-1470 - 2017
- Harrison Kurunathan, Ricardo Severino, Anis Koubaa, Eduardo Tovar:
Worst-case bound analysis for the time-critical MAC behaviors of IEEE 802.15.4e. WFCS 2017: 1-9 - 2014
- Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. 560: 108-120 (2014) - 2013
- Takehiko Amaki, Masanori Hashimoto, Yukio Mitsuyama, Takao Onoye:
A Worst-Case-Aware Design Methodology for Noise-Tolerant Oscillator-Based True Random Number Generator With Stochastic Behavior Modeling. IEEE Trans. Inf. Forensics Secur. 8(8): 1331-1342 (2013) - Alexander Jordan, Florian Brandner, Martin Schoeberl:
Static analysis of worst-case stack cache behavior. RTNS 2013: 55-64 - Yann Disser, Martin Skutella:
In defense of the Simplex Algorithm's worst-case behavior. CoRR abs/1311.5935 (2013) - 2012
- Lu Wan, Deming Chen:
Analysis of Digital Circuit Dynamic Behavior With Timed Ternary Decision Diagrams for Better-Than-Worst-Case Design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(5): 662-675 (2012) - Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The Worst Case Behavior of Randomized Gossip. TAMC 2012: 330-345 - 2011
- Ji-Bo Wang, Ming-Zheng Wang:
Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Ann. Oper. Res. 191(1): 155-169 (2011) - Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa, Einar Broch Johnsen, Rudolf Schlatte, Silvia Lizeth Tapia Tarifa:
Simulating Concurrent Behaviors with Worst-Case Cost Bounds. FM 2011: 353-368 - 2010
- Jack Whitham, Neil C. Audsley:
Investigating Average versus Worst-Case Timing Behavior of Data Caches and Data Scratchpads. ECRTS 2010: 165-174 - 2009
- Jean Berstel, Luc Boasson, Olivier Carton:
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009) - Jason Cong, Albert Liu, Bin Liu:
A variation-tolerant scheduler for better than worst-case behavioral synthesis. CODES+ISSS 2009: 221-228 - Arjen den Hamer, Siep Weiland, Maarten Steinbuch:
Worst-case inter frequency grid behavior of transfer functions identified via finite frequency response data. ECC 2009: 466-471 - 2008
- Andrei Tchernykh, Klaus Ecker:
Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(8): 2277-2280 (2008) - 2006
- Jan Staschulat, Rolf Ernst:
Worst case timing analysis of input dependent data cache behavior. ECRTS 2006: 227-236 - 2005
- Yupei Xiong, Bruce L. Golden, Edward A. Wasil:
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Oper. Res. Lett. 33(1): 77-80 (2005) - Harini Ramaprasad, Frank Mueller:
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 148-157 - 2004
- Eduard A. Jorswieck, Holger Boche:
Performance Analysis of Capacity of MIMO Systems under Multiuser Interference Based on Worst-Case Noise Behavior. EURASIP J. Wirel. Commun. Netw. 2004(2): 273-285 (2004) - 2003
- Miklós Ajtai:
The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice. STOC 2003: 396-406 - 2000
- Kaihong Xu:
The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items. J. Algorithms 37(2): 237-246 (2000) - 1996
- André van Vliet:
On the Asymptotic Worst Case Behavior of Harmonic Fit. J. Algorithms 20(1): 113-136 (1996) - Jeongyoujng Byun, Andy J. Wellings, Alan Burns:
A Worst-Case Behavior Analysis for Hard Real-Time Transactions. RTDB 1996: 144-149 - 1989
- M. Reza Emamy-Khansary:
The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions. Discret. Appl. Math. 23(3): 285-287 (1989) - 1988
- Alejandro A. Schäffer:
A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm. J. Algorithms 9(3): 321-342 (1988) - 1984
- Svante Carlsson:
Improving Worst-Case Behavior of Heaps. BIT 24(1): 14-18 (1984) - 1980
- Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider:
Binary Search Trees: Average and Worst Case Behavior. J. Inf. Process. Cybern. 16(1-3): 41-61 (1980)
skipping 3 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-04-23 21:27 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