default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Kirgizov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Abdelhamid Garah
, Nader Mbarek, Sergey Kirgizov:
Enhancing IoT data confidentiality and energy efficiency through decision tree-based self-management. Internet Things 26: 101219 (2024)- [i19]Jean-Luc Baril, Sergey Kirgizov, José Luis Ramírez, Diego Villamizar:
The Combinatorics of Motzkin Polyominoes. CoRR abs/2401.06228 (2024) - [i18]Jean-Luc Baril, Nathanaël Hassler, Sergey Kirgizov, José Luis Ramírez:
Grand zigzag knight's paths. CoRR abs/2402.04851 (2024) - [i17]Célia Biane, Greg Hampikian, Sergey Kirgizov, Khaydar Nurligareev:
Endhered patterns in matchings and RNA. CoRR abs/2404.18802 (2024) - 2023
- [c7]Abdelhamid Garah, Nader Mbarek, Sergey Kirgizov:
IoT Data Confidentiality Self-Management. DASC/PiCom/CBDCom/CyberSciTech 2023: 395-400 - [c6]Abdelhamid Garah, Nader Mbarek, Sergey Kirgizov:
Decision Tree-Based Confidentiality Self-Management in the Internet of Things. LCN 2023: 1-4 - [i16]Jean-Luc Baril, Sergey Kirgizov, Mehdi Naima:
A lattice on Dyck paths close to the Tamari lattice. CoRR abs/2309.00426 (2023) - [i15]Sergey Dovgal, Sergey Kirgizov:
Structure and growth of R-bonacci words. CoRR abs/2310.01213 (2023) - 2022
- [j14]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Gray codes for Fibonacci q-decreasing words. Theor. Comput. Sci. 927: 120-132 (2022) - [c5]Abdelhamid Garah, Nader Mbarek, Sergey Kirgizov:
An architecture for confidentiality self-management in the Internet of Things. SITIS 2022: 472-478 - [i14]Sergey Kirgizov:
Q-bonacci words and numbers. CoRR abs/2201.00782 (2022) - [i13]Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki:
Enumeration of Dyck paths with air pockets. CoRR abs/2202.06893 (2022) - [i12]Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian:
Dyck paths with catastrophes modulo the positions of a given pattern. CoRR abs/2202.11627 (2022) - [i11]Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki:
Grand Dyck paths with air pockets. CoRR abs/2211.04914 (2022) - [i10]Sergey Kirgizov, José Luis Ramírez:
Polyominoes and graphs built from Fibonacci words. CoRR abs/2211.05460 (2022) - 2021
- [j13]Jean-Luc Baril, Alexander Burstein, Sergey Kirgizov:
Pattern statistics in faro words and permutations. Discret. Math. 344(8): 112464 (2021) - [c4]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique Percolation Method: Memory Efficient Almost Exact Communities. ADMA 2021: 113-127 - [i9]Jean-Luc Baril, Sergey Kirgizov:
Transformation à la Foata for special kinds of descents and excedances. CoRR abs/2101.01928 (2021) - [i8]Jean-Luc Baril, Sergey Kirgizov:
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths. CoRR abs/2104.01186 (2021) - [i7]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Asymptotic bit frequency in Fibonacci words. CoRR abs/2106.13550 (2021) - [i6]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique percolation method: memory efficient almost exact communities. CoRR abs/2110.01213 (2021) - [i5]Jean-Luc Baril, Sergey Kirgizov:
Lattice paths with a first return decomposition constrained by the maximal height of a pattern. CoRR abs/2110.02831 (2021) - 2020
- [j12]Jean-Luc Baril, David I. Bevan, Sergey Kirgizov:
Bijections between Directed Animals, Multisets and Grand-Dyck Paths. Electron. J. Comb. 27(2): 2 (2020) - [j11]Jean-Luc Baril, Richard Genestier, Sergey Kirgizov:
Pattern distributions in Dyck paths with a first return decomposition constrained by height. Discret. Math. 343(9): 111995 (2020) - [i4]Jean-Luc Baril, Alexander Burstein, Sergey Kirgizov:
Pattern statistics in faro words and permutations. CoRR abs/2010.06270 (2020) - [i3]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Gray codes for Fibonacci q-decreasing words. CoRR abs/2010.09505 (2020)
2010 – 2019
- 2019
- [j10]Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian:
Enumeration of Łukasiewicz paths modulo some patterns. Discret. Math. 342(4): 997-1005 (2019) - [j9]Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian:
Motzkin Paths With a Restricted First Return Decomposition. Integers 19: A46 (2019) - 2018
- [j8]Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian:
Dyck paths with a first return decomposition constrained by height. Discret. Math. 341(6): 1620-1628 (2018) - [j7]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Descent distribution on Catalan words avoiding a pattern of length at most three. Discret. Math. 341(9): 2608-2615 (2018) - [i2]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Descent distribution on Catalan words avoiding a pattern of length at most three. CoRR abs/1803.06706 (2018) - 2017
- [j6]Jean-Luc Baril, Sergey Kirgizov:
The pure descent statistic on permutations. Discret. Math. 340(10): 2550-2558 (2017) - [j5]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Patterns in treeshelves. Discret. Math. 340(12): 2946-2954 (2017) - [j4]Lobna Azaza, Marinette Savonnet, Éric Leclercq, Sergey Kirgizov, Rim Faiz:
Évaluation de l'influence polarisée dans un réseau multirelationnel. Application à Twitter. Document Numérique 20(1): 67-100 (2017) - [j3]Ian Basaille, Éric Leclercq, Marinette Savonnet, Nadine Cullot, Sergey Kirgizov, Thierry Grison, Elisabeth Gavignet:
Un observatoire pour la modélisation et l'analyse des réseaux multi-relationnels. Une application à l'étude du discours politique sur Twitter. Document Numérique 20(1): 101-136 (2017) - 2016
- [j2]Julien Bensmail, Romaric Duvignau, Sergey Kirgizov:
The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17(3): 31-42 (2016) - [c3]Lobna Azaza, Sergey Kirgizov, Marinette Savonnet, Éric Leclercq, Rim Faiz:
Évaluation de l'influence dans un réseau multi-relationnel : le cas de Twitter. INFORSID 2016: 131-146 - [c2]Ian Basaille, Sergey Kirgizov, Éric Leclercq, Marinette Savonnet, Nadine Cullot:
Towards a Twitter observatory: A multi-paradigm framework for collecting, storing and analysing tweets. RCIS 2016: 1-10 - [i1]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Patterns in treeshelves. CoRR abs/1611.07793 (2016) - 2015
- [j1]François Queyroi, Sergey Kirgizov:
Suppression distance computation for hierarchical clusterings. Inf. Process. Lett. 115(9): 689-693 (2015) - [c1]Lobna Azaza, Sergey Kirgizov, Marinette Savonnet, Éric Leclercq, Rim Faiz:
Influence Assessment in Twitter Multi-relational Network. SITIS 2015: 436-443 - 2014
- [b1]Sergey Kirgizov:
Emperical study and modelling of the internet topology dynamics. (Analyse empirique et modélisation de la dynamique de la topologie de l'internet). Pierre and Marie Curie University, Paris, France, 2014
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-10-23 21:25 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:
