Raphaël Clifford
University of Bristol, UK
http://www.cs.bris.ac.uk/~clifford/
https://orcid.org/0000-0003-0599-0915
Raphaël Clifford
Pawel Gawrychowski
Tomasz Kociumaka
Daniel P. Martin 0001
Przemyslaw Uznanski
The Dynamic k-Mismatch Problem.
18:1-18:15
2022
CPM
https://doi.org/10.4230/LIPIcs.CPM.2022.18
conf/cpm/2022
db/conf/cpm/cpm2022.html#CliffordGK0U22
Raphaël Clifford
Pawel Gawrychowski
Tomasz Kociumaka
Daniel P. Martin 0001
Przemyslaw Uznanski
The Dynamic k-Mismatch Problem.
2021
abs/2105.06166
CoRR
https://arxiv.org/abs/2105.06166
db/journals/corr/corr2105.html#abs-2105-06166
Adam Leon Smith
Raphaël Clifford
Quality Characteristics of Artificially Intelligent Systems.
1-6
2020
IWESQ@APSEC
https://ceur-ws.org/Vol-2800/paper-01.pdf
conf/apsec/2020iwesq
db/conf/apsec/iwesq2020.html#SmithC20
Peter Clifford
Raphaël Clifford
Faster classical Boson Sampling.
2020
abs/2005.04214
CoRR
https://arxiv.org/abs/2005.04214
db/journals/corr/corr2005.html#abs-2005-04214
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Time Bounds for Streaming Problems.
1-31
2019
15
Theory Comput.
https://doi.org/10.4086/toc.2019.v015a002
db/journals/toc/toc15.html#CliffordJS19
Raphaël Clifford
Pawel Gawrychowski
Tomasz Kociumaka
Daniel P. Martin 0001
Przemyslaw Uznanski
RLE Edit Distance in Near Optimal Time.
66:1-66:13
2019
MFCS
https://doi.org/10.4230/LIPIcs.MFCS.2019.66
conf/mfcs/2019
db/conf/mfcs/mfcs2019.html#CliffordGKMU19
Raphaël Clifford
Tomasz Kociumaka
Ely Porat
The streaming k-mismatch problem.
1106-1125
2019
SODA
https://doi.org/10.1137/1.9781611975482.68
https://dl.acm.org/citation.cfm?id=3310503
conf/soda/2019
db/conf/soda/soda2019.html#CliffordKP19
Raphaël Clifford
Pawel Gawrychowski
Tomasz Kociumaka
Daniel P. Martin 0001
Przemyslaw Uznanski
RLE edit distance in near optimal time.
2019
abs/1905.01254
CoRR
http://arxiv.org/abs/1905.01254
db/journals/corr/corr1905.html#abs-1905-01254
Peter Clifford
Raphaël Clifford
The Classical Complexity of Boson Sampling.
146-155
2018
SODA
https://doi.org/10.1137/1.9781611975031.10
conf/soda/2018
db/conf/soda/soda2018.html#CliffordC18
Raphaël Clifford
Allan Grønlund
Kasper Green Larsen
Tatiana Starikovskaya
Upper and Lower Bounds for Dynamic Data Structures on Strings.
22:1-22:14
2018
STACS
https://doi.org/10.4230/LIPIcs.STACS.2018.22
conf/stacs/2018
db/conf/stacs/stacs2018.html#CliffordGLS18
Raphaël Clifford
Allan Grønlund
Kasper Green Larsen
Tatiana Starikovskaya
Upper and lower bounds for dynamic data structures on strings.
2018
abs/1802.06545
CoRR
http://arxiv.org/abs/1802.06545
db/journals/corr/corr1802.html#abs-1802-06545
Peter Clifford
Raphaël Clifford
The Classical Complexity of Boson Sampling.
2017
abs/1706.01260
CoRR
http://arxiv.org/abs/1706.01260
db/journals/corr/corr1706.html#CliffordC17
Raphaël Clifford
Tomasz Kociumaka
Ely Porat
The streaming k-mismatch problem.
2017
abs/1708.05223
CoRR
http://arxiv.org/abs/1708.05223
db/journals/corr/corr1708.html#abs-1708-05223
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Cell-Probe Lower Bounds for Bit Stream Computation.
31:1-31:15
2016
ESA
https://doi.org/10.4230/LIPIcs.ESA.2016.31
conf/esa/2016
db/conf/esa/esa2016.html#CliffordJS16
Raphaël Clifford
Tatiana Starikovskaya
Approximate Hamming Distance in a Stream.
20:1-20:14
2016
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2016.20
conf/icalp/2016
db/conf/icalp/icalp2016.html#CliffordS16
Raphaël Clifford
Allyx Fontaine
Ely Porat
Benjamin Sach
Tatiana Starikovskaya
The k-mismatch problem revisited.
2039-2052
2016
SODA
https://doi.org/10.1137/1.9781611974331.ch142
http://dl.acm.org/citation.cfm?id=2884577
conf/soda/2016
db/conf/soda/soda2016.html#CliffordFPSS16
Raphaël Clifford
Allyx Fontaine
Tatiana Starikovskaya
Hjalte Wedel Vildhøj
Dynamic and Approximate Pattern Matching in 2D.
133-144
2016
SPIRE
https://doi.org/10.1007/978-3-319-46049-9_13
conf/spire/2016
db/conf/spire/spire2016.html#CliffordFSV16
Raphaël Clifford
Tatiana Starikovskaya
Approximate Hamming distance in a stream.
2016
abs/1602.07241
CoRR
http://arxiv.org/abs/1602.07241
db/journals/corr/corr1602.html#CliffordS16
Raphaël Clifford
Allyx Fontaine
Ely Porat
Benjamin Sach
Tatiana Starikovskaya
Dictionary Matching in a Stream.
361-372
2015
ESA
https://doi.org/10.1007/978-3-662-48350-3_31
conf/esa/2015
db/conf/esa/esa2015.html#CliffordFPSS15
Raphaël Clifford
Allan Grønlund
Kasper Green Larsen
New Unconditional Hardness Results for Dynamic and Online Problems.
1089-1107
2015
FOCS
https://doi.org/10.1109/FOCS.2015.71
https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.71
conf/focs/2015
db/conf/focs/focs2015.html#CliffordGL15
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Cell-probe bounds for online edit distance and other pattern matching problems.
552-561
2015
SODA
https://doi.org/10.1137/1.9781611973730.37
conf/soda/2015
db/conf/soda/soda2015.html#CliffordJS15
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
The complexity of computation in bit streams.
2015
abs/1504.00834
CoRR
http://arxiv.org/abs/1504.00834
db/journals/corr/corr1504.html#CliffordJS15
Raphaël Clifford
Allan Grønlund Jørgensen
Kasper Green Larsen
New Unconditional Hardness Results for Dynamic and Online Problems.
2015
abs/1504.01836
CoRR
http://arxiv.org/abs/1504.01836
db/journals/corr/corr1504.html#CliffordJL15
Raphaël Clifford
Allyx Fontaine
Ely Porat
Benjamin Sach
Tatiana Starikovskaya
Dictionary matching in a stream.
2015
abs/1504.06242
CoRR
http://arxiv.org/abs/1504.06242
db/journals/corr/corr1504.html#CliffordFPSS15
Raphaël Clifford
Allyx Fontaine
Ely Porat
Benjamin Sach
Tatiana Starikovskaya
The k-mismatch problem revisited.
2015
abs/1508.00731
CoRR
http://arxiv.org/abs/1508.00731
db/journals/corr/corr1508.html#CliffordFPSS15a
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems.
2014
abs/1407.6559
CoRR
http://arxiv.org/abs/1407.6559
db/journals/corr/corr1407.html#CliffordJS14
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Time Bounds for Streaming Problems.
2014
abs/1412.6935
CoRR
http://arxiv.org/abs/1412.6935
db/journals/corr/corr1412.html#CliffordJS14a
Ayelet Butman
Peter Clifford
Raphaël Clifford
Markus Jalsenius
Noa Lewenstein
Benny Porat
Ely Porat
Benjamin Sach
Pattern Matching under Polynomial Transformation.
611-633
2013
42
SIAM J. Comput.
2
https://doi.org/10.1137/110853327
db/journals/siamcomp/siamcomp42.html#ButmanCCJLPPS13
Raphaël Clifford
Markus Jalsenius
Ely Porat
Benjamin Sach
Space lower bounds for online pattern matching.
68-74
2013
483
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2012.06.012
db/journals/tcs/tcs483.html#CliffordJPS13
Paul Beame
Raphaël Clifford
Widad Machmouchi
Element Distinctness, Frequency Moments, and Sliding Windows.
290-299
2013
FOCS
https://doi.org/10.1109/FOCS.2013.39
https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.39
conf/focs/2013
db/conf/focs/focs2013.html#BeameCM13
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation.
664-674
2013
SODA
https://doi.org/10.1137/1.9781611973105.48
conf/soda/2013
db/conf/soda/soda2013.html#CliffordJS13
Paul Beame
Raphaël Clifford
Widad Machmouchi
Element Distinctness, Frequency Moments, and Sliding Windows.
2013
CoRR
http://arxiv.org/abs/1309.3690
abs/1309.3690
db/journals/corr/corr1309.html#BeameCM13
Paul Beame
Raphaël Clifford
Widad Machmouchi
Element Distinctness, Frequency Moments, and Sliding Windows.
TR13-127
2013
TR13
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2013/127
db/journals/eccc/eccc20.html#BeameCM13
Raphaël Clifford
Klim Efremenko
Benny Porat
Ely Porat
Amir Rothschild
Mismatch sampling.
112-118
2012
214
Inf. Comput.
https://doi.org/10.1016/j.ic.2012.02.007
db/journals/iandc/iandc214.html#CliffordEPPR12
Raphaël Clifford
Markus Jalsenius
Ashley Montanaro
Benjamin Sach
The Complexity of Flood Filling Games.
72-92
2012
50
Theory Comput. Syst.
1
https://doi.org/10.1007/s00224-011-9339-2
https://www.wikidata.org/entity/Q58478282
db/journals/mst/mst50.html#CliffordJMS12
Raphaël Clifford
Markus Jalsenius
Ely Porat
Benjamin Sach
Pattern Matching in Multiple Streams.
97-109
2012
CPM
https://doi.org/10.1007/978-3-642-31265-6_8
conf/cpm/2012
db/conf/cpm/cpm2012.html#CliffordJPS12
Raphaël Clifford
Markus Jalsenius
Ely Porat
Benjamin Sach
Pattern Matching in Multiple Streams
http://arxiv.org/abs/1202.3470
2012
CoRR
abs/1202.3470
db/journals/corr/corr1202.html#abs-1202-3470
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation
http://arxiv.org/abs/1207.1885
2012
CoRR
abs/1207.1885
db/journals/corr/corr1207.html#abs-1207-1885
Paul Beame
Raphaël Clifford
Widad Machmouchi
Sliding Windows with Limited Storage
http://arxiv.org/abs/1212.4372
2012
CoRR
abs/1212.4372
db/journals/corr/corr1212.html#abs-1212-4372
Paul Beame
Raphaël Clifford
Widad Machmouchi
Sliding Windows With Limited Storage.
TR12-178
2012
TR12
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2012/178
db/journals/eccc/eccc19.html#BeameCM12
Raphaël Clifford
Klim Efremenko
Benny Porat
Ely Porat
A black box for online approximate pattern matching.
731-736
2011
209
Inf. Comput.
4
https://doi.org/10.1016/j.ic.2010.12.007
db/journals/iandc/iandc209.html#CliffordEPP11
Raphaël Clifford
Alexandru Popa 0001
Maximum subset intersection.
323-325
2011
111
Inf. Process. Lett.
7
https://doi.org/10.1016/j.ipl.2010.12.003
db/journals/ipl/ipl111.html#CliffordP11
Raphaël Clifford
Benjamin Sach
Pattern matching in pseudo real-time.
67-81
2011
9
J. Discrete Algorithms
1
https://doi.org/10.1016/j.jda.2010.09.005
db/journals/jda/jda9.html#CliffordS11
Raphaël Clifford
Markus Jalsenius
Ely Porat
Benjamin Sach
Space Lower Bounds for Online Pattern Matching.
184-196
2011
CPM
https://doi.org/10.1007/978-3-642-21458-5_17
conf/cpm/2011
db/conf/cpm/cpm2011.html#CliffordJPS11
Raphaël Clifford
Zvi Gotthilf
Moshe Lewenstein
Alexandru Popa 0001
Restricted Common Superstring and Restricted Common Supersequence.
467-478
2011
CPM
https://doi.org/10.1007/978-3-642-21458-5_39
conf/cpm/2011
db/conf/cpm/cpm2011.html#CliffordGLP11
Raphaël Clifford
Markus Jalsenius
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.
593-604
2011
ICALP (1)
https://doi.org/10.1007/978-3-642-22006-7_50
conf/icalp/2011-1
db/conf/icalp/icalp2011-1.html#CliffordJ11
Raphaël Clifford
Markus Jalsenius
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
http://arxiv.org/abs/1101.0768
2011
CoRR
abs/1101.0768
db/journals/corr/corr1101.html#abs-1101-0768
Raphaël Clifford
Markus Jalsenius
Ely Porat
Benjamin Sach
Space Lower Bounds for Online Pattern Matching
http://arxiv.org/abs/1106.4412
2011
CoRR
abs/1106.4412
db/journals/corr/corr1106.html#abs-1106-4412
Ayelet Butman
Peter Clifford
Raphaël Clifford
Markus Jalsenius
Noa Lewenstein
Benny Porat
Ely Porat
Benjamin Sach
Pattern Matching under Polynomial Transformation
http://arxiv.org/abs/1109.1494
2011
CoRR
abs/1109.1494
db/journals/corr/corr1109.html#abs-1109-1494
Raphaël Clifford
Markus Jalsenius
Benjamin Sach
Streaming Pattern Matching with Relabelling
http://arxiv.org/abs/1109.5269
2011
CoRR
abs/1109.5269
db/journals/corr/corr1109.html#abs-1109-5269
Raphaël Clifford
Benjamin Sach
Permuted function matching.
1012-1015
2010
110
Inf. Process. Lett.
22
https://doi.org/10.1016/j.ipl.2010.08.017
db/journals/ipl/ipl110.html#CliffordS10
Raphaël Clifford
Ely Porat
A filtering algorithm for k-mismatch with don't cares.
1021-1025
2010
110
Inf. Process. Lett.
22
https://doi.org/10.1016/j.ipl.2010.08.012
db/journals/ipl/ipl110.html#CliffordP10
Raphaël Clifford
Klim Efremenko
Ely Porat
Amir Rothschild
Pattern matching with don't cares and few errors.
115-124
2010
76
J. Comput. Syst. Sci.
2
https://doi.org/10.1016/j.jcss.2009.06.002
db/journals/jcss/jcss76.html#CliffordEPR10
Raphaël Clifford
Benjamin Sach
Pseudo-realtime Pattern Matching: Closing the Gap.
101-111
2010
CPM
https://doi.org/10.1007/978-3-642-13509-5_10
conf/cpm/2010
db/conf/cpm/cpm2010.html#CliffordS10
David Arthur
Raphaël Clifford
Markus Jalsenius
Ashley Montanaro
Benjamin Sach
The Complexity of Flood Filling Games.
307-318
2010
FUN
https://doi.org/10.1007/978-3-642-13122-6_30
conf/fun/2010
db/conf/fun/fun2010.html#ArthurCJMS10
Raphaël Clifford
Alexandru Popa 0001
(In)approximability Results for Pattern Matching Problems.
52-62
2010
Stringology
http://www.stringology.org/event/2010/p05.html
conf/stringology/2010
db/conf/stringology/stringology2010.html#CliffordP10
David Arthur
Raphaël Clifford
Markus Jalsenius
Ashley Montanaro
Benjamin Sach
The Complexity of Flood Filling Games
http://arxiv.org/abs/1001.4420
2010
CoRR
abs/1001.4420
db/journals/corr/corr1001.html#abs-1001-4420
Raphaël Clifford
Zvi Gotthilf
Moshe Lewenstein
Alexandru Popa 0001
Permuted Common Supersequence
http://arxiv.org/abs/1004.0424
2010
CoRR
abs/1004.0424
db/journals/corr/corr1004.html#abs-1004-0424
Raphaël Clifford
Benjamin Sach
Online Approximate Matching with Non-local Distances.
142-153
2009
CPM
https://doi.org/10.1007/978-3-642-02441-2_13
conf/cpm/2009
db/conf/cpm/cpm2009.html#CliffordS09
Raphaël Clifford
Klim Efremenko
Ely Porat
Amir Rothschild
From coding theory to efficient pattern matching.
778-784
2009
SODA
https://doi.org/10.1137/1.9781611973068.85
http://dl.acm.org/citation.cfm?id=1496770.1496855
conf/soda/2009
db/conf/soda/soda2009.html#CliffordEPR09
Raphaël Clifford
Aram W. Harrow
Alexandru Popa 0001
Benjamin Sach
Generalised Matching.
295-301
2009
SPIRE
https://doi.org/10.1007/978-3-642-03784-9_29
conf/spire/2009
db/conf/spire/spire2009.html#CliffordHPS09
Raphaël Clifford
Klim Efremenko
Ely Porat
Amir Rothschild
Pattern matching with don't cares and few errors.
2009
Search Methodologies
http://drops.dagstuhl.de/opus/volltexte/2009/2244/
conf/dagstuhl/2009P9281
db/conf/dagstuhl/P9281.html#CliffordEPR09
Michael A. Bender
Raphaël Clifford
Kostas Tsichlas
Scheduling algorithms for procrastinators.
95-104
2008
11
J. Sched.
2
https://doi.org/10.1007/s10951-007-0038-4
db/journals/scheduling/scheduling11.html#BenderCT08
Raphaël Clifford
Klim Efremenko
Benny Porat
Ely Porat
A Black Box for Online Approximate Pattern Matching.
143-151
2008
CPM
https://doi.org/10.1007/978-3-540-69068-9_15
conf/cpm/2008
db/conf/cpm/cpm2008.html#CliffordEPP08
Raphaël Clifford
Klim Efremenko
Benny Porat
Ely Porat
Amir Rothschild
Mismatch Sampling.
99-108
2008
SPIRE
https://doi.org/10.1007/978-3-540-89097-3_11
conf/spire/2008
db/conf/spire/spire2008.html#CliffordEPPR08
Benjamin Sach
Raphaël Clifford
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem
http://arxiv.org/abs/0802.1026
2008
CoRR
abs/0802.1026
db/journals/corr/corr0802.html#abs-0802-1026
Peter Clifford
Raphaël Clifford
Simple deterministic wildcard matching.
53-54
2007
101
Inf. Process. Lett.
2
https://doi.org/10.1016/j.ipl.2006.08.002
db/journals/ipl/ipl101.html#CliffordC07
Peter Clifford
Raphaël Clifford
Self-normalised Distance with Don't Cares.
63-70
2007
conf/cpm/2007
CPM
https://doi.org/10.1007/978-3-540-73437-6_9
db/conf/cpm/cpm2007.html#CliffordC07
Raphaël Clifford
Klim Efremenko
Ely Porat
Amir Rothschild
k -Mismatch with Don't Cares.
151-162
2007
conf/esa/2007
ESA
https://doi.org/10.1007/978-3-540-75520-3_15
db/conf/esa/esa2007.html#CliffordEPR07
Raphaël Clifford
Benjamin Sach
Fast Approximate Point Set Matching for Information Retrieval.
212-223
2007
conf/sofsem/2007
SOFSEM (1)
https://doi.org/10.1007/978-3-540-69507-3_17
db/conf/sofsem/sofsem2007.html#CliffordS07
Raphaël Clifford
Ely Porat
A Filtering Algorithm for k -Mismatch with Don't Cares.
130-136
2007
conf/spire/2007
SPIRE
https://doi.org/10.1007/978-3-540-75530-2_12
db/conf/spire/spire2007.html#CliffordP07
Inbok Lee
Raphaël Clifford
Sung-Ryul Kim
Algorithms on Extended (delta, gamma)-Matching.
1137-1142
2006
conf/iccsa/2006-3
ICCSA (3)
https://doi.org/10.1007/11751595_119
db/conf/iccsa/iccsa2006-3.html#LeeCK06
Raphaël Clifford
Manolis Christodoulakis
Tim Crawford
David Meredith 0001
Geraint A. Wiggins
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval.
150-155
2006
conf/ismir/2006
ISMIR
db/conf/ismir/ismir2006.html#CliffordCCMW06
Michael A. Bender
Raphaël Clifford
Kostas Tsichlas
Scheduling Algorithms for Procrastinators
http://arxiv.org/abs/cs/0606067
2006
CoRR
abs/cs/0606067
db/journals/corr/corr0606.html#abs-cs-0606067
Raphaël Clifford
Distributed suffix trees.
176-197
2005
3
J. Discrete Algorithms
2-4
https://doi.org/10.1016/j.jda.2004.08.004
db/journals/jda/jda3.html#Clifford05
Peter Clifford
Raphaël Clifford
Costas S. Iliopoulos
Faster Algorithms for delta, gamma-Matching and Related Problems.
68-78
2005
conf/cpm/2005
CPM
https://doi.org/10.1007/11496656_7
db/conf/cpm/cpm2005.html#CliffordCI05
Yoan José Pinzón Ardila
Raphaël Clifford
Manal Mohamed 0001
Necklace Swap Problem for Rhythmic Similarity Measures.
234-245
2005
conf/spire/2005
SPIRE
https://doi.org/10.1007/11575832_27
db/conf/spire/spire2005.html#ArdilaCM05
Raphaël Clifford
Costas S. Iliopoulos
Approximate string matching for music analysis.
597-603
2004
8
Soft Comput.
9
https://doi.org/10.1007/s00500-004-0384-5
db/journals/soco/soco8.html#CliffordI04
Raphaël Clifford
Marek J. Sergot
Distributed and Paged Suffix Trees for Large Genetic Databases.
70-82
2003
conf/cpm/2003
CPM
https://doi.org/10.1007/3-540-44888-8_6
db/conf/cpm/cpm2003.html#CliffordS03
Raphaël Clifford
Indexed strings for large scale genomic analysis.
2002
Imperial College London, UK
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268368
British Library, EThOS
Raphaël Clifford
Aaron J. Mackey
Disperse: a simple and efficient approach to parallel database searching.
564-565
2000
16
Bioinform.
6
db/journals/bioinformatics/bioinformatics16.html#CliffordM00
https://doi.org/10.1093/bioinformatics/16.6.564
https://www.wikidata.org/entity/Q57460839
David Arthur
Paul Beame
Michael A. Bender
Ayelet Butman
Manolis Christodoulakis
Peter Clifford
Tim Crawford
Klim Efremenko
Allyx Fontaine
Pawel Gawrychowski
Zvi Gotthilf
Aram W. Harrow
Costas S. Iliopoulos
Markus Jalsenius
Allan Grønlund JørgensenAllan Grønlund
Sung-Ryul Kim
Tomasz Kociumaka
Kasper Green Larsen
Inbok Lee
Moshe Lewenstein
Noa Lewenstein
Widad Machmouchi
Aaron J. Mackey
Daniel P. Martin 0001
David Meredith 0001
Manal Mohamed 0001
Ashley Montanaro
Yoan J. PinzónYoan José Pinzón Ardila
Alexandru Popa 0001
Benny Porat
Ely Porat
Amir Rothschild
Benjamin Sach
Marek J. Sergot
Adam Leon Smith
Tatiana Starikovskaya
Kostas Tsichlas
Przemyslaw Uznanski
Hjalte Wedel Vildhøj
Geraint A. Wiggins