default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaniz Abedin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Paniz Abedin, Oliver A. Chubet, Daniel Gibney, Sharma V. Thankachan:
Contextual Pattern Matching in Less Space. DCC 2023: 160-167- [c7]Isabel Zimmerman, Julia Silge, Paniz Abedin, Reinaldo Sanchez-Arias
:
Meta-Analysis of the Machine Learning Operations Open Source Ecosystem. ICMLA 2023: 922-925 - 2022
- [j7]Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. Algorithmica 84(7): 2088-2105 (2022) - 2021
- [j6]Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
I/O-efficient data structures for non-overlapping indexing. Theor. Comput. Sci. 857: 1-7 (2021) - 2020
- [j5]Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
A Survey on Shortest Unique Substring Queries. Algorithms 13(9): 224 (2020) - [j4]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Efficient Data Structures for Range Shortest Unique Substring Queries. Algorithms 13(11): 276 (2020) - [j3]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822: 15-22 (2020)
2010 – 2019
- 2019
- [c6]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Range Shortest Unique Substring Queries. SPIRE 2019: 258-266 - 2018
- [j2]Sahar Hooshmand, Neda Tavakoli, Paniz Abedin, Sharma V. Thankachan:
On Computing Average Common Substring Over Run Length Encoded Sequences. Fundam. Informaticae 163(3): 267-273 (2018) - [c5]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability. BCB 2018: 537 - [c4]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON 2018: 615-625 - [c3]Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
Non-Overlapping Indexing - Cache Obliviously. CPM 2018: 8:1-8:9 - [c2]Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem Revisited. CPM 2018: 20:1-20:13 - [c1]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability with one Mismatch. ICCABS 2018: 1 - [i2]Sahar Hooshmand, Neda Tavakoli, Paniz Abedin, Sharma V. Thankachan:
On Computing Average Common Substring Over Run Length Encoded Sequences. CoRR abs/1805.06177 (2018) - 2017
- [j1]Paniz Abedin, Saieed Akbari, Marc Demange, Tínaz Ekim:
Complexity of the Improper Twin Edge Coloring of Graphs. Graphs Comb. 33(4): 595-615 (2017) - 2016
- [i1]Paniz Abedin, Saieed Akbari, Mahsa Daneshmand, Marc Demange, Tínaz Ekim:
Improper Twin Edge Coloring of Graphs. CoRR abs/1601.02267 (2016)
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-05-08 21:50 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:
