Follow
Ivan Rapaport
Title
Cited by
Cited by
Year
Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
F Becker, I Rapaport, E Rémila
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006
502006
Predicting the behaviour of proteins in hydrophobic interaction chromatography: 1: Using the hydrophobic imbalance (HI) to describe their surface amino acid distribution
JC Salgado, I Rapaport, JA Asenjo
Journal of Chromatography A 1107 (1-2), 110-119, 2006
462006
Inducing an order on cellular automata by a grouping operation
J Mazoyer, I Rapaport
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science …, 2005
442005
Who wins Domineering on rectangular boards?
M Lachmann, C Moore, I Rapaport
arXiv preprint math/0006066, 2000
432000
Prediction of retention times of proteins in hydrophobic interaction chromatography using only their amino acid composition
JC Salgado, I Rapaport, JA Asenjo
Journal of Chromatography A 1098 (1-2), 44-54, 2005
412005
Communication complexity and intrinsic universality in cellular automata
E Goles, PE Meunier, I Rapaport, G Theyssier
Theoretical Computer Science 412 (1-2), 2-21, 2011
402011
Is it possible to predict the average surface hydrophobicity of a protein using only its amino acid composition?
JC Salgado, I Rapaport, JA Asenjo
Journal of Chromatography A 1075 (1-2), 133-143, 2005
392005
New approaches for predicting protein retention time in hydrophobic interaction chromatography
ME Lienqueo, A Mahn, G Navarro, JC Salgado, T Perez‐Acle, I Rapaport, ...
Journal of Molecular Recognition: An Interdisciplinary Journal 19 (4), 260-269, 2006
382006
Three notes on distributed property testing
G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ...
31st International Symposium on Distributed Computing (DISC 2017), 2017
362017
Adding a referee to an interconnection network: What can (not) be computed in one round
F Becker, M Matamala, N Nisse, I Rapaport, K Suchan, I Todinca
2011 IEEE International Parallel & Distributed Processing Symposium, 508-514, 2011
362011
Cellular automata and communication complexity
C Dürr, I Rapaport, G Theyssier
Theoretical Computer Science 322 (2), 355-368, 2004
342004
Distributed testing of excluded subgraphs
P Fraigniaud, I Rapaport, V Salo, I Todinca
Distributed Computing: 30th International Symposium, DISC 2016, Paris …, 2016
322016
Predicting the behaviour of proteins in hydrophobic interaction chromatography: 2. Using a statistical description of their surface amino acid distribution
JC Salgado, I Rapaport, JA Asenjo
Journal of Chromatography A 1107 (1-2), 120-129, 2006
302006
AT-free graphs: linear bounds for the oriented diameter
FV Fomin, M Matamala, E Prisner, I Rapaport
Discrete applied mathematics 141 (1-3), 135-148, 2004
272004
Complexity of approximating the oriented diameter of chordal graphs
FV Fomin, M Matamala, I Rapaport
Journal of Graph Theory 45 (4), 255-269, 2004
252004
The simultaneous number-in-hand communication model for networks: Private coins, public coins and determinism
F Becker, P Montealegre, I Rapaport, I Todinca
Structural Information and Communication Complexity: 21st International …, 2014
242014
Allowing each node to communicate only once in a distributed system: shared whiteboard models
F Becker, A Kosowski, N Nisse, I Rapaport, K Suchan
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
242012
Modeling heterocyst pattern formation in cyanobacteria
ZP Gerdtzen, JC Salgado, A Osses, JA Asenjo, I Rapaport, BA Andrews
BMC bioinformatics 10 (6), 1-13, 2009
232009
Compact distributed certification of planar graphs
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
222020
Small alliances in graphs
R Carvajal, M Matamala, I Rapaport, N Schabanel
Mathematical Foundations of Computer Science 2007: 32nd International …, 2007
212007
The system can't perform the operation now. Try again later.
Articles 1–20