Остановите войну!
for scientists:
default search action
Leszek Gasieniec
- > Home > Persons > Leszek Gasieniec
Publications
- 2024
- [j78]Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024) - 2022
- [i21]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - 2021
- [j73]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118: 108-118 (2021) - [c115]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. OPODIS 2021: 12:1-12:21 - [i20]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. CoRR abs/2105.12083 (2021) - 2019
- [c112]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW 2019: 156-169 - 2017
- [j63]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. Algorithmica 79(2): 428-443 (2017) - [c102]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM 2017: 229-240 - 2016
- [i9]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. CoRR abs/1602.00435 (2016) - 2014
- [c89]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas:
Efficiently Correcting Matrix Products. ISAAC 2014: 53-64 - 2013
- [j51]Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas:
Efficient broadcasting in radio networks with long-range interference. Distributed Comput. 26(1): 59-74 (2013) - 2011
- [j48]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - 2009
- [j44]Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. 109(4): 242-247 (2009) - [c72]Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas:
Efficient broadcasting in known topology radio networks with long-range interference. PODC 2009: 230-239 - [c69]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - 2008
- [c64]Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen:
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288 - 2006
- [j30]Andrzej Lingas, Leszek Gasieniec:
Preface. Theor. Comput. Sci. 354(3): 319 (2006) - 2004
- [j26]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004) - 2003
- [c43]Leszek Gasieniec, Andrzej Lingas:
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. WADS 2003: 329-339 - 2002
- [j20]Leszek Gasieniec, Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. 83(2): 89-93 (2002) - [c41]Malin Christersson, Leszek Gasieniec, Andrzej Lingas:
Gossiping with Bounded Size Messages in ad hoc Radio Networks. ICALP 2002: 377-389 - [c39]Leszek Gasieniec, Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks. SODA 2002: 689-690 - 2001
- [c36]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51 - 2000
- [c34]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118 - 1999
- [j13]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999) - [c24]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906 - 1998
- [c22]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76 - 1997
- [c21]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145
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-04-25 02:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint