Остановите войну!
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 19 matches
- 2024
- Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. ITCS 2024: 56:1-56:17 - Tsubasa Harada:
A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line. CoRR abs/2402.12734 (2024) - 2023
- Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. CoRR abs/2311.05773 (2023) - 2020
- Will Ma, David Simchi-Levi:
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Oper. Res. 68(6): 1787-1803 (2020) - Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky:
Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache. CSCML 2020: 237-244 - 2019
- Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. SODA 2019: 2875-2886 - Will Ma, David Simchi-Levi:
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios. CoRR abs/1905.04770 (2019) - 2018
- Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. CoRR abs/1810.07903 (2018) - 2016
- Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. ACM Trans. Algorithms 13(1): 15:1-15:34 (2016) - 2013
- Rahul Vaze:
Competitive ratio analysis of online algorithms to minimize packet transmission time in energy harvesting communication system. INFOCOM 2013: 1115-1123 - 2011
- Rahul Vaze:
Competitive Ratio Analysis of Online Algorithms to Minimize Data Transmission Time in Energy Harvesting Communication System. CoRR abs/1112.5557 (2011) - 2010
- Satyajit Banerjee:
On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem. Discret. Math. Algorithms Appl. 2(2): 257-262 (2010) - 2009
- Shuichi Miyazaki, Kazuya Okamoto:
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. Algorithms 2(3): 953-972 (2009) - 2008
- Dimitris Fotakis:
On the Competitive Ratio for Online Facility Location. Algorithmica 50(1): 1-57 (2008) - Wen-Feng Kuo, Chi-Yuan Lin, Yung-Nien Sun:
Brain MR images segmentation using statistical ratio: Mapping between watershed and competitive Hopfield clustering network algorithms. Comput. Methods Programs Biomed. 91(3): 191-198 (2008) - 2004
- Yair Bartal, Elias Koutsoupias:
On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci. 324(2-3): 337-345 (2004) - 2002
- Satoshi Fujita:
A Semi-dynamic Multiprocessor Scheduling Algorithm with an Asymptotically Optimal Competitive Ratio. Euro-Par 2002: 240-247 - 2000
- Yair Bartal, Elias Koutsoupias:
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613 - 1997
- Kunsoo Park, Sang Lyul Min, Yookun Cho:
The Working Set Algorithm has Competitive Ratio Less Than Two. Inf. Process. Lett. 63(4): 183-188 (1997)
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-27 01:13 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