Остановите войну!
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 44 matches
- 2023
- Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR23 (2023) - Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023: 1086 (2023) - 2022
- Ludovic Thomas, Ahlem Mifdaoui, Jean-Yves Le Boudec:
Worst-Case Delay Bounds in Time-Sensitive Networks With Packet Replication and Elimination. IEEE/ACM Trans. Netw. 30(6): 2701-2715 (2022) - Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA 2022: 12-23 - 2021
- Jinghao Sun, Nan Guan, Zhishan Guo, Yekai Xue, Jing He, Guozhen Tan:
Calculating Worst-Case Response Time Bounds for OpenMP Programs with Loop Structures. RTSS 2021: 123-135 - Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR abs/2108.08825 (2021) - Ludovic Thomas, Ahlem Mifdaoui, Jean-Yves Le Boudec:
Worst-case Delay Bounds in Time-Sensitive Networks with Packet Replication and Elimination. CoRR abs/2110.05808 (2021) - 2020
- Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. SODA 2020: 2562-2574 - Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. CoRR abs/2001.10801 (2020) - 2019
- Johnny C. Ho, Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres:
A note on posterior tight worst-case bounds for longest processing time schedules. 4OR 17(1): 97-107 (2019) - 2018
- Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - 2017
- Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution. J. Symb. Comput. 80: 101-124 (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 - Moses Charikar, Shay Solomon:
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds. CoRR abs/1711.06883 (2017) - 2014
- Florian Brandner, Alexander Jordan:
Refinement of worst-case execution time bounds by graph pruning. Comput. Lang. Syst. Struct. 40(3-4): 155-170 (2014) - Zain Alabedin Haj Hammadeh, Sophie Quinton, Rolf Ernst:
Extending typical worst-case analysis using response-time dependencies to bound deadline misses. EMSOFT 2014: 10:1-10:10 - Omar I. Al-Bataineh, Mark Reynolds, Tim French:
Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices. FORMATS 2014: 38-52 - Yiqiang Ding, Wei Zhang:
Bounding the Worst-Case Execution Time of Static NUCA Caches. HPCC/CSS/ICESS 2014: 1181-1184 - Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) 2014: 532-543 - 2013
- Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR abs/1312.1382 (2013) - 2012
- Luca Bisti, Luciano Lenzini, Enzo Mingozzi, Giovanni Stea:
Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks. Real Time Syst. 48(5): 527-569 (2012) - Lan Wu, Wei Zhang:
A Model Checking Based Approach to Bounding Worst-Case Execution Time for Multicore Processors. ACM Trans. Embed. Comput. Syst. 11(S2): 56:1-56:19 (2012) - 2011
- Raimund Kirner, Jens Knoop, Adrian Prantl, Markus Schordan, Albrecht Kadlec:
Beyond loop bounds: comparing annotation languages for worst-case execution time analysis. Softw. Syst. Model. 10(3): 411-437 (2011) - 2009
- Victor Pollex, Steffen Kollmann, Karsten Albers, Frank Slomka:
Improved worst-case response-time calculations by upper-bound conditions. DATE 2009: 105-110 - Harini Ramaprasad, Frank Mueller:
Bounding Worst-Case Response Times of Tasks under PIP. IEEE Real-Time and Embedded Technology and Applications Symposium 2009: 183-192 - 2008
- Harini Ramaprasad, Frank Mueller:
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions. IEEE Real-Time and Embedded Technology and Applications Symposium 2008: 58-67 - 2007
- Guillermo De Ita Luna, Aurelio López-López:
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets. CAAN 2007: 85-98 - Danyu Bai, Lixin Tang:
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. COCOA 2007: 191-199 - 2005
- Jürgen Stohr, Alexander von Bülow, Georg Färber:
Bounding Worst-Case Access Times in Modern Multiprocessor Systems. ECRTS 2005: 189-198 - 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
skipping 14 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-25 08:58 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