Konstantinos Panagiotou

From MaRDI portal
Person:695986

Available identifiers

zbMath Open panagiotou.konstantinos-dMaRDI QIDQ695986

List of research outcomes





PublicationDate of PublicationType
Asymptotic enumeration and limit laws for multisets: the subexponential case2024-04-12Paper
The effect of iterativity on adversarial opinion forming2024-03-13Paper
Bootstrap percolation in inhomogeneous random graphs2024-02-20Paper
Exact-Size Sampling of Enriched Trees in Linear Time2023-10-26Paper
Weighted online search2023-08-21Paper
Colouring random graphs: Tame colourings2023-06-12Paper
Dispersion on the Complete Graph2023-06-04Paper
Asymptotics for pull on the complete graph2023-04-24Paper
Asymptotics for push on the complete graph2022-10-13Paper
Cluster Statistics in Expansive Combinatorial Structures2022-08-01Paper
Mutual Information, Information-Theoretic Thresholds and the Condensation Phenomenon at Positive Temperature2022-07-22Paper
https://portal.mardi4nfdi.de/entity/Q50912512022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50757742022-05-11Paper
Expansive Multisets: Asymptotic Enumeration2022-03-29Paper
Suffocating Fire Sales2022-02-15Paper
Asymptotics for Pull on the Complete Graph2021-10-18Paper
Robustness of randomized rumour spreading2021-06-15Paper
Asymptotics for push on the complete graph2021-06-04Paper
An integrated model for fire sales and default contagion2021-05-05Paper
FINANCIAL CONTAGION IN A STOCHASTIC BLOCK MODEL2021-03-16Paper
Load Thresholds for Cuckoo Hashing with Double Hashing2020-08-25Paper
Inference and mutual information on random factor graphs2020-07-15Paper
The Chromatic Number of Dense Random Block Graphs2020-07-15Paper
On the probability of nonexistence in binomial subsets2020-05-29Paper
Bootstrap percolation with inhibition2020-02-14Paper
Managing Default Contagion in Inhomogeneous Financial Networks2019-11-22Paper
Asymptotic Enumeration of Graph Classes with Many Components2019-09-18Paper
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps2019-09-17Paper
Bootstrap percolation in directed inhomogeneous random graphs2019-08-05Paper
https://portal.mardi4nfdi.de/entity/Q57433992019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57435062019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338522019-05-06Paper
Asymptotically optimal amplifiers for the Moran process2019-01-10Paper
Satisfiability Thresholds for Regular Occupation Problems2018-11-02Paper
Maximizing the Minimum Load for Random Processing Times2018-10-30Paper
https://portal.mardi4nfdi.de/entity/Q31766122018-07-23Paper
Scaling limits of random Pólya trees2018-04-10Paper
https://portal.mardi4nfdi.de/entity/Q46080622018-03-15Paper
Efficient sampling methods for discrete distributions2017-10-10Paper
The Multiple-Orientability Thresholds for Random Hypergraphs2017-10-10Paper
Asynchronous rumor spreading on random graphs2017-10-09Paper
Randomized Rumour Spreading: The Effect of the Network Topology2017-10-04Paper
The Multiple-orientability Thresholds for Random Hypergraphs2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651102017-09-29Paper
Random graphs from restricted classes2017-07-24Paper
Connectivity thresholds for bounded size rules2016-12-09Paper
Scaling limits of random graphs from subcritical classes2016-11-16Paper
Scaling limits of random graphs from subcritical classes: extended abstract2016-05-04Paper
The asymptotic \(k\)-SAT threshold2015-12-23Paper
Faster rumor spreading with multiple calls2015-02-19Paper
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs2015-02-03Paper
On the connectivity threshold of Achlioptas processes2014-12-22Paper
https://portal.mardi4nfdi.de/entity/Q29346292014-12-18Paper
On adequate performance measures for paging2014-11-25Paper
The maximum degree of random planar graphs2014-11-18Paper
Maximal biconnected subgraphs of random planar graphs2014-11-18Paper
Biased Boltzmann samplers and generation of extended linear languages with shuffle2014-09-29Paper
Going after the k-SAT threshold2014-08-07Paper
Internal DLA: Efficient Simulation of a Physical Growth Model2014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q54199872014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54200022014-06-11Paper
Multi-target ray searching problems2014-06-06Paper
https://portal.mardi4nfdi.de/entity/Q54177202014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176802014-05-22Paper
Catching the k-NAESAT threshold2014-05-13Paper
On the Insertion Time of Cuckoo Hashing2014-04-11Paper
Asynchronous rumor spreading on random graphs2014-01-14Paper
Faster Rumor Spreading with Multiple Calls2014-01-14Paper
A central limit theorem for the number of degree-\(k\) vertices in random maps2013-11-11Paper
Explosive percolation in Erdős-Rényi-like random graph processes2013-11-01Paper
Vertices of degree \(k\) in random unlabeled trees2013-10-10Paper
Rumor spreading on random regular graphs and expanders2013-10-09Paper
Efficient Sampling Methods for Discrete Distributions2013-08-12Paper
On the connectivity of random graphs from addable classes2013-04-17Paper
Explosive Percolation in Erdős–Rényi-Like Random Graph Processes2013-01-21Paper
A direct method to predict cyclic steady states of elastoplastic structures2012-12-17Paper
Random Hyperbolic Graphs: Degree Sequence and Clustering2012-11-01Paper
Sharp load thresholds for cuckoo hashing2012-10-31Paper
Extremal subgraphs of random graphs2012-10-26Paper
Vertices of degree k in random unlabeled trees2012-02-08Paper
On properties of random dissections and triangulations2011-12-19Paper
Approximate Counting of Cycles in Streams2011-09-16Paper
Multi-target Ray Searching Problems2011-08-12Paper
3-Connected Cores In Random Planar Graphs2011-05-11Paper
Rumor Spreading on Random Regular Graphs and Expanders2010-09-10Paper
Orientability of Random Hypergraphs and the Power of Multiple Choices2010-09-07Paper
https://portal.mardi4nfdi.de/entity/Q35794682010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35767612010-08-02Paper
The Degree Sequence of Random Graphs from Subcritical Classes2010-04-22Paper
Tight bounds for quasirandom rumor spreading2010-03-26Paper
Optimal algorithms for \(k\)-search with application in option pricing2009-08-27Paper
A note on the chromatic number of a dense random graph2009-06-23Paper
The Speed of Broadcasting in Random Networks: Density Does Not Matter2009-04-30Paper
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs2008-11-27Paper
On the chromatic number of random graphs2008-10-07Paper
Optimal Algorithms for k-Search with Application in Option Pricing2008-09-25Paper
On the Chromatic Number of Random Graphs2007-11-28Paper
Limit Laws for Critical Dispersion on Complete GraphsN/APaper

Research outcomes over time

This page was built for person: Konstantinos Panagiotou