Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurilo Santos de Lima
Person information
- affiliation: University of Campinas, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Thomas Erlebach
, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica 85(2): 406-443 (2023)- [c9]Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI 2023: 5577-5585 - [i8]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR abs/2305.09245 (2023) - 2022
- [c8]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA 2022: 49:1-49:18 - [i7]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR abs/2206.15201 (2022) - 2021
- [j4]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-competitive sorting with uncertainty. Theor. Comput. Sci. 867: 50-67 (2021) - [j3]Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan:
Query minimization under stochastic uncertainty. Theor. Comput. Sci. 895: 75-95 (2021) - [c7]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA 2021: 10:1-10:18 - [c6]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS 2021: 27:1-27:18 - [i6]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR abs/2101.05032 (2021) - [i5]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR abs/2107.00572 (2021) - 2020
- [j2]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Group parking permit problems. Discret. Appl. Math. 281: 172-194 (2020) - [c5]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization Under Stochastic Uncertainty. LATIN 2020: 181-193 - [i4]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization under Stochastic Uncertainty. CoRR abs/2010.03517 (2020) - [i3]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Untrusted Predictions Improve Trustable Query Policies. CoRR abs/2011.07385 (2020) - [i2]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-Competitive Sorting with Uncertainty. CoRR abs/2012.09475 (2020)
2010 – 2019
- 2019
- [c4]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-Competitive Sorting with Uncertainty. MFCS 2019: 7:1-7:15 - 2017
- [j1]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
On Generalizations of the Parking Permit Problem and Network Leasing Problems. Electron. Notes Discret. Math. 62: 225-230 (2017) - [c3]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Connected Facility Leasing Problems. ICTCS/CILC 2017: 162-173 - 2016
- [i1]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Facility Leasing with Penalties. CoRR abs/1610.00575 (2016) - 2012
- [c2]Fabíola Greve, Murilo Santos de Lima, Luciana Arantes, Pierre Sens:
A Time-Free Byzantine Failure Detector for Dynamic Networks. EDCC 2012: 191-202 - 2011
- [c1]Murilo Santos de Lima, Fabíola Greve, Luciana Arantes, Pierre Sens:
The time-free approach to Byzantine failure detection in dynamic networks. DSN Workshops 2011: 3-8
Coauthor Index
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.
last updated on 2023-09-27 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
