Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2018
- Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. GASCom 2018: 148-155 - Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil:
On the maximal number of leaves in induced subtrees of series-parallel graphs. GASCom 2018: 24-31 - Ron M. Adin, Sergi Elizalde, Victor Reiner, Yuval Roichman:
Cyclic descent extensions and distributions. GASCom 2018: 32-42 - Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: a very fast, parallel random permutation algorithm. GASCom 2018: 43-52 - Eli Bagno, Riccardo Biagioli, David Garber:
Stirling and Eulerian numbers of types B and D. GASCom 2018: 53-59 - Cyril Banderier, Philippe Marchal, Michael Wallner:
Rectangular Young tableaux with local decreases and the density method for uniform random generation. GASCom 2018: 60-68 - Cyril Banderier, Michael Wallner:
Local time for lattice paths and the associated limit laws. GASCom 2018: 69-78 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of positive lattice paths. GASCom 2018: 79-86 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Gray code for a regular language. GASCom 2018: 87-93 - Frédérique Bassino, Andrea Sportiello:
Linear-time exact sampling of sum-constrained random variables. GASCom 2018: 94-105 - Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. GASCom 2018: 106-115 - Maria Bras-Amorós:
Different tree approaches to the problem of counting numerical semigroups by genus. GASCom 2018: 7-11 - Sylvain Carrozza, Thomas Krajewski, Adrian Tanasa:
Using Grassmann calculus in combinatorics: Lindström-Gessel-Viennot lemma and Schur functions. GASCom 2018: 212-221 - Giulio Cerbai, Luca Ferrari:
Permutation patterns in genome rearrangement problems. GASCom 2018: 124-131 - Charalambos A. Charalambides:
A class of power series q-distributions. GASCom 2018: 1-6 - Julien David, Lionel Pournin, Rado Rakotonarivo:
A Markov chain for lattice polytopes. GASCom 2018: 132-139 - Henri Derycke:
Permutation statistics for a percolation model on Z2 with imposed symmetries. GASCom 2018: 140-147 - Thomas Kamalakis, Malvina Vamvakari:
q-Random walks on the integers and on the two-dimensional integer lattice. GASCom 2018: 156-165 - Dimitris J. Kavvadias, Lina Panagopoulou:
A semantic view of the switching lemma. GASCom 2018: 166-171 - Andreas Kyriakoussis, Malvina Vamvakari:
On associated q-orthogonal polynomials with a class of discrete q-distributions. GASCom 2018: 172-178 - Philippe Marchal:
The density method and permutations with a prescribed descent set. GASCom 2018: 179-186 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Non saturated polyhexes and polyiamonds. GASCom 2018: 116-123 - Ljuben R. Mutafchiev:
On the largest part size and its multiplicity of a random integer partition. GASCom 2018: 187-194 - Torsten Mütze:
On Hamilton cycles in highly symmetric graphs. GASCom 2018: 12-23 - Ahmad Sabri, Vincent Vajnovszki:
Exhaustive generation for ballot sequences in lexicographic and Gray code order. GASCom 2018: 195-201 - Xavier Gérard Viennot:
Growth diagrams and edge local rules. GASCom 2018: 202-211 - Luca Ferrari, Malvina Vamvakari:
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom 2018, Athens, Greece, June 18-20, 2018. CEUR Workshop Proceedings 2113, CEUR-WS.org 2018 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-14 13:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint