default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Touitou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j1]Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou
:
Competitive Vertex Recoloring. Algorithmica 85(7): 2001-2027 (2023)- [c14]Noam Touitou:
Frameworks for Nonclairvoyant Network Design with Deadlines or Delay. ICALP 2023: 105:1-105:20 - [c13]Noam Touitou, Nissim Halabi:
Approximate Nearest Neighbor Search through Modern Error-Correcting Codes. ICLR 2023 - [c12]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Discrete-Smoothness in Online Algorithms with Predictions. NeurIPS 2023 - [c11]Noam Touitou:
Improved and Deterministic Online Service with Deadlines or Delay. STOC 2023: 761-774 - [i8]Noam Touitou:
Improved and Deterministic Online Service with Deadlines or Delay. CoRR abs/2306.05744 (2023) - 2022
- [b1]Noam Touitou:
Online Problems with Deadlines, Delay or Predictions. Tel Aviv University, Israel, 2022 - [c10]Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou:
Competitive Vertex Recoloring. ICALP 2022: 13:1-13:20 - [c9]Yossi Azar, Eldad Peretz, Noam Touitou:
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. ISAAC 2022: 16:1-16:18 - [c8]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. SODA 2022: 35-66 - [c7]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. SODA 2022: 252-274 - 2021
- [c6]Noam Touitou:
Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay. ISAAC 2021: 53:1-53:16 - [c5]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow time scheduling with uncertain processing time. STOC 2021: 1070-1080 - [i7]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow Time Scheduling with Uncertain Processing Time. CoRR abs/2103.05604 (2021) - [i6]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. CoRR abs/2109.08424 (2021) - [i5]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. CoRR abs/2112.11831 (2021) - 2020
- [c4]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover with Delay - Clairvoyance Is Not Required. ESA 2020: 8:1-8:21 - [c3]Yossi Azar, Noam Touitou:
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. FOCS 2020: 1368-1379 - [i4]Yossi Azar, Noam Touitou:
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. CoRR abs/2004.07946 (2020)
2010 – 2019
- 2019
- [c2]Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. FOCS 2019: 60-71 - [i3]Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. CoRR abs/1904.07131 (2019) - 2018
- [c1]Yossi Azar, Noam Touitou:
Improved Online Algorithm for Weighted Flow Time. FOCS 2018: 427-437 - [i2]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover and Vertex Cover with Delay. CoRR abs/1807.08543 (2018) - 2017
- [i1]Yossi Azar, Noam Touitou:
Improved Online Algorithm for Weighted Flow Time. CoRR abs/1712.10273 (2017)
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 2024-07-25 20:26 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:
