UB Paderborn / Katalog / Suche / in CDI

The Convergence of Bird Flocking

Journal of the ACM, 2014-07, Vol.61 (4), p.1-35

CHAZELLE, Bernard

2014

Volltextzugriff (PDF)

Shape distributions

ACM transactions on graphics, 2002-10, Vol.21 (4), p.807-832

2002

Volltextzugriff (PDF)

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.557-563

2006

Volltextzugriff (PDF)

A Sharp Bound on the s-Energy and Its Applications to Averaging Systems

IEEE transactions on automatic control, 2019-10, Vol.64 (10), p.4385-4390

Chazelle, Bernard

2019

Volltextzugriff (PDF)

Inertial Hegselmann-Krause Systems

IEEE transactions on automatic control, 2017-08, Vol.62 (8), p.3905-3913

2017

Volltextzugriff (PDF)

The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

SIAM journal on computing, 2009-01, Vol.39 (1), p.302-322

2009

Volltextzugriff (PDF)

A Sharp Bound on the [Formula Omitted]-Energy and Its Applications to Averaging Systems

IEEE transactions on automatic control, 2019-01, Vol.64 (10), p.4385

Chazelle, Bernard

2019

Volltextzugriff (PDF)

THE TOTAL s-ENERGY OF A MULTIAGENT SYSTEM

SIAM journal on control and optimization, 2011-01, Vol.49 (4), p.1680-1706

CHAZELLE, Bernard

2011

Volltextzugriff (PDF)

Approximating the minimum spanning tree weight in sublinear time

SIAM journal on computing, 2005, Vol.34 (6), p.1370-1379

2005

Volltextzugriff (PDF)

An Algorithmic Approach to Collective Behavior

Journal of statistical physics, 2015-02, Vol.158 (3), p.514-548

Chazelle, Bernard

2015

Volltextzugriff (PDF)

Diffusive Influence Systems

SIAM journal on computing, 2015-01, Vol.44 (5), p.1403-1442

Chazelle, Bernard

2015

Volltextzugriff (PDF)

Triangulating a simple polygon in linear time

Discrete & computational geometry, 1991-09, Vol.6 (3), p.485-524

Chazelle, Bernard

1991

Volltextzugriff (PDF)

On the Periodicity of Random Walks in Dynamic Networks

IEEE transactions on network science and engineering, 2020-07, Vol.7 (3), p.1337-1343

Chazelle, Bernard

2020

Volltextzugriff (PDF)

L’algorithmique et les sciences

Bernard Chazelle

2013

Volltextzugriff (PDF)

The Discrepancy Method: Randomness and Complexity

Chazelle, Bernard

2000

Volltextzugriff (PDF)

Some Observations on Dynamic Random Walks and Network Renormalization

Fundamentals of Computation Theory, p.18-28

Volltextzugriff (PDF)

A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM, 2000-11, Vol.47 (6), p.1028-1047

Chazelle, Bernard

2000

Volltextzugriff (PDF)

Organization of physical interactomes as uncovered by network schemas

PLoS computational biology, 2008-10, Vol.4 (10), p.e1000203-e1000203

2008

Volltextzugriff (PDF)

Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics

Journal of Differential Equations, 2017-07, Vol.263 (1), p.365-397

2017

Volltextzugriff (PDF)

Extracting Semantic Information from Dynamic Graphs of Geometric Data

Complex Networks & Their Applications X, p.474-485

Volltextzugriff (PDF)

Noisy Hegselmann-Krause Systems: Phase Transition and the 2R-Conjecture

Journal of statistical physics, 2017-03, Vol.166 (5), p.1209-1225

2017

Volltextzugriff (PDF)

PertInInt: An Integrative, Analytical Approach to Rapidly Uncover Cancer Driver Genes with Perturbed Interactions and Functionalities

Cell systems, 2020-07, Vol.11 (1), p.63-74.e7

2020

Volltextzugriff (PDF)

Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps

Bioinformatics, 2005-06, Vol.21 (suppl-1), p.i302-i310

2005

Volltextzugriff (PDF)

Algorithmic Renormalization for Network Dynamics

IEEE transactions on network science and engineering, 2015-01, Vol.2 (1), p.1-16

Chazelle, Bernard

2015

Volltextzugriff (PDF)

Information theory in property testing and monotonicity testing in higher dimension

Information and computation, 2006-11, Vol.204 (11), p.1704-1717

2006

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

The Convergence of Bird Flocking

Shape distributions

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

A Sharp Bound on the s-Energy and Its Applications to Averaging Systems

Inertial Hegselmann-Krause Systems

The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

A Sharp Bound on the [Formula Omitted]-Energy and Its Applications to Averaging Systems

THE TOTAL s-ENERGY OF A MULTIAGENT SYSTEM

Approximating the minimum spanning tree weight in sublinear time

An Algorithmic Approach to Collective Behavior

Diffusive Influence Systems

Triangulating a simple polygon in linear time

On the Periodicity of Random Walks in Dynamic Networks

L’algorithmique et les sciences

The Discrepancy Method: Randomness and Complexity

Some Observations on Dynamic Random Walks and Network Renormalization

A minimum spanning tree algorithm with inverse-Ackermann type complexity

Organization of physical interactomes as uncovered by network schemas

Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics

Extracting Semantic Information from Dynamic Graphs of Geometric Data

Noisy Hegselmann-Krause Systems: Phase Transition and the 2R-Conjecture

PertInInt: An Integrative, Analytical Approach to Rapidly Uncover Cancer Driver Genes with Perturbed Interactions and Functionalities

Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps

Algorithmic Renormalization for Network Dynamics

Information theory in property testing and monotonicity testing in higher dimension

Suchergebnisse filtern