Francois BACCELLI

RESUME2011

Address : Ecole Normale Superieure, 45 Rue d’Ulm 75230 Paris 05.Tel : (33) 144 32 20 52 Fax: (33) 144 32 20 15e-mail : Francois.Baccelli@ens.frwww : http://www.di.ens.fr/!baccelliBorn : December 20, 1954Nationality : FrenchThese de Doctorat d’Etat Universite de Paris-Sud. April 1983.

Positions- From sept. 1998: Directeur de Recherche INRIA at Ecole Normale Superieure, CS Department,

head of the Trec research group (Theorie des Reseaux et Communications)(http://www.di.ens.fr/!trec.html).

- From May. 2011: Co-founder and member of LINCS (Laboratory for Information, Networkingand Communication Sciences) jointly funded by INRIA, Institut Telecom and Universite Pierreet Marie Curie.

- Jan. 2010-July 2010: Visiting Fellow of the Isaac Newton Institute for Mathematical Sciences,Cambridge, UK, (http://www.newton.ac.uk).

- Aug. 2009-Jan. 2010: Visiting Miller Professor at the University of California Berkeley, USA(http://millerinstitute.berkeley.edu/) in the Wireless Foundations Center, EECS Department.

- From Sept. 2007: Honorary Professor at Heriot Watt University, Edinburgh, United Kingdom,(http://www.hw.ac.uk/home/dir/47/school-of-mathematical-and-computer-sciences)

- From 2005: Member of the French Academy of Sciences (http://www.academie-sciences.fr/)- Summer 2005: Invited professor, Stanford University (http://www.stanford.edu/)- 2004-2005: Eurandom Chair, Eurandom Institute, the Netherlands (http://www.eurandom.nl/)- 1991-2003: part time Maıtre de conference and then Professeur charge de cours at Ecole Poly-

technique, Applied Mathematics Department.- 1988-1998: Directeur de Recherche at INRIA Sophia Antipolis, head of the Mistral research group

(Computer and Network Performance Evaluation).- 1985-1988: Directeur de Recherche at INRIA Rocquencourt, Meval research group.- 1984-1985: Visiting Professor at the University of Maryland (Electrical Engineering Department),

visiting scientist at AT&T Bell Laboratories (Mathematical Center) and at Bell CommunicationsResearch (Mathematical Communications and Computer Sciences).

- 1979-1984: Charge de Recherche at INRIA Rocquencourt, Meval group.

A - Research (see the bibliography for the references)

Probability Theory. These results are published in journals like Applied Probability Journals (10),Annals of Applied Probability (4), Annals of Probability (3), Stochastic Processes and their Applications(3), etc.

- 1) Point processes: [B3,B5,J8,J12,J16,J19,J26,J31,J47,J50,J66]. The main achievements arethe development of the “stationary ergodic” framework in the books [B3,B5].

1

- 2) Stochastic geometry: Introduction of the hierarchical Voronoi model with S. Zuyev [J42,J53,J56,J60,J65]. Development of SINR stochastic geometry with B. Blaszczyszyn, which led to newclasses of coverage processes in connection with wireless network modeling: [B8,J67,C15,J89,J88].

- 3) New martingale methods: developed in collaboration with A.M. Makowski [J6,J10,J20,J30].

Stochastic Networks. His work on the matter is published in journals such as Queuing Systems(8), Performance Evaluation (5), Maths of Operations Research, and focuses primarily on:

- 1) Queuing network theory, [J26,J34,J44,J73,J80,J83]. Development of the “stationary –ergodic” framework in the book [B7] (see B1.c for this reference and the following ones) withP. Bremaud (Paris). This approach led to new methods for stochastic stability and for theasymptotics of queuing networks [J73,J46] developed with S. Foss (Edinburgh) and for perturba-tion analysis ([J31,J63]) all based on the theory of non expansive maps.

- 2) Algebraic methods for network dynamics: [B4,J28,J29,J33,J34,J36,J37,J41,C18]. De-velopment of a new algebraic theory for stochastic event graphs and free choice networks, withG. Cohen (Paris), J.P. Quadrat (Paris) and G.J. Olsder (Delft) based on the max-plus alge-bra [B4]. This framework has quite important continuations in the domain of network calculus(books of C.S. Chang in 2000 and of Le Boudec & Thiran in 2001). New asymptotic expan-sion methods which establish links with cluster expansions were also developed with V. Schmidt([J50,J52,J55,J58,J61,J68,C11]).

- 3) Network simulation: design of new simulation methods in [C20,C9], where it was shownthat the simulation of stochastic max-plus networks can be parallelized with unbounded speed-upboth in time and space. See also [C13,J38,J39].

- 4) Network inverse problems: design of active probing methods for measuring end-to-end path metrics, such as delay and loss in terms of inverse problems in queueing theory:[J99,J97,J94,J90,C35,C30].

Information Theory. His work on the matter is published in IEEE Tr. I.T., ISIT and in commu-nication sciences journals and conferences.

- 1) Error exponents: analysis of error exponents using Palm calculus and large deviation theorywith V. Anantharam (Berkeley) [C36,J102];

- 2) Network information theory: design of distributed schemes for interference channels withA. El Gamal (Stanford) and D. Tse (Berkeley) [J105];

- 3) Multihop network capacity: development of a new approach based on continuous percola-tion theory with P. Thiran and O. Dousse (EPFL, Lausanne) [J82] and on first passage percolationwith B. Blaszczyszyn and P. Muhlethaler [B8,J100,J88,C44].

Modelling of Communication Networks. This work is published in journals like IEEE Trans-actions on Networking (5), Journal of the ACM (Association for Computer Machinery) (3), IEEETransactions on Information Theory, Proceedings of the IEEE, IEEE Jsac (Journal on Selected Areasin Communications), ACM CCR (Computer Communication Review), ACM Winet (Wireless Net-works) and Monet (Mobile Networks) and in highly selective conferences such as IEEE Infocom (22),ACM Sigmetrics (3), ACM Sigcomm (2), IEEE ISIT, ACM IMC or ITC (International Teletra!cConference) (2). It focuses on:

- 1) Dynamics of congestion control protocols developed with D. Hong (Paris) and D. McDonald (Ottawa) [J76,C16,J77,C13].

- 2) Wireless networks design: main contributions on CDMA, for which distributed proto-cols for admission and congestion control were developed, and on mobile ad hoc networks; theanalysis on the transport capacity of these networks led to new Medium Access Control (MAC)and routing protocols and to a new understanding of network connectivity [J88,J82,J67]. New

2

self-organization schemes based on Gibbs samplers were proposed for the management of WiFi[C32,C33,C36,C41] and cellular networks.

B - Academic Impact

The line of research on stationary queuing networks and the book [B7] were developed at a timewhere Markovian analysis was strongly dominant. These tools are now used universally and [B7] isnow the main international reference on the matter. The tools developed within this context are nowubiquitous in applied probability journals, but also in the communication literature and in particular incommunication conferences such as IEEE Infocom, ACM Sigmetrics, Sigcomm, IMC, etc. The book[B4] initiated the algebraic theory for the dynamics of networks. This was considered as amajor breakthrough and has had a big impact on several fields of both engineering and mathematics.In particular, it strongly influenced network calculus (see e.g. the books of C.S. Chang 2000, andLe Boudec & Thiran, 2001). Jointly with S. Zuyev (Glasgow), F. Baccelli initiated the economicanalysis of wireline communication networks using classical Stochastic Geometry (primarilyhierarchical Voronoi tessellations) [J51] (91 citations). The success of this line of thought is particularlyvisible in the domain of wireless networks with several books (including [B8]), special issues, newworkshops, keynote lectures and more generally the shaping of a thriving scientific community. Themain achievement is SINR Stochastic Geometry [J88,J82,J67] in particular SINR percolationtheory [J82] (nominated for the Best Paper Award at Infocom 03). The 2009 survey paper [J93]describing the general methodology on the use of stochastic geometry for the design and analysis ofwireless networks got the best tutorial paper award of the Communication Society of IEEE for 2010.The Stochastic Geometry approach to wireless networking is currently continued by several groups inthe US, in Asia and in Europe. It is one of the components of the US DARPA IT-MANET project.

C - Industrial Impact

The line of thought on TCP [J86,J76,C16,J77,C13] has been the basis of a joint research action withAlcatel-Lucent which started in 2000, the launching of the spin-o! company N2NSoft, and variousawards including the nomination of [J76] for the IEEE Infocom’03 best paper award. The mainachievement was the participation of the design of Alcatel’s DSLAM, which was number 1 worldwide.The methodology he developed on CDMA networks is currently used by Orange. The research on adhoc networks led to a paper nominated for IEEE Infocom’03 best paper award [J82] and his researchon self-organization is pursued by/with INTEL, Thomson and lately with Alcatel-Lucent.

Main industry research grants/projects:- Research grant of Alcatel Lucent Bell Laboratories, on self optimization in cellular networks

(08–);- Research grant of Alcatel Lucent Network Strategy Group, Antwerp, on access networks

(08–09);- Research grant of Thomson Research, France, on WiFi mesh networks (06–07);- Research grant of SPRINT ATL, San Francisco, on Internet probing (04–07);- Research grants of Orange on the densification of UMTS networks (03–04); the resulting capacity

evaluation led to a tool (SERT and then UtranDim) now exploited worldwide by Orange;- Consulting for INTEL, Cambridge, on the design of WiFi mesh networks and cards (05–06);

P.I. of Operation Strategique Conjointe with Alcatel Bell, Antwerp; the main achievement wasa direct impact on the design of Alcatel’s DSLAM, a domain where Alcatel was Number 1worldwide (01–05);

- Consulting for Alcatel, Paris, on the capacity of the Skybridge satellite constellation project(00).

- P.I. of two research grants from France Telecom R&D on cost analysis of communicationnetworks (1994–2001). The proposed methods were used by France Telecom for its negotiationswith ART (Agence de Regulation des Telecommunications) on the cost of the universal service.

3

D - International Recognition

- Author or co-author of 4 books, more than 100 international journal papers, and more than 60 pa-pers in the proceedings of peer-reviewed international conferences, including 22 IEEE Infocom pa-pers. According to the citation counts of Harzing’s Publish or Perish, based on Google Scholar,January 26, 2010, the total number of citations for ‘F. Baccelli’ is 6932, with a Cites/author of2822 and a H-number of 37.

- Associate (or past) Editor for Queuing Systems (since 1993), Journal on Discrete Event DynamicalSystems (since 1990), Advances Applied Probability (since 2005), Annals of Applied Probability(1995–2002), Mathematics of Operations Research (1992–2003), Markov Processes (1994–2001).He has been on the TPC of IEEE Infocom since 2000.

- Visiting Scholar/Professor positions at several top universities (lately at Stanford, Berkeleyand Cambridge) and research centers worldwide and the prestigious Eurandom Chair. Re-ceived two IBM Academic Awards (in 2004 and in 2005) and the Marcel Neuts Prize ofthe Applied Probability Foundation of America in 2000.

E - Teaching

- Ecole Normale Superieure de la rue d’Ulm :- Course on communications networks between 1989 and 1994, in collaboration with Christian

Huitema, and since 1998.- Course on probability for computer science (with Pierre Bremaud and Jean-Francois Le Gall),

started in 2003.- DEA Algorithmique : new track on communication networks with J. Mairesse; B. Gaujal and

S. Gaubert (1999 – 2002). Since 2003, this track is part of the M2 programme of MPRI, Paris.- University Paris 6, DEA de probabilites: graduate course on queueing theory, since 1990,

in collaboration with P. Bremaud and then J. Mairesse and L. Massoulie.- Ecole Polytechnique :

- Course on the modeling of communication networks, common to the Applied Maths and theComputer Science Departments (1999-2003).

- Course on Markov Chains, Applied Maths Department, in collaboration with P. Bremaud(1995 – 1999).

- Ecole Nationale Superieure des Telecommunications, Paris : course on queueing theory(1981 – 1990).

- Universite Paris-Sud, DEA d’informatique, LRI: graduate course on the modeling of com-puter systems, (1980 – 1989).

F - Research Mentoring

Founded and directed two INRIA research groups: the Mistral research group (Computer andNetwork Performance Evaluation) at INRIA Sophia Antipolis in 1987 and the TREC researchgroup (Theory of Networks) in 1999, a joint research group of INRIA Paris and Ecole NormaleSuperieure in Paris, the top research school in France. The first group reached a size of about 5permanent members and 10 PhD students or Postdocs when he left to found the second. The latterhas 4 permanent members and 9 PhD students. The researchers of these two groups have probablybeen the European group with the largest presence and impact at IEEE Infocom over the last 10years.Supervised or co-supervised more than 30 PhD students, including:

- B. Gaujal (PhD in 1993) 882 G.S. Cites, H-number 15, Senior Researcher with INRIA, Grenoble;- J. Mairesse (1995) 682 G.S. Cites, H-number 14, Cino Del Duca Award 09 by the French

Academy of Sciences, Senior Researcher with CNRS, Paris;

4

- T. Bonald (1999) 2237 G.S. Cites, H-number 22, Professor with Telecom ParisTech, Paris;- D. Hong (2000) 431 G.S. Cites, H-number 10, CEO of the N2NSoft startup, Paris;- A. Proutieres (2003) 1421 G.S. Cites, H-num. 18, Rising Star Award from ACM Sigmetrics

in 2009, Researcher with Microsoft Cambridge;- M. Lelarge (2005) 197 G.S. Cites, H-num. 8, Researcher with INRIA Paris;- J. Reynier PhD in 2006, 97 G.S. Cites, now with Credit Suisse, London.- A. Chaintreau (2006) 1484 G.S. Cites, H-number 18, PhD Award from SPECIF (best French

PhD in Computer Science), Best paper award at ACM Mobicom 08, Assistant Professor,Columbia University, Computer Science Department;

- C. Bordenave (2006) 160 G.S. Cites, H-num. 6, Best PhD Award, Ecole Polytechnique,CNRS Toulouse.Here are some other PhD students supervised: P. Bermolen (2010), G. Carofiglio (2008), M.

Jonkheere (2007), Q. Nguyen (2007), M.A. Tran (2007), J. Reynier (2005), E. Roy (2005), F. Tournois(2002), E. Lety (2000), K. Tchoumatchenko (1999), J. Migge (1999), M. Canales (1994).

G - Part Time Scientific Duties

- Member of the scientific board of the Alcatel/Lucent–INRIA Joint Laboratory (since 08);- Chair of the Think Tank on Future Internet appointed by the French government (07-09);- Author of the report on the Future Internet for the French Ministry of Industry (09);- Part time Scientific Adviser of the head of INRIA for Communication Sciences (since 07);- Member of the NSF evaluation panel for Information Technology Research large proposals (USA,

03);- Member of the Steering Committee of the Stochastic Networks chapter of Eurandom (since 99);- Member of IFIP Working Group WG 7.3 (since 86);- Member of the Board of RNRT Reseau National de la Recherche en Telecommunications, (98-

00);- Member of the Visiting Committee of CWI, Amsterdam (99);- Chair of Groupe MAS (Modelisation Aleatoire et Statistique) of the French Chapter of SIAM

(95-99);- Scientific Adviser, Centre National d’Etudes des Telecommunications, France Telecom

(86-89).

H - National, European and International Grants/Projects

International- Co-organizer of the 6 month program entitled “Stochastic Processes and Communication Sci-

ences” at the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK (10);- Principal Investigator (P.I.) of the France-Stanford Center for a joint research project on

wireless power control with Prof. N. Bambos (06-07);- Coordinator of the INRIA-NSF project on performance evaluation, with UC Berkeley and

the universities of Maryland and of Massachusetts (88-92).European

- Partner and member of the Steering Committee of the European Network of ExcellenceEURO-NGI (started in 03, and continued as EURO-NF);

- Partner of the European project Training and Mobility of Researchers (TMR) Alapedeson the algebraic approach for performance evaluation of discrete event systems (96-01);

- Coordinator of the European project Basic Research Action (BRA) Qmips on the quanti-tative modeling of parallel systems (92-95);

- Coordinator of three European INTAS projects with the Institute for Problems of Infor-mation Transmission (IPIT, Moscow) and the University of Novosibirsk, on stochasticnetworks (96-01);

5

- Partner of the European projet ESPRIT 2 IMSE on the design of an integrated modelingsoftware environment (89-92), which led to the MODLINE simulation software.

National- Partner of the CMON project, Agence Nationale de la Recherche (ANR), on Internet probing

(09-12);- Partner of the Georges project, RNRT, on the cost of communication networks (99–02);- Member of the Steering Com. of the C3–CNRS Project on distributed systems (85-90).

I - Plenary/Keynote Lectures

- SMAI’11 (Biennale Francaise de Mathematiques Appliquees et Industrielles), Guidel, FranceMay 11 (on Information Theory);

- The Queuing Symposium, Kyoto, Japan, Jan. 11 (on Spatial Queues);- IFAC NecSys’10, Annecy, France, Sept. 10 (on Communication Network Mathematics);- ValueTools’09, Pisa, Italy, Oct. 09 (on Routing);- Journees de Probabilites de Poitiers, France, June 09 (on Stochastic Geometry);- BCS Computer Journal Lecture, Imperial College, London, Feb. 09 (on Stochastic Geome-

try);- ACM Sigmetrics, Annapolis, Maryland, USA, June 08 (on Self Optimization);- I-2010 Conference, Paris, Sept. 08 (on Future Internet);- Journees SMAI–MAS 08, Rennes, France, Aug. 08 (on Stochastic Geometry);- IEEE International Symposium on Pervasive Computing (ISWPC’08), Santorini, Greece,

May 08 (on Modeling of Wireless Networks);- Performance 07, Koln, October 07 (on opportunistic routing in wireless networks)- Maxwell Lecture, Maxwell Institute colloquium, Edinburgh, UK, June 2007 (on the analysis

of TCP split).- International Workshop on Signal Processing Advances for Wireless Communications

(SPAWC 06), Juan les Pins, France, June 2006 (on mobiles ad hoc networks).- QoSIP 05, Catania, Italy, 2005 (on HTTP tra"c analysis).- Mathematical Theory of Networks and Systems (MTNS’04), Louvain, Belgium, 2004

(lecture on network overlays).- Applied Mathematics Conference in the Memory of J.L. Lions, College de France, 2002

(lecture on interacting TCP flows).- European Mathematical Society – Diderot Forum on mathematics of communications,

EPFL, Switzerland, 2001 (lecture on non-expansive maps).- 3rd European Conference of Mathematics, Barcelona, 2000 (lecture on flow and congestion

control).- Cost–257 Final Conference, Wurzburg, Germany (lecture on cdma coverage), 2000.- Conference and Workshop on Stochastic Networks, 2000 (lecture on tcp modeling) Madison,

Wisconsin.- Informs Applied Probability 1999, Ulm, Germany (lecture on stochastic networks).- International Teletra!c Conference ITC 16, Edinburgh, UK, 1999, (lecture on stochastic

geometry for communications networks).- Conference on Decision and Control CDC 34, New Orleans, USA 1995, (lecture on discrete

event systems).- International Conference on Industrial and Applied Mathematics ICIAM’95, Ham-

burg, Germany 1995, (lecture on (max, +)-linearity).

6

- Stochastic Processes and their Applications (SPA), Technion, Israel, 1991, (keynote lec-ture on stochastic (max, +) systems).

J - Organization of International Conferences and Schools

Advanced Courses outside France:- Wireless Foundations Center, UC Berkeley, USA, Sept.–Nov. 09;- Latin-American Course on Mathematics for the Internet and New-Generation Networks, La Pe-

drera, Uruguay, 07;- 28-th Finnish Graduate School in Stochastics, Nagu, Finland, 06;- Eurandom Chair Series of Lectures, Eindhoven, the Netherlands, 04–05;- Course of the Conference on Stochastic Networks, Madison, Wisconsin, USA, 00.

Organization of International ConferencesTPC member of all IEEE Infocom Conferences since 1999 and of a large number of other interna-tional communication conferences (including ACM Sigmetrics, Euro-NF). Co-organizer of the 6month program entitled Stochastic Processes and Communication Sciences at the Isaac New-ton Institute for Mathematical Sciences, Cambridge, which consists of a series of 6 workshopsheld from Jan. to June 2010. Co-organizer of the 2008 Stochastic Network Conference, jointlywith J. Mairesse, at Ecole Normale Superieure in Paris. This was the first of this series to ever takeplace outside the US or UK. Organizer in 2007 of the first Public Conference on InformationSciences of the French Academy of Sciences. Co-founder of the yearly Spaswin InternationalWorkshop (Spatial Stochastic Modeling of Wireless Networks) in 2005 jointly with B. B#laszczyszyn.Organizer of two International Workshops on Flow and Congestion Control in 1998 and 2003at Ecole Normale Superieure.

K - Awards

- The IEEE Communications Society Best Tutorial Paper Award 2009, for the JSACpaper [J93] on the modeling of wireless networks by stochastic geometry and random graphs.

- IBM Academic Award 2004-2005, for research on multicast overlays.- Grand Prix France Telecom 2002, of the French Academy of Sciences.- Marcel Neuts Prize 2000, of the Applied Probability Foundation of America.

7

Francois BACCELLI

SELECTED BIBLIOGRAPHY

Books, Thesis

[B8] F.B. and B. BLASZCZYSZYN, “Spatial Modeling of Wireless Communications – AStochastic Geometry Approach”, Foundations and Trends in Networking, NOWPublishers, 2009.

[B7] F.B. and P. BREMAUD, “ Modelisation et simulation des reseaux de communication”Cours Ecole Polytechnique, 2003.

[B6] F.B., A. JEAN-MARIE and I. MITRANI (Ed.) “Quantitative Methods in ParallelSystems”, Basic Research Series, Springer Verlag, 1995.

[B5] F.B. and P. BREMAUD, “Elements of Queueing Theory”, Springer Verlag, Applica-tions of Mathematics, 1994. Second edition 2003.

[B4] F.B., G. COHEN, G. OLSDER and J.P. QUADRAT “Synchronization and Linearity”,Wiley, 1992.

[B3] F.B. and P. BREMAUD, “Palm probabilities and Stationary Queues”. Lecture Notesin Statistics No. 41, Springer Verlag, March 1987.

[B2] F.B., “Modeles Probabilistes de systemes informatiques distribues”. These de Doc-torat d’Etat, April 1983, Universite Paris-Sud.

[B1] F.B., “Files d’attente avec pannes et applications a la modelisation des systemes infor-matiques”. These de 3e cycle, janvier 1980, Universite Paris-Sud.

Publications in journals

[J105] F.B., A. EL GAMAL and D. TSE, “Interference Networks with Point-to-Point Codes”,to appear in the special issue of IEEE Tr. Information Theory on InterferenceNetworks, April 2011, http://arxiv.org/abs/1102.2868.

[J104] J. ANDREWS, F.B and R. GANTI, “A Tractable Approach to Cellular Network Mod-eling”, The 48th Allerton conference on communication, control and computing, 2010,under revision for IEEE Transactions on Communications.

[J103] F.B. and S. FOSS “Poisson Hail on a Hot Ground.” To appear in the Journal ofApplied Probability (J.A.P.), 2011.

[J102] V. ANANTHARAM and F.B., “Information Theoretic Capacity and Error Exponentsof Stationary Point Processes with Additive Displacement Noise”, submitted for publi-cation, Annals of Applied Probability, 2010, http://arxiv.org/abs/1012.4924.

[J101] F.B., N. BAMBOS and N. GAST, “Distributed delay-power control algorithms for band-width sharing in wireless networks”, to appear in IEEE/ACM Transactions on Net-working (ToN), 2011.

8

[J100] F.B., B. BLASZCZYSZYN and O. MIRSADEGHI, “Optimal Paths on the Space-TimeSINR Random Graph”, arXiv:0911.3721v1, to appear in Advances in Applied Prob-ability 2009. http://fr.arxiv.org/abs/0911.3721.

[J99] F.B., B. KAUFFMANN and D. VEITCH, “Towards multihop available bandwidth es-timation”, ACM SIGMETRICS Performance Evaluation Review, Vol. 37, No.2, pp. 83–84, 2009.

[J98] F.B. and T. KONSTANTOPOULOS, “Stationary flows and uniqueness of invariantmeasures”, Quart. Appl. Math., 2009.

[J97] F.B., S. MACHIRAJU, D. VEITCH and J. BOLOT, “The Role of PASTA in NetworkMeasurement”, IEEE/ACM Transactions on Networking (ToN), Vol. 17, No. 4,p.p. 1340-1353, August 2009.

[J96] F.B., B. BLASZCZYSZYN and P. MUHLETHALER, “Stochastic analysis of spatialand opportunistic Aloha”, IEEE JSAC, special issue on Stochastic Geometryand Random Graphs for Wireless Networks, Vol. 27, pp. 1105–1119, 2009.

[J95] F.B., B. BLASZCZYSZYN and P. MUHLETHALER, “Time-Space Opportunistic Rout-ing in Wireless Ad Hoc Networks, Algorithms and Performance”, the Computer jour-nal, 2009.

[J94] F.B., B. KAUFFMANN and D. VEITCH, “Inverse problems in queueing theory andInternet probing”, Queueing Systems, Vol. 63, Special Issue: 100 Years of Queueing— The Erlang Centennial, 2009.

[J93] M. HAENGGI, J. ANDREWS, F.B., O. DOUSSE and M. FRANCESCHETTI, Intro-duction of the “Special Issue on Stochastic Geometry and Random Graphs for WirelessNetworks”, IEEE Jsac, Vol. 27, 2009.

[J92] F.B., G. CAROFIGLIO and S. FOSS, “Proxy Caching in Split TCP: Dynamics, Stabil-ity and Tail Asymptotics”, Proceedings IEEE INFOCOM 2008. Journal version in“From Semantics to Computer Science, Essays in honour of Gilles Kahn”, Yves Bertot,Gerard Huet and Gordon Plotkin Ed., Cambridge University Press, 2009.

[J91] F.B., and McDONALD, D., “A Stochastic Model for the Throughput of Non-PersistentTCP Flows”, Proceedings of ValueTools 06, Pisa, October 2006, Performance Eval-uation Vol. 65, No. 6-7, pp. 512-530, June 2008.

[J90] S. MACHIRAJU, D. VEITCH, F.B. and J. BOLOT “Adding Definition to Active Prob-ing” ACM Computer Communication Review, Vol. 37, No 2, pp. 17–28, April2007.

[J89] F.B. and C. BORDENAVE, “The Radial Spanning Tree of a Poisson Point Process”,Proceedings of the 43-th Allerton Conference, 2005, Annals of Applied Probab. Vol.17, No. 1, 305-359, 2007.

[J88] F.B., P. MUHLETHALER et B. BLASZCZYSZYN, “An Aloha Protocol for MultihopMobile Wireless Networks”, Proceedings of the Allerton 03 Conference, Illinois. IEEETransactions on Information Theory. Vol. 52, No. 2, pp. 421–436, Jan. 2006.

[J87] F.B., “Les reseaux de communication” La Lettre de l’Academie, No. 19, Spring2006.

[J86] F.B., A. CHAINTREAU, D. DE VLEESCHAUWER, D. Mc DONALD, “HTTP Tur-bulence”, Networks and Heterogeneous Media (AIMS), Vol. 1 No. 1, March 2006.

9

[J85] F.B., R. CRUZ and A. NUCCI, “On Wireless Channel Parameters Maximizing TCPThroughput”, in IMA Volume 143 in Mathematics and its Applications: Wire-less Communications. P. Agrawal, M. Andrews, P.J. Fleming, G. Yin, et L. Zhang Ed.,Springer, 2006.

[J84] F.B., K.B. KIM and D. McDONALD, “Equilibria of a Class of Transport EquationsArising in Congestion Control,” Queueing Systems, Volume 55, Number 1, pp. 1–8,January, 2007.

[J83] F.B., S. FOSS, and M. LELARGE, “Tails in Generalized Jackson Networks with Subex-ponential Service Distributions,” J. Appl. Probab. 42, no. 2 513-530, 2005.

[J82] O. DOUSSE, F.B. and P. THIRAN, “Impact of Interferences on the Connectivity ofAd Hoc Networks”, Proceedings IEEE INFOCOM’03 (nomination for the best paperaward), San Francisco, 2003, IEEE Transactions on Networking, Volume 13, Num-ber 1, Feb. 2005.

[J81] F.B., A. CHAINTREAU, D. DE VLEESCHAUWER and D. Mc DONALD, “A Mean-Field Analysis of Short Lived Interacting TCP Flows”, Proceedings of ACM Sigmet-rics’04, New York, June 2004 and Performance Evaluation.

[J80] F.B., S. FOSS, and M. LELARGE, “Asymptotics of Subexponential Max Plus Networks;the Stochastic Event Graph Case, Queueing Systems, 46-1,2, 75–96, 2004.

[J79] E. LETY, T. TURLETTI, and F.B., “Cell-based Multicast Grouping in Large-ScaleVirtual Environments”, IEEE Transactions on Networking, Volume 12, Issue 2247–260, April 2004.

[J78] F.B., B. BLASZCZYSZYN, B. and M. KARRAY, “Up and Downlink Admission andCongestion Control and Maximal Load in Large Homogeneous CDMA Networks” Pro-ceedings WIOPT’03, Sophia Antipolis, ACM MONET, Vol. 9, No. 6, Dec. 2004.

[J77] F.B., D. Mc DONALD and J. REYNIER, “A Mean-field Model for Multiple TCP Con-nections Through a Bu!er Implementing RED”, Proceedings of IFIP Performance’02,Rome, sept. 2002. Performance Evaluation, 49, pp. 77-97, 2002.

[J76] F.B. and D. HONG, “Interaction of TCP flows as Billiards”, Proceedings of IEEEINFOCOM’03 (nomination for the best paper award), San Francisco, 2003, IEEETransactions on Networking Volume 13 , Issue 4 Pages: 841 - 853, August 2005.

[J75] F.B., B. BLASZCZYSZYN and F. TOURNOIS, “Spatial Averages of Coverage Charac-teristics in Large CDMA Networks”, proceedings of IEEE INFOCOM’02, NY, jun.2002, ACM WINET (Wireless Networks), 8, 2002.

[J74] F.B., “Modeliser le trafic pour mieux le gerer”, in L’explosion des mathematiques, SMF-SMAI, pp. 75-79, jul. 2002.

[J73] F.B. and S. FOSS, “Moments and Tails in Monotone-Separable Stochastic Networks”,IFAC Workshop on Max-Plus Algebras and their Applications to Discrete-event Systems,Theoretical Computer Science, and Optimization, Prague, 2001, Annals of AppliedProbability, 14-2, pp. 621-650, 2004.

[J72] F.B., D. DE VLEESSCHAUWER, D. HONG, and G. PETIT, “End to End NetworkPerformance Modeling”, Alcatel Telecommunications Review (ATR), 3, pp. 223-227, 2001.

[J71] A. CHAINTREAU, F.B. and C. DIOT, “Impact of Network Delay Variation on Multi-cast Session Performance with TCP-like Congestion Control”, proceedings IEEE IN-FOCOM’01, (nomination for the best paper award), Anchorage, IEEE Transactionson Networking (ToN), 10, pp. 500-513, 2002.

10

[J70] F.B. and D. HONG, “Slotted Jackson Networks”, submitted to Queueing Systems(QUESTA), 2001.

[J69] F.B., B. GAUJAL and D. SIMON, “Analysis of Preemptive Periodic Real Time Systemsusing the (max,plus) Algebra”, IEEE transactions on Control Systems Technol-ogy (CST), 10-3, pp. 368-380, may 2002.

[J68] A. AYHAN and F.B., “Expansions for Joint Laplace Transform of Stationary Wait-ing Times in (max,plus)-Linear Systems with Poisson Input”, Queueing Systems(QUESTA), 37, pp. 291-328, 2001.

[J67] F.B. and B. BLASZCZYSZYN, “On a Coverage Process Ranging from the BooleanModel to the Poisson-Voronoi Tessellation”, Advances in Applied Probability, 33,pp. 293-323, 2001.

[J66] F.B., A. BOROVKOV and J. MAIRESSE, “Asymptotic Results on Infinite TandemQueueing Networks”, Probability Theory and Related Fields (PRTF), 118(3),pp. 365-405, 2000.

[J65] F.B., C. GLOAGUEN and S. ZUYEV, “Superposition of Planar Voronoi Tessellations”,Stochastic Models, 16(1), 1999 (best paper award, Marcel Neuts Prize).

[J64] F.B. and D. Mc DONALD, “Rare Events for Stationary Processes”, Stochastic Pro-cesses and their Applications, 89, pp. 141-173, 2000.

[J63] F.B. and D. HONG, “Analyticity of Iterates of Random Non-Expansive Maps”, Ad-vances in Appl. Prob. 32(1), mar. 2000

[J62] F.B. and T. BONALD, “On the Stable Behaviors of Window Flow Control”, 36thIEEE Conference on Decision and Control, San Diego, USA, 1997, Queueing Sys-tems (QUESTA), 32, 195-231, 1999.

[J61] F.B., S. HASENFUSS and V. SCHMIDT, “Di!erentiability of Functionals of PointProcesses”, Stochastic Processes and their Applications, 81, 299-321, 1999.

[J60] F.B. and S. ZUYEV, “Poisson-Voronoi spanning trees with applications to the opti-mization of communication networks”, Operations Research, 47(4), 619-631, 1999.

[J59] F.B. and D. HONG, “Analytic Expansions of (max,+) Lyapunov Exponents”, Annalsof Appl. Prob., 10(2), 779–827, 2000.

[J58] F.B., S. SCHLEGEL and V. SCHMIDT, “Asymptotics of Stochastic Networks withSubexponential Service Times”, Queueing Systems (QUESTA), 33, 205–23, 1999.

[J57] R. AGRAWAL, F.B. and R. RAJAN, “An Algebra for Queueing Networks with TimeVarying Service and its Application to the Analysis of Integrated Service Networks”, toappear in Mathematics of Operations Research.

[J56] F.B., K. TCHOUMATCHENKO and S. ZUYEV, “Markov Paths on the Poisson-Delau-nay Graph with applications to routing in mobile networks”, 1998, Adv. Appl. Prob.32, 1-18, 2000.

[J55] F.B., S. HASENFUSS and V. SCHMIDT, “Expansions for Steady State Characteristicsin (max, +)-linear Systems,” Rapport INRIA No. 2785, 1996, Stochastic Models 14,1998.

[J54] F.B. and J. MAIRESSE, “Ergodic Theory of Stochastic Operators and Discrete EventNetworks”, in Idempotency, Cambridge Univ. Press, Vol. 11, pp. 171-208, J.Gunawardena Ed., 1998.

[J53] F.B. and S. ZUYEV, “Stochastic Geometry Models of Mobile Communication Net-works”, in Frontiers of Queuing Theory, Volume 2, pp. 227-244, CRC Press, 1997.

11

[J52] F.B., S. HASENFUSS and V. SCHMIDT, “Transient and Stationary Waiting Times in(max,+)-Linear Systems with Poisson Input”, Queueing Systems (QUESTA), 26,1997.

[J51] F.B., M. KLEIN, M. LEBOURGES and S. ZUYEV, “Stochastic geometry and archi-tecture of communication networks” Telecommunications Systems, 7, pp. 209–227,1997.

[J50] F.B. and V. SCHMIDT, “Taylor Series Expansions for Poisson-Driven (max,+)-linearSystems,” Annals of Applied Probability, No. 6-1, pp. 138-185, 1996.

[J49] F.B., S. FOSS and B. GAUJAL, “ Free-choice Petri Nets, an Algebraic Approach”,IEEE Tr. Aut. Contr, No. 41-12, pp. 1751-1778, 1996.

[J48] F.B., S. FOSS and J. MAIRESSE, “Jackson Networks under Stationary Ergodic As-sumptions, Results and Counter Examples”, Proceedings of the Royal StatisticalSociety on Stochastic Networks, Oxford University Press, 1996.

[J47] F.B., M. KLEIN and S. ZUYEV, “Perturbation Analysis of Functionals of RandomMeasures.” Adv. Appl. Probab., No. 27, pp. 306-325, 1995.

[J46] F.B. and S. FOSS “On the Saturation Rule for the Stability of Queues.” Journal ofApplied Probability (J.A.P.), No. 32, pp. 494-507, 1995.

[J45] F.B., B. GAUJAL, A. JEAN-MARIE et J. MAIRESSE, “Analysis of Parallel Process-ing Systems via the (max,+) Algebra”, in Quantitative Models in Parallel Systems,Springer Verlag Basic Research Series, pp. 220–236, 1995.

[J44] F.B., W.A. MASSEY and P. WRIGHT, “Determining the Exit Time Distribution for aClosed Cyclic Jackson Network”, Theoretical Computer Science (T.C.S.), SpecialIssue on Performance Evaluation, No 125, pp. 149–165, 1994.

[J43] F.B. and S. FOSS, “Ergodicity of Jackson-type Queueing Networks”, Queueing Sys-tems (QUESTA), No. 17, pp. 5-72, 1994.

[J42] F.B., M. KLEIN, M. LEBOURGES and S. ZUYEV, “Stochastic Geometry and Ar-chitecture of Communication Networks” Selected Proceedings of the third INFORMStelecommunications conference, et Annales des Telecommunications, 51, Vol 3-4,1996.

[J41] F.B., G. BALBO, R. BOUCHERIE, J. CAMPOS and G. CHIOLA, “Annotated Bibli-ography on Stochastic Petri Nets”, CWI Tract 105, pp. 1-24 (O.J. Boxma and G.M.Koole ed.), 1994.

[J40] F.B., Z. LIU and D. TOWSLEY, “Optimal Scheduling of Parallel Processing Systemswith Real Time Constraints”, Journal of the Association for Computer Machin-ery (J.A.C.M), No. 5, pp. 1209–1237, 1993.

[J39] F.B., G. COHEN and B. GAUJAL, “Recursive Equations and Basic properties of TimedPetri Nets”, Journal of Discrete Event Systems, No. 1, pp. 415-439, 1992.

[J38] F.B. and M. CANALES, “Parallel Simulation of Stochastic Petri Nets Using Recur-sive Equations”, ACM Transactions on Modeling and Computer Simulation(TOMACS), No. 3(1), pp. 20–41, jan. 1993.

[J37] F.B. and T. KONSTANTOPOULOS, “Estimates of Cycle Times in Stochastic PetriNets”, Proceedings du Workshop Franco-Americain sur les Probabilites Appliquees,Springer Verlag, Lectures Notes in Control and Information Sciences, No. 177,pp. 1-20, 1992

12

[J36] F.B. and Z. LIU, “Comparison Properties of Stochastic Decision Free Petri Nets”, IEEETrans. on Automatic Control, Vol. 37, pp. 1905-1920, 1992.

[J35] A. JEAN-MARIE and F.B., “Communication and Time Complexity of a DistributedElection Protocol”, Special Issue of Queuing Systems (QUESTA) sur les communi-cations, No. 9, pp. 83–111, 1991.

[J34] F.B. and A. MAKOWSKI, “Synchronization in Queueing Systems”, in the volume onStochastic Analysis of Computer and Communication Systems, pp. 57-131, H.Takagi Edit., North Holland, 1990.

[J33] F.B., N. BAMBOS, J. WALRAND, “Flow Analysis of Stochastic Marked Graphs”,Proceedings C.D.C. 89, Tampa, dec. 1989. Probability in Engineering and In-formation Sciences, No. 5 pp. 145–157, 1991.

[J32] F.B., “Stochastic Ordering of Random Processes with an Imbedded Point Process”,Journal of Applied Probability, No. 28, pp. 553–567, 1991.

[J31] F.B. and P. BREMAUD, “Virtual Customers in Sensitivity Analysis and Light Tra"cAnalysis via Campbell’s Formula for Point Processes”, Advances in Applied Prob-ability, No. 25, pp. 221–234, 1993.

[J30] F.B. and A. MAKOWSKI, “Exponential Martingales for Queues in a Random Environ-ment, the M/GI/1 Case”, Stochastic Processes and their Applications, No. 38,pp. 99-133, 1991.

[J29] T. KONSTANTOPOULOS and F.B., “On the Cutt-o! Phenomenon in some QueueingSystems”, Journal of Applied Probability., No. 28, pp. 683–694, 1991.

[J28] F.B., “Ergodic Theory of Stochastic Petri Networks”, Proceedings C.D.C. 89, Tampa,dec. 1989, The Annals of Probability, No. 20, pp. 375-396, 1992.

[J27] F.B. and D. TOWSLEY, “ The Response Times in The Processor Sharing Queue areAssociated”, Queueing Systems (QUESTA), No. 7, pp. 269-282, 1990.

[J26] F.B. and Z. LIU, “On a Class of Stochastic Evolution Equations”, The Annals ofProbability, No. 20, 1992.

[J25] D. TOWSLEY and F.B., “Comparison of Service Disciplines in a Tandem QueueingNetwork with Real Time Constraints”, Operations Research Letters, No. 10, pp.49–55, 1991.

[J24] F.B. and Z. LIU, “On the Execution of Parallel Programs on Multiprocessor Systems-A Queueing Theory Approach”, Journal of the Association for Computer Ma-chinery (J.A.C.M), Vol. 27 No. 32, pp. 373-414, apr. 1990

[J23] F.B. and Z. LIU, “Architectures et performances des systemes multiprocesseurs”, An-nales des Mines, pp. 45–48, 1991.

[J22] F.B. and Z. LIU, “Generalized Precedence Based Queueing Systems”. Actes du ColloqueC3, Angouleme, oct. 1988, Mathematics of Operations Research, No. 17, pp. 615-639, 1992.

[J21] F.B., E.G. COFFMAN and E. GILBERT, “ Tandem Conveyor Queues”, Probabilityin Engineering and Informational Sciences, Vol. 3 No. 4, pp. 517-536, 1989.

[J20] F.B. and A. MAKOWSKI, “Dynamic, Transient and Stationary Behavior of the M/GI/1Queue via Martingales”, Annals of Probability Vol. 17, No. 4, pp. 1691-1699, 1989.

[J19] F.B. and Z. LIU, “Stability Condition of a Precedence Based Queueing Discipline”,Advances in Applied Probability Vol. 21, pp. 883-898, 1988.

13

[J18] F.B. and W.A. MASSEY, ” A Sample Path Analysis of the M/M/1 Queue”, Journalof Applied Probability, Vol. 26, pp. 418-422, 1989.

[J17] F.B. and A. MAKOWSKI, “ Queueing Models for Systems With Synchronization Con-straints”, article invite, Special Issue of the Proceedings of the IEEE on discreteevent systems, Y.C. Ho Ed., Vol. 77, No. 1, pp. 138-161, jan. 1989.

[J16] F.B., W.A. MASSEY, A. TOWSLEY, ”Acyclic Fork Join Queueing Networks”, Journalof the Association for Computing Machinery (J.A.C.M.), Vol. 36, No. 3, pp.615-642, jul. 1989.

[J15] F.B., A. MAKOWSKI and A. SHWARTZ, ”The Fork Join Queue and Related Sys-tems with Synchronization Constraints : Stochastic Dominance, Approximations andComputable Bounds”, proceedings of the IFIP W-G 7.3, “Computer Networking andPerformance Evaluation” seminar, sept. 85, Tokyo (North-Holland). Advances inApplied Probability, Vol. 21, No. 3, pp. 629-660, sept. 1989.

[J14] F.B. and W.A. MASSEY, “A Transient Analysis of the Two-Node Series Jackson Net-work”. Rapport INRIA No. 852, jun. 1988, a paraıtre dans Mathematics of Opera-tions Research.

[J13] F.B. and A. MAKOWSKI, “Multi-dimensional Stochastic Ordering and Associated Ran-dom Variables”. Operations Research, Vol. 37, No. 3, pp. 478-487, jun. 1989.

[J12] F.B., C. COURCOUBETIS and M. REIMAN, “Construction of the Stationary Regimeof Queues with Locking”, Stochastic Processes and their Applications, Vol. 26,pp. 257,265, 1987.

[J11] F.B. and G. FAYOLLE, “Analysis of Models Reducible to a Class of Di!usion Processesin the Positive Quarter Plane”. SIAM Journal on Applied Math., Vol. 47 No. 6,pp. 1367-1385, dec. 1987.

[J10] F.B., “Exponential Martingales and Wald’s Formulas for Two Queue Networks”, the“Third ORSA/TIMS Special Interest Conference on Applied Probability”, Williams-burg, Virginia, jan. 1985, and Journal of Applied Probability No. 23, pp. 812-919,sept. 1986.

[J9] F.B. and Ph. MUSSI, “A Parallel Interpreter for Arithmetic Expressions and its Eval-uation”.Presented at Parallel Computing 84, Berlin. IEEE Transactions on Com-puters, Vol. C35 No. 3, pp. 245-256, mar. 1986.

[J8] F.B. and A. MAKOWSKI, “Queues in Random Environment : Stability and Bounds”,Stochastic Models, Vol. 2, No. 2, M. Dekker, 1986.

[J7] F.B. and K.S. TRIVEDI, “A Single Server Queue in a Hard Real Time Environment”,Operations Research Letters, Vol. 4, No. 4, pp. 161-168, dec. 1985.

[J6] F.B. and A. MAKOWSKI, “Direct Martingale Arguments for Stability : The M/G/1Case”. apr. 1985. Systems & Control Letters No. 6, pp. 181-186, North Holland,aug. 1985.

[J5] F.B., P. BOYER and G. HEBUTERNE, “Single Server Queues with Impatient Cus-tomers”, Advances in Applied Probability No. 16, pp. 887-905, dec. 1984.

[J4] F.B., E. GELENBE and B. PLATEAU, “An End to End Approach to the ResequencingProblem”, Journal of the Association for Computing Machinery, (J.A.C.M.)Vol. 31, No. 3, pp. 474-485, jul. 1984.

[J3] F.B. and E.G. COFFMAN, “A Data Base Replication Analysis Using an M/M/m Queuewith Service Interruptions”. Performance Evaluation Review No. 11, 4, pp. 102-107, 1982.

14

[J2] F.B. and T. FLEURY, “Parsing Arithmetic Expressions in a Multiprocessing Environ-ment”. Acta Informatica No. 17, pp. 287-310, Springer Verlag, 1982.

[J1] F.B., “Analysis of a Service Facility with Periodic Checkpointing”, Acta InformaticaNo. 15, pp. 67-81, 1981.

Publications in International Conferences, not published in journals

[C46] F.B., J. LI , T. RICHARDSON, S. SHAKKOTTAI, S. SUBRAMANIAN and X. WU“On Optimizing CSMA for Wide Area Ad-hoc Networks”, Proceedings of WIOPT–SPASWIN’11, Princeton, April 2011.

[C45] F.B. and J. BOLOT, “Modeling the Economic Value of the Location Data of MobileUsers”, Proceedings of IEEE INFOCOM 2011, Shanghai, April 2011.

[C44] F.B. and B. BLASZCZYSZYN, “A New Phase Transition for Local Delays in MANETs”,Proceedings of IEEE INFOCOM 2010, San Diego, March 2010.

[C43] F. MORLOT, F.B. and S. ELAYOUBI, “An Interaction-Based Mobility Model for Dy-namic Hot Spot Analysis”, Proceedings of IEEE INFOCOM 2010, San Diego, March2010.

[C42] H. ZANG, F.B. and J. BOLOT, “Bayesian Inference for Localization in Cellular Net-works”, Proceedings of IEEE INFOCOM 2010, San Diego, March 2010.

[C41] T.V. NGUYEN and F.B., “A Probabilistic Model of Carrier Sensing Based CognitiveRadio”, Proceedings of IEEE Symposium Dynamic Spectrum Access Networks,DYSPAN’10, Singapore, Apr. 2010.

[C40] C.S. CHEN and F.B., “Self-Optimization in Mobile Cellular Networks: Power Controland User Association”, Proceedings IEEE ICC’10, Cape Town, South Africa, May2010.

[C39] F.B., G. Carofiglio and M. Piancino, “On Scalable TCP”, Proceedings of IEEE IN-FOCOM’09, Rio de Janeiro, Brazil 2009.

[C38] F.B., B. BLASZCZYSZYN and P. MUHLETHALER, “On the performance of time-space opportunistic routing in multihop Mobile Ad Hoc Networks”, Proceedings ofIEEE WiOpt, Berlin, April 2008.

[C37] F.B., B. BLASZCZYSZYN, E. ERMEL and P. MUHLETHALER, “An optimized relayself selection technique for opportunistic routing in mobile ad hoc networks”, Proceed-ings of the IEEE European Wireless Conference, Prague, June 2008.

[C36] V. ANANTHARAM and F.B., “A Palm theory approach to error exponents”, Proceed-ings of IEEE Symposium on Information Theory, Toronto, Canada, July 2008.

[C35] F.B., S. MACHIRAJU, D. VEITCH and J. BOLOT, “On Optimal Probing for Delay andLoss Measurement”, Proceedings 2007 ACM SIGCOMM Internet MeasurementConference, San Diego, California, Pages 291–302, October 2007.

[C34] H.Q. NGUYEN, F.B. and D. KOFMAN, “A Stochastic Geometry Analysis of DenseIEEE 802.11 Networks” Proceedings IEEE INFOCOM’07, Anchorage, Page(s): 1199- 1207 May 2007.

15

[C33] V. MHATRE, K. PAPAGIANNAKI and F.B., “Interference Mitigation Through PowerControl in High Density 802.11 WLANs Proceedings IEEE INFOCOM’07, Anchor-age, Page(s): 535 - 543 May 2007.

[C32] B. KAUFFMANN, F.B., A. CHAINTREAU, V. MHATRE, K. PAPAGIANNAKI andC. DIOT, “Measurement-Based Self Organization of Interfering 802.11 Wireless AccessNetworks” Proceedings IEEE INFOCOM’07, Anchorage, Page(s):1451 - 1459, May2007.

[C31] F.B. and McDONALD, D., “Mellin Transforms for TCP Throughput with Applicationsto Cross Layer Optimization”, Proceedings of CISS’06, Princeton University, March2006.

[C30] F.B., S. MACHIRAJU, D. VEITCH and J. BOLOT “The Role of PASTA in NetworkMeasurement” Proceedings of ACM SIGCOMM’06, Pisa, October 2006.

[C29] F.B., N. BAMBOS et C. CHAN. “Optimal Throughput and Routing for Wireless LinkArrays”. Proceedings of IEEE INFOCOM’06, Barcelona, March 2006.

[C28] S. MACHIRAJU, D. VEITCH, F.B., A. NUCCI and J. BOLOT, “Theory and Practiceof Cross-Tra"c Estimation”, Proceedings of ACM SIGMETRICS’05, Ban!, Canada,June 2005.

[C27] F.B., K.B. KIM and D. DE VLEESCHAUWER, “Analysis of the Competition betweenWired, DSL and Wireless Users in an Access Network”, Proceedings of IEEE INFO-COM’05 Miami, March 2005.

[C26] F.B., B. BLASZCZYSZYN et M. KARRAY, “Blocking Rates in Large CDMA Networksvia a Spatial Erlang Formula”, Proceedings of IEEE INFOCOM’05 Miami, March2005.

[C25] F.B., A. CHAINTREAU, Z. LIU, S. SAHU and A. RIABOV, “The One to Many TCPOverlays”, Proceedings of IEEE INFOCOM’05 Miami, March 2005.

[C24] F.B. and K.B. KIM, “TCP Throughput Analysis under Transmission Error and Con-gestion Losses”, Proceedings of IEEE INFOCOM’04 Hong Kong, March 2004.

[C23] D. HONG, P. POPPE, J. REYNIER, F.B., G. PETIT, “The Impact of Burstification onTCP Throughput in Optical Burst Switching Networks, Proceedings of ITC’03, Berlin,Sept. 03.

[C22] F.B., A. CHAINTREAU and Z. LIU, “An Analysis of Overlay Multicast Communicationvia First Passage Percolation”, Proceedings of MTNS’04, Louvain, Belgium, July 04.

[C21] F.B., A. CHAINTREAU, Z. LIU, S. SAHU and A. RIABOV, “Scalability of ReliableGroup Communication Using Overlays”, Proceedings of IEEE INFOCOM’04 HongKong, March 2004.

[C20] F.B. and D. HONG, “Flow Level Simulation of Large IP Networks”, Proceedings ofIEEE INFOCOM’03 San Francisco, Apr. 2003.

[C19] F.B., B. BLASZCZYSZYN and F. TOURNOIS, “Downlink Capacity and Admission -Congestion Control in CDMA Networks”, Proceedings of IEEE INFOCOM’03, SanFrancisco, Apr. 03.

[C18] F.B. and S. HAAR, “Counter Equations for Timed Competition Nets”. Proceedings ofthe Workshop on Max-plus Algebras and Their Applications to Discrete-event Systems,Theoretical Computer Science, and Optimization, 1st IFAC Symposium on SystemStructure and Control, aug. 2001, Prague.

16

[C17] F.B., D. HONG and Z. LIU, “Fixed Point Methods for the Simulation of a Large Numberof Interacting TCP Connections.” Proceedings of the ITC Specialists Seminar onAccess Networks and Systems, Girona, pp. 233-244, 2001.

[C16] F.B. and D. HONG, “A.I.M.D, Fairness and Fractal Scaling of TCP Tra"c”. Proceed-ings of IEEE INFOCOM’02, NY, jun. 2002.

[C15] F.B., D. KOFMAN and J.L. ROUGIER, “Self Organizing Hierarchical Multicast Treesand their Optimization”, Proceedings of IEEE INFOCOM’99, New York.

[C14] F.B. and D. HONG, “The AIMD Model for TCP Sessions Sharing a Common Router”,Proceedings of the 39th Annual Allerton Conf. on Communication, Controland Computing, Allerton Illinois, 2001.

[C13] F.B. and D. HONG, “TCP is max-plus Linear”, Proceedings of ACM SIGCOMM’00,Stockholm, Vol. 30, No. 4, pp. 219-230, sept. 2000.

[C12] F.B., S. GAUBERT and D. HONG, “Representation and Expansion of Max-Plus Lya-punov Exponents”, Proceedings of the 37th Annual Allerton Conf. on Commu-nication, Control and Computing, Allerton Illinois, 1999.

[C11] F.B., S. SCHLEGEL and V. SCHMIDT, “Asymptotics of Tandem Queues with Subex-ponential Service Times”, Proceedings of the Workshop on Stochastic Modeling ofHigh Speed Networks, Technical University, Munich, 1998.

[C10] E. ALTMAN, F.B. and J. BOLOT, “Discrete-time Analysis of Adaptive Rate Con-trol Mechanisms”, Proceedings 5th international conference on High Speed Net-works, pp. 121–140. North Holland, 1994.

[C9] F.B., N. FURMENTO and B. GAUJAL, “Parallel and Distributed Simulation of FreeChoice Petri Nets”, Proc. Ninth Workshop on Parallel and Distributed Systems, Paralleland Distributed Simulation PADS’95, Lake Placid, 1995.

[C8] F.B., “A Queueing Model of Timestamp Ordering in a Distributed System”. Proceedingsof Performance’87, Bruxelles, dec. 1987, pp. 411-431, North Holland.

[C7] F.B. and W.A. MASSEY, “On the Busy Period of Certain Classes of Queueing Net-works”. Invited paper, 2nd International Workshop on Applied Mathematics,University of Rome 2, apr. 1987, pp. 3-11, North Holland.

[C6] F.B., “Queues with Locking ; the Multiclass Problem”. Invited paper, InternationalSeminar on Teletra!c Analysis and Computer Performance Evaluation, Am-sterdam, pp. 359-373, jun. 86, North Holland.

[C5] F.B. and A. MAKOWSKI, “Simple Computable Bounds for the Fork Join Queue”. Pro-ceedings of the Johns Hopkins Conference on Information Science and Systems,pp. 436-141, Johns Hopkins University, mar. 1985.

[C4] F.B. and Ph. ROBERT, “Analysis of Update Response Times in a Distributed DataBase Maintained by the Conservative Time Stamps Ordering Algorithm”, Proceedingsof Performance’83 (9th International Conference on Comp., Perf. Model), CollegePark, Maryland, pp. 415-436, may 1983, North Holland.

[C3] F.B. and K.S. TRIVEDI, “Analysis of M/G/2 Standby Redundant System”, Proceedingsof Performance’83, College Park, Maryland, pp. 457-476, may 1983, North Holland.

[C2] F.B. and T. ZNATI, “Queueing Systems with Breakdowns in Data Base Modeling”,Proceedings of Performance’81 (8th IFIP International Symposium on Comp. Perf.Model.), Amsterdam, pp. 213-232, nov. 1981, North Holland.

[C1] F.B. and G, HEBUTERNE, “On Queues with Impatient Customers”, Proceedings ofPerformance’81, Amsterdam, pp. 159,180, nov. 1981, North Holland.

17

Jean-Claude Belfiore's Short Biography

Jean-Claude Belfiore received the "Diplôme d'ingénieur" (Eng. degree) from Ecole Supérieure d'Electricité (Supelec) in 1985, the "Doctorat" (PhD) from ENST in 1989 and the "Habilitation à diriger des Recherches" (HdR) from Université Pierre et Marie Curie (UPMC) in 2001. In 1989, he was enrolled at the “Ecole Nationale Supérieure des Télécommunications, ENST, also called “Télécom ParisTech", where he is presently full Professor in the Communications & Electronics department. He is carrying out research at the Laboratoire de Traitement et Communication de l'Information, LTCI , joint research laboratories between ENST and the “Centre National de la Recherche Scientifique” (CNRS), UMR 5141, where he is in charge of research activities in the areas of digital communications, information theory and coding. Jean-Claude Belfiore has made pioneering contributions on modulation and coding for wireless systems (especially space-time coding) by using tools of number theory. He is also, with Ghaya Rekaya and Emanuele Viterbo, one of the co-inventors of the celebrated Golden Code. He is now working on wireless network coding, cooperative communications and coding for physical security. In 2007, he was the recipient of the SEE Blondel Medal. He is author or co-author of more than 200 technical papers and communications and he has served as advisor for more than 30 Ph.D. Students.

Jean-Claude Belfiore's Publications

Journals

Submitted Journal Papers

A. F. Oggier, P. Solé and J.-C. Belfiore, "Codes over Matrix Rings for Space-Time Coded Modulations," submitted to IEEE Transactions on Information Theory, available on arXiv arXiv:1008.1387v1 [cs.IT]

B. L. Mroueh and J.-C. Belfiore, "How to achieve the Optimal DMT of Selective Fading MIMO Channels," submitted to IEEE Transactions on Information Theory, available on arXiv arXiv:1010.2686v1 [cs.IT]

C. M. Kobayashi, S. Yang, M. Debbah and J.-C. Belfiore, "Outage Efficient Strategies for Network MIMO with Partial CSIT," submitted to IEEE Trans. on Signal Processing, available on arXiv arXiv:1001.2421v1 [cs.IT]

D. L. Luzzi, G. Rekaya-Ben Othman and J.-C. Belfiore, "Algebraic reduction for space-time codes based on quaternion algebras," submitted to Advances in Mathematics of Communications, available on arXiv:0809.3365v2 [cs.IT]

E. S. Yang and J. -C. Belfiore, "Diversity of MIMO Multihop Relay Channels," submitted to IEEE Transactions on Information Theory, available on arXiv 0708.0386

Accepted Journal Papers

I. S. Yang and J. -C. Belfiore, "Diversity-Multiplexing Tradeoff of Double Scattering MIMO Channels," accepted for publication in the IEEE Transactions on Information Theory, available on arXiv 0603124v2 [cs.IT]

II. M. Sarkiss, G. Rekaya-Ben Othman, M. O. Damen and J.-C. Belfiore, "Construction of New Delay-Tolerant Space-Time Codes," accepted for publication in IEEE Transactions on Information Theory, available on arXiv 1011.0474v1 [cs.IT]

Published Journal Papers

1. M. Pischella and J.-C. Belfiore, "Distributed Margin Adaptive Resource Allocation in MIMO OFDMA Networks," IEEE Transactions on Communications, Volume 58, Issue 9, Sept. 2010, pdf

2. L. Luzzi, G. Rekaya-Ben Othman and J.-C. Belfiore, "Augmented Lattice Reduction for MIMO Decoding," IEEE Transactions on Wireless Communications, Volume 9, Issue 9, Sept. 2010, Page(s): 2853 - 2859, pdf

3. A. Mahmood and J.-C. Belfiore, "An Efficient Algorithm for Optimal Discrete Bit-Loading in MultiCarrier Systems," IEEE Transactions on Communications, Volume 58, Issue 6, June 2010, Page(s):1627 - 1630, pdf

4. M. Pischella and J.-C. Belfiore, "Weighted Sum Throughput Maximization in Multicell OFDMA Networks," IEEE Transactions on Vehicular Technology, Volume 59, Issue 2, Feb. 2010, Page(s): 896 - 905, pdf

5. M. Pischella and J.-C. Belfiore, "Resource Allocation for QoS-Aware OFDMA Using Distributed Network Coordination," IEEE Transactions on Vehicular Technology, Volume 58, Issue 4, May 2009, Page(s): 1766 - 1775, pdf

6. L. Luzzi, G. Rekaya-Ben Othman, J.-C. Belfiore and E. Viterbo, "Golden Space-Time Block Coded Modulation," IEEE Transactions on Information Theory, Volume 55, Issue 2, Feb. 2009, Page(s): 584 - 595, pdf

7. M. Pischella and J.-C. Belfiore, "Power control in distributed cooperative OFDMA cellular networks," IEEE Transactions on Wireless Communications, Volume 7, Issue 5, Part 2, May 2008, Page(s):1900 - 1906, pdf

8. C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On the Amplify-and-Forward Cooperative Diversity with Time-Hopping Ultra-Wideband Communications," IEEE Transactions on Communications, Volume 56, Issue 4, April 2008, Page(s):630 - 641, pdf

9. M. Pischella and J.-C. Belfiore, "Distributed resource allocation for rate-constrained users in multi-cell OFDMA networks," IEEE Communications Letters, Volume 12, Issue 4, April 2008, Page(s):250 - 252, pdf

10.I. Krikidis and J.-C. Belfiore, "Scheduling for Amplify-and-Forward Cooperative Networks," IEEE Transactions on Vehicular Technology, Volume 56, Issue 6, Part 2, Nov. 2007, Page(s):3780 - 3790, pdf

11.I. Kammoun, A. M. Cipriano and J.-C. Belfiore, "Non-Coherent Codes over the Grassmannian," IEEE Transactions on Wireless Communications, Volume 6, Issue 10, October 2007, Page(s):3657 - 3667, pdf

12.S. Yang and J.-C. Belfiore, "Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme," IEEE Transactions on Information Theory, Volume 53, Issue 9, Sept. 2007, Page(s):3114 - 3126, pdf

13.G. Feideropoulou, M. Trocan, J. E. Fowler, B. Pesquet-Popescu, and J.-C. Belfiore, "Rotated Constellations for Video Transmission Over Rayleigh Fading Channels ," IEEE Signal Processing Letters, Volume 14, Issue 9, Sept. 2007, Page(s):629 - 632, pdf

14.C. Abou-Rjeily and J.-C. Belfiore, "On Space–Time Coding With Pulse Position and Amplitude Modulations for Time-Hopping Ultra-Wideband Systems," IEEE Transactions on Information Theory, Volume 53, Issue 7, July 2007, Page(s):2490 - 2509, pdf

15.C. Abou-Rjeily and J.-C Belfiore, "A Space-Time Coded MIMO TH-UWB Transceiver with Binary Pulse Position Modulation," IEEE Communications Letters, Volume 11, Issue 6, June 2007, Page(s):522 - 524, pdf

16.I. Krikidis and J.-C. Belfiore, "Three Scheduling Schemes for Amplify-and-Forward Relay Environments," IEEE Communications Letters, Volume 11, Issue 5, May 2007, Page(s):414 - 416, pdf

17.Y. Hong, E. Viterbo, and J.-C. Belfiore, "Golden Space–Time Trellis Coded Modulation," IEEE Transactions on Information Theory, Volume 53, Issue 5, May 2007, Page(s):1689 - 1705, pdf

18.C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Distributed Algebraic Space-Time Codes

for Ultra-Wideband Communications," Wireless Personal Communications, Volume 43, April 2007, Springer, pp. 107 - 121, pdf

19.S. Yang and J.-C. Belfiore, "Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel," IEEE Transactions on Information Theory, Volume 53, Issue 2, Feb. 2007, Page(s):647 - 663, pdf

20.C. Abou-Rjeily, N. Daniele, J.-C. Belfiore, "Space–Time Coding for Multiuser Ultra-Wideband Communications," IEEE Transactions on Communications, Volume 54, Issue 11, Nov. 2006, Page(s):1960 - 1972, pdf

21.F. Oggier, G. Rekaya, J.-C. Belfiore and E. Viterbo, "Perfect Space-Time Block Codes," IEEE Transactions on Information Theory, Volume 52, Issue 9, Sept. 2006, Page(s):3885 - 3902, pdf

22.C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "A 2x2 antennas ultra-wideband system with biorthogonal pulse position modulation," IEEE Communications Letters, Volume 10, Issue 5, May 2006, Page(s):366 - 368, pdf

23.G. Feideropoulou, M. Trocan, J. E. Fowler, B. Pesquet-Popescu, and J.-C. Belfiore, "Joint source-channel coding with partially coded index assignment for robust scalable video," IEEE Signal Processing Letters, Volume 13, Issue 4, April 2006, Page(s):201 - 204, pdf

24.E. Jandot-dit-Danjou and J.-C. Belfiore, "A 2x2 antennas Bluetooth system," IEEE Communications Letters, Volume 9, Issue 9, Sep 2005, Page(s):784 - 786, pdf

25.J.-C. Belfiore, G. Rekaya and E. Viterbo, "The Golden code: a 2x2 full-rate space-time code with nonvanishing determinants," IEEE Transactions on Information Theory, Volume 51, Issue 4, April 2005, Page(s):1432 - 1436, pdf

26.I. Kammoun and J.-C. Belfiore, "A new family of Grassmann space-time codes for non-coherent MIMO systems," IEEE Communications Letters, Volume 7, Issue 11, Nov. 2003, Page(s):528 - 530, pdf

27.M. O. Damen, N. C. Beaulieu and J.-C. Belfiore, "Bandwidth-efficient linear Modulations for multiple-antenna transmission," IEEE Transactions on Information Theory, Volume 49, Issue 9, Sept. 2003, Page(s):2292 - 2298, pdf

28.M. O. Damen, A. Tewfik and J.-C. Belflore, "A construction of a space-time code based on number theory," IEEE Transactions on Information Theory, Volume 48, Issue 3, March 2002, Page(s):753 - 760, pdf

29.M. O. Damen, K. Abed-Meraim and J.-C. Belfiore, "Diagonal algebraic space-time block codes," IEEE Transactions on Information Theory, Volume 48, Issue 3, March 2002, Page(s):628 - 636, pdf

30.M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Communications Letters, Volume 4, Issue 5, May 2000, Page(s):161 - 163, pdf

31.M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, "Generalized sphere decoder for asymmetrical space-time communication architecture," Electronics Letters, Volume 36, Issue 2, 20, Jan. 2000, Page(s):166 - 167, pdf

32.X. Giraud, E. Boutillon and J.-C. Belfiore, "Algebraic tools to build modulation schemes for fading channels," IEEE Transactions on Information Theory, Volume 43, Issue 3, May 1997, Page(s):938 - 952, pdf

33.R. Haas and J.-C. Belfiore, "A Time-Frequency Well-localized Pulse for Multiple Carrier Transmission," Wireless Personal Communications, Volume 5, Issue 1, Jan. 1997, Kluwer Academic Press, pp. 1 - 18, pdf

34.J. Boutros, E. Viterbo, C. Rastello and J.-C. Belfiore, "Good lattice constellations for both Rayleigh fading and Gaussian channels," IEEE Transactions on Information Theory, Volume 42, Issue 2, March 1996, Page(s):502 - 518, pdf

35.R. Haas and J.-C. Belfiore, "Spectrum efficiency limits in mobile cellular systems," IEEE Transactions on Vehicular Technology, Volume 45, Issue 1, Feb. 1996, Page(s):33 - 40, pdf

36.X. Giraud and J.-C. Belfiore, "Constellations matched to the Rayleigh fading channel," IEEE Transactions on Information Theory, Volume 42, Issue 1, Jan. 1996, Page(s):106 - 115, pdf

37.X. Giraud and J.-C. Belfiore, "The Constellation Design problem," Annales des Télécommunications, Volume 50, Num. 9-10, 1995, Page(s):824 - 831, pdf

38.K. Leeuwin, J.-C. Belfiore, and G. K. Kaleh, "Chernoff bound of trellis-coded modulation over correlated fading channels," IEEE Transactions on Communications, Volume 42, Issue 8, Aug. 1994, Page(s):2506 - 2511, pdf

39.J. Holtz, X. Giraud and J.-C. Belfiore, "Compared merits of hard/soft decoding for coherent optical communications impaired by phase noise," Journal of Lightwave Technology, Volume 11, Issue 12, Dec. 1993, Page(s):2093 - 2099, pdf

40.K. Leeuwin-Boullé and J.-C. Belfiore, "The cutoff rate of time correlated fading channels," IEEE Transactions on Information Theory, Volume 39, Issue 2, March 1993, Page(s):612 - 617, pdf

Conferences (2005-2010)

• J.-C. Belfiore and M. A. Vázquez Castro, "Managing interference through space-time codes, lattice reduction and network coding," Information Theory Workshop, Cairo Jan. 2010.

• C. Abgrall, E. Calvanese-Srinati and J.-C. Belfiore, "Multi-Cell Interference Aware Resource Allocation for Half-Duplex Relay Based Cooperation," IEEE Vehicular Technology Conference, VTC Spring-2010.

• C. Abgrall, E. Calvanese-Srinati and J.-C. Belfiore, "Centralized Power Allocation for Interference Limited Network," IEEE Vehicular Technology Conference, VTC Fall-2010.

• S. Yang and J.-C. Belfiore, "Distributed rotation recovers spatial diversity," 2010 IEEE Symposium on Information Theory, Austin.

• G. Rekaya, L. Luzzi and J.-C. Belfiore, "Algebraic reduction for the Golden Code," Information Theory Workshop, Cairo Jan. 2010.

• J.-C. Belfiore and F. Oggier, "Secrecy Gain: a Wiretap Lattice Code Design," ISITA 2010, Taiwan

• J.-C. Belfiore and P. Solé, "Unimodular Lattices for the Gaussian Wiretap Channel," Information Theory Workshop, Dublin, Sep. 2010.

• L. Mroueh and J.-C. Belfiore, "How to achieve the optimal DMT of selective fading MIMO channels?" Information Theory Workshop, Dublin, Sep. 2010.

• M. Badr, M. O. Damen and J.-C. Belfiore, "Delay-tolerant distributed space-time block codes for the asynchronous multiple-access channel," 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Page(s): 521 - 525

• C. Abgrall, E. Calvanese-Strinati and J.-C. Belfiore, "Inter-cell interference mitigation allocation for half-duplex relays based cooperation," 2009 2nd IFIP Wireless Days (WD)

• M. Pischella and J.-C. Belfiore, "Distributed resource allocation in MIMO OFDMA networks with statistical CSIT," IEEE 10th Workshop on Signal Processing Advances in Wireless Communications, SPAWC '09, Page(s): 126 - 130

• M. Pischella and J.-C. Belfiore, "Graph-based weighted sum throughput maximization in OFDMA cellular networks," Second International Workshop on Cross Layer Design, IWCLD '09

• M. Badr, G. Rekaya-Ben Othman, and J.-C. Belfiore, "Unbalanced space-time block codes for non uniform energy distribution multiple access channels," 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Page(s): 315 - 319

• G. Rekaya-Ben Othman, L. Luzzi and J.-C. Belfiore, "Algebraic Reduction for the Golden Code," IEEE International Conference on Communications, ICC '09

• M. Kobayashi, M. Debbah and J.-C. Belfiore, "Outage efficient strategies for network MIMO with partial CSIT," IEEE International Symposium on Information Theory, ISIT 2009, Page(s): 249 - 253

• F. Oggier, P. Sole and J.-C. Belfiore, "Codes over M2(F2) and applications to Golden space-

time coded modulation IEEE International Symposium on Information Theory, ISIT 2009, Page(s): 85 - 88

• R. Ouertani, G. Rekaya-Ben Othman and J.-C. Belfiore, "An Adaptive MIMO Decoder," IEEE 69th Vehicular Technology Conference, VTC Spring 2009

• M. Pischella and J.-C. Belfiore, "Achieving a Frequency Reuse Factor of 1 in OFDMA Cellular Networks with Cooperative Communications," Vehicular Technology Conference, 2008. VTC Spring 2008 , Page(s): 653 - 657

• M. Sarkiss, G. Rekaya-Ben Othman and J.-C. Belfiore, "4 × 4 Perfect space-time code partition,"42nd Asilomar Conference on Signals, Systems and Computers, 2008, Page(s): 1763 - 1767

• M. Sarkiss, M. O. Damen and J.-C. Belfiore, "2 × 2 delay-tolerant distributed space-time codeswith non-vanishing determinants," Personal, IEEE 19th International Symposium on Indoor and Mobile Radio Communications, PIMRC 2008

• M. Pischella and J.-C. Belfiore, "QoS-Based Resource Allocation with Cooperative Diversity in OFDMA," IEEE Vehicular Technology Conference. VTC Spring 2008, Page(s): 1896 - 1900

• M. Badr and J.-C. Belfiore, "Distributed space time codes for the Amplify-and-Forward Multiple-Access Relay channel," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2543 - 2547

• L. Luzzi, G. Rekaya-Ben Othman, J.-C. Belfiore and E. Viterbo, "Golden space-time block coded modulation," IEEE Information Theory Workshop, ITW '08, Page(s): 86 - 90

• L. Mroueh, M. O. Damen, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "Code construction for the selective TDMA cooperative broadcast channel," IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008

• A. Mahmood and J.-C. Belfiore, "Improved 3-dB Subgroup based Algorithm for Optimal

Discrete Bit-Loading," 2008 IEEE Sarnoff Symposium

• M. Badr, E. Calvanese-Strinati and J.-C. Belfiore, "Optimal Power Allocation for Hybrid Amplify-and-Forward Cooperative Networks," IEEE Vehicular Technology Conference, VTC Spring 2008, Page(s): 2111 - 2115

• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "DMT achieving schemes for the isotropic fading vector broadcast channel Personal, IEEE 19th International Symposium on Indoor and Mobile Radio Communications, PIMRC 2008

• M. Pischella and J.-C. Belfiore, "Distributed weighted sum throughput maximization in multi-cell wireless networks," IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008

• M. Badr and J.-C. Belfiore, "Distributed space-time block codes for the MIMO Multiple Access Channel," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2553 - 2557

• M. Badr and J.-C. Belfiore, "Distributed Space-Time Block Codes for the non cooperative Multiple Access Channel," IEEE International Zurich Seminar on Communications, 2008, Page(s): 132 - 135

• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "DMT of weighted parallel channels: Application to broadcast channels," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2361 - 2365

• L. Berriche, K. Abed-Meraim and J.-C. Belfiore, "MIMO systems: Performance comparison of semi-blind techniques," 9th International Symposium on Signal Processing and Its Applications, ISSPA 2007

• S. Yang and J.-C. Belfiore, "Distributed (Space-Time) Codes for the MIMO Multihop Channel via Partitions of the Channel," 2007 IEEE Information Theory Workshop onInformation Theory for Wireless Networks

• Z. Zhao and J.-C. Belfiore, "Application of Cooperative Diversity in 802.11a Ad-hoc Networks," Proceedings of 16th International Conference on Computer Communications and Networks, ICCCN 2007, Page(s): 1016 - 1021

• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "On the performance of the Golden code in BICM-MIMO and in IEEE 802.11n cases," Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, ACSSC 2007, Page(s): 1544 - 1548

• J.-C. Belfiore, M. Badr, S. Yang and G. Rekaya-Ben Othman, "DMT achieving Distributed Space Time Codes for the Multiple Access Channel," Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, ACSSC 2007, Page(s): 810 - 813

• E. Calvanese-Strinati, S. Yang and J.-C. Belfiore, "Adaptive Modulation and Coding for Hybrid Cooperative Networks," IEEE International Conference on Communications, ICC '07, Page(s): 4191 - 4195

• C. Abou Rjeily and J.-C. Belfiore, "A Rate-1 2 × 2 Space-Time Code without any Constellation Extension for TH-UWB Communication Systems with PPM," 65th IEEE Vehicular Technology Conference, VTC2007-Spring, Page(s): 1683 - 1687

• S. Yang and J.-C. Belfiore, "On the Diversity of Rayleigh Product Channels," EEE International Symposium on Information Theory, ISIT 2007, Page(s): 1276 - 1280

• M. Sarkiss, J.-C. Belfiore and Y. Yuan-Wu, "Performance Comparison of Different Golden Code Detectors," IEEE 18th International Symposium on Personal, Indoor and Mobile

Radio Communications, PIMRC 2007

• C. Hucher, G. Rekaya-Ben Othman and J.-C. Belfiore, "Adaptive Amplify-and-Forward Cooperative Channel," IEEE International Symposium on nformation Theory, ISIT 2007, Page(s): 2706 - 2710

• M. Pischella and J.-C. Belfiore, "Optimal Power Allocation for Downlink Cooperative Cellular Networks," IEEE 65th Vehicular Technology Conference, VTC2007-Spring, Page(s): 2864 - 2868

• C. Hucher, G. Rekaya-Ben Othman and J.-C. Belfiore, "AF and DF Protocols based on Alamouti ST Code," IEEE International Symposium on Information Theory, ISIT 2007, Page(s): 1526 - 1530

• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "An Optimal 2 x 2 Space-Time Code for Time-Hopping Ultra-Wideband Systems with binary Pulse Position Modulation," 3rd International Symposium on Wireless Communication Systems, ISWCS '06, Page(s): 456 - 460

• S. Yang and J.-C. Belfiore, "Optimal Space-Time Codes for the MIMO Amplify-and-Forward Cooperative Channel," 2006 International Zurich Seminar on Communications, Page(s): 122 - 125

• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "MIMO UWB Communications Using Modified Hermite Pulses," 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications

• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "A New Full Rate Full Diversity ST Code with Nonvanishing Determinant for TH-UWB Systems," 2006 International Zurich Seminar on Communications, Page(s): 198 - 201

• C. Abou-Rjeily, N. Daniele, and J.-C. Belfiore, "Distributed Space-Time Coding with Ultra-Wideband Systems," 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications

• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "Performance of MIMO UWB Systems with Biorthogonal Pulse Position Modulation 2006 International Zurich Seminar on Communications, Page(s): 202 - 205

• L. Berriche, K. Abed-Meraim and J.-C. Belfiore, "Effect of Imperfect Channel Knowledge on the MIMO Channel Outage Capacity," IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC '06

• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On the Decode-and-Forward Cooperative Diversity with Coherent and Non-Coherent UWB Systems," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 435 - 440

• Y. Hong, E. Viterbo and J.-C. Belfiore, "High Rate Golden Space-Time Trellis Coded Modulation," Fortieth Asilomar Conference on Signals, Systems and Computers, ACSSC '06, Page(s): 2087 - 2091

• R. Ouertani, A. Saadani, G. Rekaya-Ben Othman and J.-C. Belfiore, "On the Golden Code Performance for MIMO-HSDPA System," IEEE 64th Vehicular Technology Conference, VTC-2006 Fall

• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Diversity-Multiplexing Tradeoff of Single-Antenna and Multi-Antenna Indoor Ultra-Wideband Channels," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 441 - 446

• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Amplify-and-Forward Cooperative

Diversity with Space-Time Coded UWB Systems," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 429 - 434

• S. Yang, J.-C. Belfiore and G. Rekaya-Ben Othman, "Perfect Space-Time Block Codes for parallel MIMO channels," 2006 IEEE International Symposium on Information Theory, Page(s): 1949 - 1953

• Y. Hong, E. Viterbo and J.-C. Belfiore, "A Space-Time Block Coded Multiuser MIMO Downlink Transmission Scheme," 2006 IEEE International Symposium on Information Theory, Page(s): 257 - 261

• S. Yang and J.-C. Belfiore, "A Novel Two-Relay Three-Slot Amplify-and-Forward Cooperative Scheme," 2006 40th Annual Conference on Information Sciences and Systems, Page(s): 1329 - 1334

• S. Yang and J.-C. Belfiore, "On Slotted Amplify-and-Forward Cooperative Diversity Schemes," 2006 IEEE International Symposium on Information Theory, Page(s): 2446 - 2450

• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "A New Family of Space-Time Codes for Pulse Amplitude and Position Modulated UWB Systems," 2006 IEEE International Symposium on Information Theory, Page(s): 2829 - 2833

• A. Cipriano, I. Kammoun and J.-C. Belfiore, "Simplified decoding for some non-coherent codes over the Grassmannian," 2005 IEEE International Conference on Communications, ICC 2005, Page(s): 757 - 761 Vol. 2

• I. Kammoun, A. Cipriano and J.-C. Belfiore, "A non-coherent SIMO architecture based on Grassmann codes," 2005 IEEE Workshop on Signal Processing Systems Design and Implementation, Page(s): 239 - 244

• G. Feideropoulou, J. E. Fowler, B. Pesquet-Popescu and J.-C. Belfiore, "Joint source-channel coding of scalable video with partially coded index assignment using Reed-Muller codes," 2005 IEEE International Conference on Image Processing, ICIP 2005, Volume: 3, Page(s): III - 888 - 891

• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On high data rate space-time codes for ultrawideband systems," 2005 IEEE International Conference on Ultra-Wideband, ICU 2005

• I. Kammoun, A. Cipriano and J.-C. Belfiore, "Performance analysis of some non-coherent space-time codes," 12th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2005

• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "Differential space-time ultra-wideband communications," 2005 IEEE International Conference on Ultra-Wideband, ICU 2005

• M. Tlich, J.-C. Belfiore and A. Zeddam, "Optimization process of power distribution for a frequency multiplexing DMT transmission," 12th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2005

• J.-C. Belfiore and E. Viterbo, "Approximating the error probability for the independent Rayleigh fading channel," International Symposium on Information Theory, ISIT 2005, Page(s): 362 - 362

• G. Feideropoulou, B. Pesquet-Popescu and J.-C. Belfiore, "Bit Allocation Algorithm for Joint Source-Channel Coding of t+2D Video Sequences," IEEE International Conference on Acoustics, Speech, and Signal Processing, (ICASSP '05) Volume: 2, Page(s): 177 - 180

CV Ronald Cramer

Ronald Cramer (1968) is head (and founder) of the Cryptology research group at the Centrum Wiskunde en Informatica (CWI)in Amsterdam and he is Professor at the Mathematical Institute, Leiden University, where he holds the Chair in Cryptology within the Algebra & Number Theory group. CWI is the national research center for mathematics and computer science in the Netherlands. He holds an MSc in Mathematics from Leiden University (1992) and a PhD in Cryptology from the University of Amsterdam (1997).

Cramer's current research focuses on mathematical cryptology, with an emphasis on connections between information-theoretic cryptography on the one hand, and algebraic number theory and -geometry, combinatorics and coding theory on the other hand. But generally his research interests include all aspects of public key-, information-theoretic-, and theoretical cryptography.

[He is perhaps best known for his contributions to the area of practical reductionist security (especially, CCA-secure encryption and hash proof systems), to the theory of Sigma-protocols and cryptographic protocol theory in general, and to the mathematical aspects of secret sharing and information-theoretically secure multi-party computation.]

Prior to his being appointed at CWI and Leiden on June 1, 2004, Cramer held research positions at ETH Zurich (1997-2000) and at Aarhus University (2000-2004). Cramer has held positions as Visiting Professor at ENS (Rue d'Ulm, Paris), NTU (Singapore), CRM (Barcelona), Complutense (Madrid), UPC (Barcelona), and NTT Research (Yokosuka).

He is an Invited Speaker at the 30th Annual IACR EUROCRYPT (2011). In 2006 he won a VICI career-development grant from NWO, the Netherlands Science Foundation. In 2005 he was elected to ``De Jonge Akademie'' at the Royal Netherlands Academy of Sciences (KNAW). In 1998 he received the KNAW Christiaan Huygens Award for his PhD-thesis.

Cramer is on the editorial board of several journals, including IACR Journal of Cryptology (Springer) since 2000. IACR is the International Association for Cryptologic Research. He is serving as Program Chair of the 9th Annual IACR TCC (2012), and he served as Program Chair of the 24th Annual IACR EUROCRYPT (2005) and of the 11th Annual IACR PKC (2008). He regularly serves on the Program Committees of CRYPTO, EUROCRYPT, TCC and PKC. He is a regular Scientific Organizer of workshops at Institute for Pure and Applied Mathematics (IPAM, UCLA), Dagstuhl, CRM (Barcelona), or Lorentz Center (Leiden).

During 2004--2007, he served as a Director on the Board of the IACR. Currently, he serves on the Advisory Board of the Springer Series on Cryptography and Information Security, and on the Steering committees of IACR PKC and of ICITS.

Ronald Cramer: Publications

June 13, 2011

1 Articles, Books, Patent, Theses

1.1 Books

1. (In preparation) R. Cramer, I. Damgaard, J. Nielsen. Information-TheoreticallySecure Multi-Party Computation.

2. R. Cramer (Ed.). Proceedings of 11th Annual IACR PKC.

Springer Verlag LNCS, vol. 4939, 396p., March 2008.

3. R. Cramer (Ed.). Proceedings of 24th Annual IACR EUROCRYPT.

Springer Verlag LNCS, vol. 3494, 576p., May 2005.

4. D. Catalano, R. Cramer, I. Damgaard, G. Di Crescenzo, D. Pointcheval,T. Takagi (Eds.). Contemporary Cryptology.

Advanced Courses in Mathematics, CRM Barcelona, Birkhauser, VIII,237p., 2005.

1.2 Research on Information-Theoretically Secure Multi-Party Computation

1. I. Cascudo, R. Cramer, C. Xing. The Torsion-Limit for Algebraic FunctionFields and its Application to Arithmetic Secret Sharing.

In: Proceedings of 31st Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. ??, pp. ??–?? (21p.), August 2011.

2. I. Cascudo, R. Cramer, C. Xing, A. Yang. Multiplications in every ex-tension of small finite fields. Manuscript, 2010.

3. I. Cascudo, R. Cramer, C. Xing. Upper Bounds on Asymptotic Opti-mal Corruption Tolerance in Strongly Multiplicative Linear Secret Shar-ing. Manuscript, 20010.

1

4. I. Cascudo, H. Chen, R. Cramer, C. Xing. Asymptotically Good IdealLinear Secret Sharing Schemes with Strong Multiplication over Any FixedFinite Field.

In: Proceedings of 29th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 5677, pp. 466–486, August 2009.

5. R. Cramer, V. Daza, I. Gracia, J. Jimenez Urroz, G. Leander, J. Martı-Farre, C. Padro. On Codes, Matroids and Secure Multi-Party Computa-tion from Linear Secret Sharing Schemes.

In: IEEE Transactions on Information Theory, 54(6): 2644-2657 (2008),June 2008.

Earlier version in: Proceedings of 25th Annual IACR CRYPTO, SantaBarbara, Ca., USA, Springer Verlag LNCS, vol. 3621, pp. 327–343, August2005.

6. H. Chen, R. Cramer, R. de Haan, I. Cascudo Pueyo. Ramp schemes withmultiplication from high degree rational points on curves.

In: Proceedings of 27th Annual IACR EUROCRYPT, Istanbul, Turkey,USA, Springer Verlag LNCS, vol. 4965, pp. 451–470, April 2008.

7. R. Cramer, Y. Dodis, S. Fehr, C. Padro, D. Wichs: Detection of Alge-braic Manipulation with Applications to Robust Secret Sharing and FuzzyExtractors.

In: Proceedings of 27th Annual IACR EUROCRYPT, Istanbul, Turkey,Springer Verlag LNCS, vol. 4965, pp. 471–488,, April 2008.

8. R. Cramer, E. Kiltz, and C. Padro. A Note on Secure Computation ofthe Moore-Penrose Pseudo-Inverse and its Application to Secure LinearAlgebra.

In: Proceedings of 27th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 4622, pp. 613–630, August 2007.

9. H. Chen, R. Cramer, S. Goldwasser, R. de Haan, V. Vaikuntanathan.Secure Computation from Random Error Correcting Codes.

In: Proceedings of 26th Annual IACR EUROCRYPT, Barcelona, Spain,Springer Verlag LNCS, vol. 4515, pp. 329–346,May 2007.

10. R. Cramer, I. Damgaard, R. de Haan. Atomic Secure Multiplication withLow Communication.

In: Proceedings of 26th Annual IACR EUROCRYPT, Barcelona, Spain,Springer Verlag LNCS, vol. 4515, pp. 291–310,May 2007.

11. H. Chen and R. Cramer. Algebraic Geometric Secret Sharing Schemesand Secure Multi-Party Computation over Small Fields.

In: Proceedings of 26th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 4117, pp. 516–531, August 2006.

2

12. S. Agarwal, R. Cramer, R. de Haan. Optimal 2-Phase Perfectly SecureMessage Transmission. January 2006.

In: Proceedings of 26th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 4117, pp. 389–401, August 2006.

13. R. Cramer, S. Fehr, M. Stam. Primitive Sets over Number Fields andAbsolutely Optimal Black-Box Secret Sharing.

In: Proceedings of 25th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 3621, pp. 344–360, August 2005

14. R. Cramer, S. Fehr, Y. Ishai, E. Kushilevitz. Multi-Party Computationsover Rings.

In: Proceedings of 22nd Annual IACR EUROCRYPT, Warsaw, Poland,Springer Verlag LNCS, vol. 2656, pp. 596–613, May 2003.

15. R. Cramer, S. Fehr. Optimal Black-Box Secret Sharing over ArbitraryAbelian Groups.

In: Proceedings of 22nd Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 2442, pp. 272–287, August 2002.

16. R. Cramer, I. Damgaard: Secure Distributed Linear Algebra in a ConstantNumber of Rounds.

In: Proceedings 21st Annual IACR CRYPTO ’01, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 2139, pp. 119–136, August 2001.

17. R. Cramer, I. Damgard, S. Fehr. On the Cost of Reconstructing a Secret–Or: VSS with Optimal Reconstruction.

In: Proceedings of 21st Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 2139, pp. 503–523, August 2001.

18. R. Cramer, I. Damgaard, S. Dziembowski. On the Complexity of VerifiableSecret Sharing and Multi-Party Computation.

In: Proceedings of the 32nd Annual ACM Symposium on Theory of Com-puting (STOC ’00), Portland, Oregon, USA, ACM Press, pp. 325–334,May 2000.

19. R. Cramer, I. Damgaard and U. Maurer. General Secure Multi-PartyComputation from any Linear Secret Sharing Scheme.

In: Proceedings of 19th Annual IACR EUROCRYPT, Brugge, Belgium,Springer Verlag LNCS, vol. 1807, pp. 316–334, May 2000.

20. R. Cramer, I. Damgaard, S. Dziembowski, M. Hirt and T. Rabin. EfficientMulti-Party Computations with Dishonest Minority.

In: Proceedings of 18th Annual IACR EUROCRYPT, Prague, Czech Re-public, Springer Verlag LNCS, vol. 1592, pp. 311–326, May 1999.

3

1.3 Research on General Issues in Secure Computation

1. R. Cramer, I. Damgaard, V. Pastro. Amortized Complexity of Zero-Knowledge Protocols for Multiplicative Relations. Manuscript, 2011.

2. R. Cramer, I. Damgaard. Amortized Complexity of Zero Knowledge Pro-tocols.

In: Proceedings of 29th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 5677, pp. 177–191, August 2009.

3. R. Cramer, I. Damgaard, Y. Ishai. Share Conversion, PseudorandomSecret-Sharing and Applications to Secure Computation.

In: Proceedings of IACR Theory of Cryptography Conference (TCC ’05),MIT, Cambridge, MA, USA, Springer Verlag LNCS, vol. 3378, pp. 342–362, February 2005.

4. R. Cramer, I. Damgaard. Secret-Key Zero-Knowledge and Non-InteractiveVerifiable Exponentiation.

In: Proceedings of IACR Theory of Cryptography Conference (TCC ’04),MIT, Cambridge, MA., USA, Springer Verlag LNCS, vol. 2951, pp. 223-237, February 2004.

5. M. Abe, R. Cramer, S. Fehr. Non-Interactive Distributed Zero-KnowledgeProofs.

In: Proceedings of IACR ASIACRYPT ’02, Queenstown, New Zealand,Springer Verlag LNCS, vol. 2501, pp. 206-223, December 2002.

6. R. Cramer, I. Damgard, J. Buus Nielsen. Multiparty Computation fromThreshold Homomorphic Encryption.

In: Proceedings of 20th Annual IACR EUROCRYPT, Innsbruck, Austria,Springer Verlag LNCS, vol. 2045, pp. 280–300, May 2001.

1.4 Research on Public Key Encryption Schemes

1. R. Cramer, I. Damgaard, E. Kiltz, S. Zakarias, A. Zottarel. DDH-likeAssumptions Based on Extension Rings. Manuscript, 2011.

2. R. Cramer, D. Hofheinz, E. Kiltz. A Twist on the Naor-Yung Paradigmand Its Application to Efficient CCA-Secure Encryption from Hard SearchProblems.

In: Proceedings of Seventh Theory of Cryptography Conference (TCC2010), Springer Verlag LNCS, pp. 146–164, LNCS 5978 (2010).

3. R. Cramer, D. Hofheinz, E. Kiltz, R. Pass, a. shelat, V. Vaikuntanathan.Bounded CCA2-Secure Encryption.

In: Proceedings of 13th Annual IACR ASIACRYPT, Malaysia, SpringerVerlag LNCS, vol. 4833, pp. 502–518, December 2007.

4

4. R. Cramer, V. Shoup. Universal Hash Proofs and a Paradigm for AdaptiveChosen Cipher-Text Secure Public-Key Encryption.

In: Proceedings of 21st Annual IACR EUROCRYPT, Amsterdam, TheNetherlands, Springer Verlag LNCS, vol. 2332, pp. 45–64, April 2002.

5. R. Cramer, V. Shoup. Design and analysis of practical public-key encryp-tion schemes secure against adaptive chosen ciphertext attack.

In: SIAM Journal on Computing 33:167–226, 2003.

6. R. Cramer, V. Shoup. A Practical Public Key Cryptosystem ProvablySecure against Adaptive Chosen Ciphertext Attack.

In: Proceedings of 18th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 1462, pp. 13–25, August 1998.

1.5 Research on Digital Signature Schemes

1. R. Cramer, V. Shoup. Signature Schemes Based on the Strong RSA As-sumption.

In: Proceedings of 6th ACM Conference on Computer and Communica-tions Security, Singapore, Thailand, November 1999. Journal version inACM Transactions on Information and System Security (ACM TISSEC)3(3):161-185, 2000.

2. R. Cramer, I. Damgaard. New Generation of Secure and Practical RSA-based Signatures.

In: Proceedings of 16th Annual IACR CRYPTO, Santa Barbara, Ca.,USA, Springer Verlag LNCS, vol. 1109, pp. 173–185, August 1996.

3. R. Cramer, I. Damgaard, and T. P. Pedersen. Efficient and ProvableSecurity Amplifications.

In: Proceedings of 4th Cambridge Security Protocols Workshop, Cam-bridge, UK, Springer Verlag LNCS, vol. 1189, pp. 101–109, April 1996.

4. R. Cramer, I. Damgaard. Secure Signature Schemes based on InteractiveProtocols.

In: Proceedings of 15th Annual IACR CRYPTO, Santa Barbara Ca.,Springer Verlag LNCS, vol. 963, pp. 297–310, August 1995.

5. R. Cramer: On Shared Randomness and the Size of Secure Signatures.

In: CWI Technical Report CS-R9530, April 1995.

5

1.6 Research on Zero Knowledge and Witness Hiding

1. R. Cramer, I. Damgaard, P. MacKenzie: Zero-Knowledge for Free: theCase of Proofs of Knowledge.

In: Proceedings of Public Key Cryptography (PKC2000), Melbourne,Australia, Springer Verlag LNCS, vol. 751, pp.354–372, January 2000.

2. R. Cramer and I. Damgaard. Fast and Secure Immunization against Man-in-the-Middle Impersonations.

In: Proceedings of 16th Annual IACR EUROCRYPT, Konstanz, Ger-many, Springer Verlag LNCS, vol. 1233, pp. 75–87, May 1997.

3. R. Cramer, I. Damgaard. Zero-Knowledge for Finite Field Arithmetic.Or: Can Zero-Knowledge be for Free?.

In: Proceedings 18th Annual IACR CRYPTO, Santa Barbara, Ca., USA,Springer Verlag LNCS, vol. 1462, pp. 424–441, August 1998.

4. R. Cramer and I. Damgaard. Linear Zero-Knowledge: A Note on EfficientZero-Knowledge Proofs and Arguments.

In: Proceedings of 29th Annual ACM Symposium on Theory of Comput-ing (STOC ’97), El Paso, Texas, USA, ACM Press, pp. 436–445, May1997.

5. I. Damgaard, R. Cramer. On Monotone Function Closure of Perfect andStatistical Zero-Knowledge.

In: CWI technical report, CS-R9618, May 1996.

6. R. Cramer, I. Damgaard, B. Schoenmakers. Proofs of Partial Knowledgeand Simplified Design of Witness Hiding Protocols.

In: Proceedings of 14th Annual IACR CRYPTO, Santa Barbara Ca.,Springer Verlag LNCS, vol. 839, pp. 174–187, August 1994.

1.7 Research on Electronic Voting and Electronic Pay-ment Schemes

1. R. Cramer, B. Schoenmakers and R. Gennaro. A Secure and OptimallyEfficient Multi-Authority Election Scheme.

In: Proceedings of EUROCRYPT ’97, Konstanz, Germany, Springer Ver-lag LNCS, vol. 1233, pp. 103–118, May 1997. Journal version: Eur. Trans.Telecom, Vol. 8, No. 5, Sept./Oct. 1997, pp. 481–490.

2. R. Cramer, M. Franklin, B. Schoenmakers, M. Yung. Secure Secret BallotElection Schemes with Linear Work.

In: Proceedings of 15th Annual IACR EUROCRYPT, Zaragoza, Spain,Springer Verlag LNCS, vol. 1070, pp. 72–83, May 1996.

6

3. J. Boly et al., ESPRIT 7023 Conditional Access for Europe (CAFE), FinalReport Secure Protocols.

In: CWI Technical Report, 1996.

4. J. -P. Boly et al.. The ESPRIT Project CAFE – High Security DigitalPayment Systems.

In: Proceedings of ESORICS ’94, Springer Verlag LNCS, vol. 875, pp.217–23, 1994.

5. J. -P. Boly et al.. Digital Payment Systems in the ESPRIT Project CAFE.

In: Proceedings of Securicom ’94, Paris, June 1994.

6. R. Cramer and T. Pedersen. Improved Privacy in Wallets with Observers.

In: Proceedings of 12th Annual IACR EUROCRYPT, Lofthus, Norway,Springer Verlag LNCS, vol. 765, pp. 329–343, May 1993.

1.8 Patent

1. R. Cramer, V. Shoup. Practical non-malleable public-key cryptosystem.US patent 6,697,488 (issued on 2004-02-24).

1.9 Theses

1. R. Cramer. Modular Design of Secure yet Practical Cryptographic Proto-cols.

Ph.D.-thesis, 196p., November 1996, ISBN 90-74795-64-1, CWI & Univer-sity of Amsterdam. Supervisors: Prof. Dr. Paul Vitanyi (CWI & Univer-sity of Amsterdam) and Prof. Dr. Ivan Damgaard (University of Aarhus).1998 KNAW Christiaan Huygens Award.

2. R. Cramer. Shared Information in the Moderated Setting.

M.Sc.-thesis, 33p., Mathematical Institute, Leiden University, August 1992.Supervisors: Dr. David Chaum (CWI) and Dr. Jan-Hendrik Evertse (Lei-den University).

7

Giuseppe Durisi

Work address:Department of Signals and SystemsChalmers University of Technology41296 GothenburgSweden

Tel: +46 31 772 18 02e-mail: durisi at ieee dot org

url: http://tinyurl.com/gdurisi

Information theory, harmonic analysis, coding theory, compressed sensingResearch

Born on November 28, 1977 in Turin, Italy; Italian citizenship; male; married; languages:PersonalItalian, English, German

� Mar. 2006: Politecnico di Torino, ItalyEducationPh.D. in electrical and communication engineering

· Doctoral dissertation: Noncoherent fading channels: capacity and coding

· Advisor: Professor Sergio Benedetto (Politecnico di Torino, Italy)

� Nov. 2001: Politecnico di Torino, ItalyTelecommunications Engineering Diploma [M.Sc.], summa cum laude

· Diploma dissertation: Analysis and simulation of an ultra-wideband communication sys-tem over a multipath channel

· Advisors: Professor Sergio Benedetto (Politecnico di Torino, Italy), Dr. Giovanni Romano(Telecom Italia Lab, Turin, Italy)

� Nov. 2010-current: Assistant professor at Chalmers University of Technology, SwedenAcademicWorkExperience

Department of Signals and Systems

� Feb. 2008-Oct. 2010: First assistant at ETH Zurich, SwitzerlandCommunication Theory Group (with professor Helmut Bolcskei)

� Feb. 2006-Jan. 2008: Postdoctoral researcher at ETH Zurich, SwitzerlandCommunication Theory Group (with professor Helmut Bolcskei)

� Nov. 2004-Nov. 2005: Visiting researcher at ETH Zurich, SwitzerlandCommunication Theory Group (with professor Helmut Bolcskei)

� Mar. 2004-Jul. 2004: Visiting researcher at Universita di Pisa, ItalyTransmission Systems Group (with professor Umberto Mengali); visit partly supported by theItalian national project PRIMO (Reconfigurable platforms for wideband wireless communica-tions)

� Jan. 2002-Jan. 2006: Junior researcher at Istituto Superiore Mario Boella, Turin, Italy

� Nov. 2002-Apr. 2003: Visiting researcher at IMST GmbH, GermanyIndustrialWorkExperience

Visit partially supported by the IST-2000-25197 project whyless.com

� Feb. 2001-Nov. 2001: Master thesis internship at Telecom Italia Lab, Turin, Italy

Optime award from Unione Industriale, Turin, Italy (for best graduates of the year 2001)Honors

Giuseppe Durisi

� Chalmers University of Technology: LecturerTeachingActivities · 2011: Information Theory–Advanced Level (7.5 credits graduate/PhD course, Spring

semester, taught in English)

� ETH Zurich: Teaching assistant for graduate courses

· 2007–2010: Fundamentals of Wireless Communications (4-unit graduate course, Springsemester, taught in English)

· 2009: Receivers for Wireless Communications (4-unit graduate course, Spring semester,taught in English)

· 2009: Harmonic Analysis: Theory and Applications in Advanced Signal Processing (4-unit graduate course, Spring semester, taught in English)

� Politecnico di Torino: Teaching assistant for undergraduate courses

· 2005: Analysis of Discrete-Time Signals (2-unit undergraduate course, Fall semester,taught in Italian)

· 2003–2004: Signal Theory (2-unit undergraduate course, Fall semester, taught in Italian)

� Co-supervised Ph.D. students at Chalmers University of Technology:

· W. Yang, Capacity of wireless networks under impairments, started in 2011

� Supervised graduate and undergraduate students at Chalmers University of Technology:

· I. Lellouch, Coding for phase noise channls, Spring semester 2011

· A. Mohaved, Large-deviation estimates and duality theory in compressive sensing, Au-tumn semester 2011

� Co-supervised Ph.D. students at ETH Zurich:

· P. Kuppinger, General uncertainty relations and sparse signal recovery, PhD 2011

· V. I. Morgensthern, Crystallization and noncoherence in wireless communication, PhD2010

· U. G. Schuster, Wireless communication over wideband channels, PhD 2007

� Supervised graduate and undergraduate students at ETH Zurich:

· M. Baum, Real-time video surveillance using compressed sensing and GPUs, Springsemester 2010

· P. Loeliger, Synchronization issues in a relay testbed, Spring semester 2010

· T. Laich, Matrix completion, Fall semester 2009

· C. Bunte, Structured measurements for compressed sensing, Fall semester 2009

· M. Gautschi, A. Muaremi, P. Bunjaku, Reconstruction algorithms for compressed sensing,Fall semester 2009

· D. Matter, Relaying testbed implementation and evaluation, Spring semester 2009

· S. Belfanti, Capacity bounds for pilot-assisted schemes, Spring semester 2009

· S. Altorfer, Bounds on the capacity region of a noncoherent multiple access channel, Fallsemester 2007

· P. Loeliger, Minimum mean-squared error channel estimators for pilot-assisted wirelesstransmission, Fall semester 2007

· S. Kaplan, Capacity of MIMO UWB systems under peak constraints, Spring semester2007

· G. Nikiforov, Scattering function estimation from dynamic UWB channel measurements,Spring semester 2006

Giuseppe Durisi

� Member of the organizing committee:ProfessionalService · 7th International Symposium on Turbo Codes & Iterative Information Processing (ISTC),

Gothenburg, Sweden, Aug. 2012

· 1st workshop on Ultra-Wideband for Wireless Personal Area and Sensor Networks, Turin,Italy, Nov. 2004

� Technical program committee membership:

· IEEE International Conference on Communications (ICC), Ottawa, Canada, Jun. 2012;Symposium: Cognitive Radio and Networks

· International Conference on Computing, Networking and Communications (ICNC), Maui,Hawaii USA, Jan. 2012

· IEEE Global Communications Conference (GLOBECOM), Huston, TX, USA Dec. 2011;Symposium: Cognitive Radio and Networks

· International Symposium on Wireless Communication Systems (ISWCS), Aachen, Ger-many, Nov. 2011

· IEEE International Conference on Communications (ICC), Kyoto, Japan, Jun. 2011;Symposium: Cognitive Radio and Networks

· International Conference on Communications and Networking in China (CHINACOM),Information and Coding Theory Symposium, Beijing, China, Aug. 2010

· IEEE International Conference on Ultra-Wideband (ICUWB), Vancouver, BC, Canada,Sep. 2009

· IEEE International Conference on Communications (ICC), Istanbul, Turkey, Jun. 2006;Symposium: Communications Theory

� Referee for the following journals

· IEEE Transactions on Information Theory

· IEEE Transactions on Signal Processing

· IEEE Transactions on Communications

· IEEE Transactions on Wireless Communications

· IEEE Transactions on Vehicular Technology

· IEEE Communications Letters

· IEEE/ACM Transactions on Networking

· Signal Processing (EURASIP)

� IST-FP6-027142 PULSERS Phase II: Pervasive Ultra-wideband Low Spectral Energy RadioParticipationin EUProjects

Systems; responsibility: Member of management board and leader of work-package 5—Multipleantenna systems for ultra-wideband

� IST-2002-507325 NEWCOM: Network of Excellence in Wireless Communications; responsi-bility: Researcher in project B—Ultra-wideband communications systems

Giuseppe Durisi

Publications:BookChapters

[B1] G. Durisi, U. G. Schuster, V. I. Morgenshtern, H. Bolcskei, and S. Shamai (Shitz), “In-formation theory of underspread WSSUS channels,” in Wireless Communications overRapidly Time-Varying Channels, F. Hlawatsch and G. Matz, Eds. Academic Press, Mar.2011.

Publications:JournalPapers

[J1] G. Durisi and H. Bolcskei, “High-SNR capacity of wireless communication channels in thenoncoherent setting: A primer,” Int. J. Electron. Commun. (AEU), Aug. 2011, invitedpaper, to appear.

[J2] G. Durisi, U. G. Schuster, H. Bolcskei, and S. Shamai (Shitz), “Noncoherent capacity ofunderspread fading channels,” IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 367 – 395,Jan. 2010.

[J3] U. G. Schuster, G. Durisi, H. Bolcskei, and H. V. Poor, “Capacity bounds for peak-constrained multiantenna wideband channels,” IEEE Trans. Commun., vol. 57, no. 9,pp. 2686–2696, Sep. 2009.

[J4] M. R. Casu and G. Durisi, “Implementation aspects of a transmitted-reference UWBreceiver,” Wirel. Commun. Mob. Comput., Special Issue: Ultrawideband for WirelessCommunications, vol. 5, no. 5, pp. 537–549, Aug. 2005.

[J5] G. Durisi and S. Benedetto, “Comparison between coherent and noncoherent receivers forUWB communications,” EURASIP J. Signal Process., Special Issue: UWB—State of theArt, no. 3, Mar. 2005.

[J6] G. Durisi, A. Tarable, J. Romme, and S. Benedetto, “A general method for error proba-bility computation of UWB systems for indoor multiuser communications,” J. Commun.Netw., Special Issue: Ultra-Wideband (UWB) Communications, vol. 5, no. 4, pp. 354–364,Dec. 2003.

[J7] G. Durisi and S. Benedetto, “Performance evaluation of TH-PPM in the presence ofmultiuser interference,” IEEE Commun. Lett., vol. 7, no. 5, May 2003.

Publications:JournalPapers UnderReview

[JR1] P. Kuppinger, G. Durisi, and H. Bolcskei, “Uncertainty relations and sparse signal re-covery for pairs of general signal sets,” IEEE Trans. Inf. Theory, Feb. 2011, submitted.[Online]. Available: http://arxiv.org/abs/1102.0522

Publications:ConferencePapers

[C1] E. Riegler, V. I. Morgenshtern, G. Durisi, S. Lin, B. Sturmfels, and H. Bolcskei, “Non-coherent SIMO pre-log via resolution of singularities,” in IEEE Int. Symp. Inf. Theory(ISIT), Saint Petersburg, Russia, Jul. 2011, to appear.

[C2] V. I. Morgenshtern, G. Durisi, and H. Bolcskei, “The SIMO pre-log can be larger thanthe SISO pre-log,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, U.S.A.,Jun. 2010, pp. 320 – 324.

[C3] P. Kuppinger, G. Durisi, and H. Bolcskei, “Where is randomness needed to break thesquare-root bottleneck?” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX,U.S.A., Jun. 2010, pp. 1578 – 1582.

[C4] P. Kuppinger, G. Durisi, and H. Bolcskei, “Improved sparsity thresholds through dic-tionary splitting,” in Proc. IEEE Inf. Theory Workshop (ITW), Taormina, Italy, Oct.2009, pp. 338 – 342, invited paper.

Giuseppe Durisi

[C5] G. Durisi, V. I. Morgenshtern, and H. Bolcskei, “On the sensitivity of noncoherent capac-ity to the channel model,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seoul, Korea,Jun. 2009, pp. 2174–2178.

[C6] U. G. Schuster, G. Durisi, H. Bolcskei, and H. V. Poor, “Capacity bounds for peak-constrained multiantenna wideband channels,” in Proc. IEEE Int. Symp. Inf. Theory(ISIT), Toronto, ON, Canada, Jul. 2008, pp. 1582–1586.

[C7] G. Durisi, H. Bolcskei, and S. Shamai (Shitz), “Capacity of underspread WSSUS fadingchannels under peak signal constraints,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT),Nice, France, Jun. 2007, pp. 156–160.

[C8] G. Durisi, H. Bolcskei, and S. Shamai (Shitz), “Capacity of underspread WSSUS fadingchannels in the wideband regime,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT),Seattle, WA, U.S.A., Jul. 2006, pp. 1500–1504.

[C9] G. Durisi, L. Dinoi, and S. Benedetto, “eIRA codes for coded modulation systems,” inProc. IEEE Int. Conf. Commun. (ICC), vol. 3, Istanbul, Turkey, Jun. 2006, pp.1125–1130.

[C10] M. R. Casu, G. Durisi, and S. Benedetto, “On the implementation of a transmitted-reference UWB receiver,” in Proc. Eur. Signal Process. Conf. (EUSIPCO), Antalya,Turkey, Sep. 2005, pp. 1–4.

[C11] U. G. Schuster, H. Bolcskei, and G. Durisi, “Ultra-wideband channel modeling on thebasis of information-theoretic criteria,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT),Adelaide, Australia, Sep. 2005, pp. 97–101.

[C12] G. Durisi and S. Benedetto, “Performance of coherent and noncoherent receivers forUWB communications,” in Proc. IEEE Int. Conf. Commun. (ICC), vol. 6, Paris,France, Jun. 2004, pp. 3429–3433.

[C13] J. Romme and G. Durisi, “Transmit-reference impulse radio systems using weightedcorrelation,” in IEEE Conf. Ultra Wideband Syst. Technol. (UWBST) Dig. Tech.Papers, Kyoto, Japan, Dec. 2004, pp. 141–15.

[C14] G. Durisi, J. Romme, and S. Benedetto, “A general method for SER computation of M-PAM and M-PPM UWB systems for indoor multiuser communications,” in Proc. IEEEGlobal Telecommun. Conf. (GLOBECOM), vol. 2, San Francisco, CA, U.S.A., Dec.2003, pp. 734–738.

[C15] G. Durisi, J. Romme, S. Benedetto, “Performance of TH and DS UWB multiaccesssystems in presence of multipath and channel narrowband interference,” in Proc. Int.Workshop Ultra-Wideband Syst. (IWUWBS), Oulu, Finland, Jun. 2003.

[C16] J. Romme, J. Siemons, and G. Durisi, “A method for the detection of the narrowbandinterferer,” in Proc. Int. Workshop Ultra-Wideband Syst. (IWUWBS), Oulu, Finland,Jun. 2003.

[C17] G. Durisi and S. Benedetto, “Performance evaluation and comparison of different mod-ulation schemes for UWB multiaccess systems,” in Proc. IEEE Int. Conf. Commun.(ICC), vol. 3, Anchorage, AK, U.S.A., May 2003, pp. 2187–2191.

[C18] G. Durisi and G. Romano, “Simulation analysis and performance evaluation of an UWBsystem in indoor multipath channel,” in IEEE Conf. Ultra Wideband Syst. Technol.(UWBST) Dig. Tech. Papers, Baltimore, MD, U.S.A., May 2002, pp. 255–258.

[C19] G. Durisi, G. Romano, “On the validity of Gaussian approximation to characterize themultiuser capacity of UWB TH PPM,” in IEEE Conf. Ultra Wideband Syst. Technol.(UWBST) Dig. Tech. Papers, Baltimore, MD, U.S.A., May 2002, pp. 157–161.

Publications:ConferencePapers UnderReview

Giuseppe Durisi

[CR1] G. Pope, M. Baumann, C. Studer, and G. Durisi, “Real-time principal componentpursuit,” submitted to Asilomar Conf. Signals, Syst., Comput., Pacific Grove CA,U.S.A., Nov. 2011.

[CR2] W. Yang, G. Durisi, V. I. Morgenshtern, and E. Riegler, “Capacity pre-log of SIMOcorrelated block-fading channels,” submitted to IEEE Int. Symp. Wirel. Comm. Syst.(ISWCS), Aachen, Germany, Nov. 2011.

Invited Talks

[T1] G. Durisi, “Handling the data flood in wireless communications”, Chalmers Universityof Technology, Gothenburg, Sweden, May. 2010.

[T2] G. Durisi, “On the noncoherent capacity of wireless channels of practical interest”, JointUMIC and ISS seminar, RWTH Aachen, Germany, Jun. 2009.

[T3] G. Durisi, “On the capacity of real-world fading channels”, ITG meeting—Algorithmsfor signal processing, Zurich, Switzerland, Mar. 2009.

[T4] G. Durisi, “Capacity bounds for peak-constrained multiantenna channels,” in Third IEEEWorkshop on Advanced Signal Processing for Wireless Communication Systems, Copen-hagen, Denmark, Nov. 2007.

CURRICULUM VITAE

Michael EladUpdated on July 5th, 2011

Office Address: Room 438, Taub CS Bldg., TECHNION, Haifa 32000, IsraelOffice Phone: +972-4-829-4169Electronic Mail Address: elad@cs.technion.ac.ilHome-Page: http://www.cs.technion.ac.il/˜elad

ACADEMIC DEGREES

1994–1997: D.Sc. in Electrical Engineering – The Technion – Haifa - Israel.

Graduated on September 1997. Final average - 96.6.

Specialization on: Signal and Image Processing, Computer Vision, Adap-tive filters.

Thesis: Super resolution Reconstruction of Continuous Image Sequences.

Supervisor: Prof. Arie Feuer.

1986–1988: M.Sc. in Electrical Engineering – The Technion – Haifa - Israel.

Graduated on February 1988. Final average - 95.0.

Specialization on: Signal and Image Processing, Communication.

Thesis: Digital Coding of Image Sequences with Motion Compensation.

Supervisor: Prof. David Malah.

1982–1986: B.Sc. in Electrical Engineering–The Technion–Haifa–Israel.

Graduated on February 1986. Final average - 91.6.

Specialization on: Communication, Control, Networks and Computers.

ACADEMIC APPOINTMENTS

2010–(Started on June 2010) – The Computer Science Department – The Tech-nion, Haifa 32000, Israel.Work: Professor.

2007–2010) – The Computer Science Department – The Technion, Haifa 32000,Israel.Work: Associate Professor.

2003–2007 (Started on October 2003, and till May 2007) – The ComputerScience Department – The Technion, Haifa 32000, Israel.Work: Senior Lecturer (tenure-track position). Teaching and performingresearch in the fields of signal and image processing and computer vision,with emphasis on signal representation and numerical algorithms.

1

2001–2003 (Started on October 2001, and till September 2003) Stanford Uni-versity.Work: Research Associate with the Computer Science department, and af-filiated to the Scientific-Computing & Computational Mathematic (SCCM)program, led by Prof. Gene Golub. My work concentrated on threeprojects, both in the area of inverse problems:

1. Collaborating with Prof. Gene Golub (CS - Stanford) and Prof. Pey-man Milanfar (UCSC), working on the reconstruction of 2D shapesfrom their complex moments.

2. Collaborating with Prof. David Donoho (Statistics – Stanford), work-ing on inverse problems in target detection/recognition, fast polarFourier transform, and sparse representations.

3. Collaborating with Prof. Peyman Milanfar (UCSC) and his students,working on super-resolution reconstruction of images.

PROFESSIONAL EXPERIENCE

2000–2001 (Started on February 2000, and till September 2001) Jigami, Israel.

Work: Heading the research division in the company - Working in thefields of data compression in general, and specializing on image and videoprocessing and coding.

1997–2000 (Started on January 1997, and till January 2000) HP-Laboratories,Israel.

Work: Research and Development in the fields of image processing, com-puter vision and pattern recognition.

Research projects include super-resolution reconstruction of images, fastface detection in images, optical flow estimation, documents classification,accurate (sub-pixel) edge detection, illumination estimation-variationalapproach, image restoration and demosaicing, and content based search-multimedia databases.

1993–1993 (6 months) Advanced Technologies Limited (ATL)–Atidim, Tel-Aviv.

Work: Defining a system in the fields of Geographical Information Systems(GIS) and Photogrametry.

1988–1993 Army service – Israeli Air Force.

Work: Project Officer, responsible to define and establish a large systemin the fields of Photogrametry, image processing, and digital archives.

2

RESEARCH INTERESTS

Inverse problems in signal and image processing, computer vision

• Super resolution and image restoration

• Optical flow and motion estimation

• Image priors, Bayesian approach

• Sparse decomposition of signals

• Nonlinear filtering of signals

• Stochastic estimators

• Image compression

• Video processing

Numerical analysis - optimization theory, Numerical Linear Algebra

• Large linear systems

• Linear programming and primal-dual methods

• Non-linear programming

• Dynamic systems (Kalman Filter)

• Eigenvalue problems

• L1 and L0 minimization

Machine learning algorithms

• Support Vector Machine (SVM) and related methods

• Application - Detection of faces in images

• Searching in multimedia databases

• Dimensionality reduction

TEACHING EXPERIENCE

2003–present. Lecturing the courses “Digital Image Processing” (236860) “Dig-ital Signal and Image Processing by Computer” (236327), “MathematicalMethods for Computer Science” (234299), “Introduction to Computer Sci-ence” (234114/7), and “Sparse and redundant representations and appli-cations in signal and image processing” (236601/2) – the CS Departmentin the Technion.

1999–2001 Lecturing the course “Introduction to Digital Image Processing” –the EE Department in the Technion.

1997–1998 Lecturing the course “Numerical Methods in Optimization” (046197)– the EE Department in the Technion.

1995–1996 Teaching the course “Introduction to Digital Signal Processing, asa teaching assistant of Prof. Boaz Porat – the EE Department in theTechnion.

3

1993–1995 Instructing in laboratories, and supervising under-graduate studentsfinal projects – the EE Department in the Technion.

1985–1988 Instructing in laboratories, and supervising under-graduate studentsfinal projects – the EE Department in the Technion.

PUBLIC PROFESSIONAL ACTIVITIES

Reviews for Journal publications:

1. IEEE Trans. On Image Processing

2. IEEE Trans. On Pattern Analysis and Machine Intelligence (PAMI)

3. IEEE Trans. On Information Theory

4. Applied and Computational Harmonic Analysis

5. Journal of the Optical Society of America (JOSA)

6. EURASIP Journal on Applied Signal Processing

7. SIAM Review

8. International Journal of Computer Vision

9. Signal Processing: Image communication

10. SIAM Matrix Analysis

11. SIAM Imaging Science

12. ISF, NSF and BSF proposals.

FACULTY AND TECHNION ADMINISTRATIVE JOBS

2009 – present. Vice Dean for Public Affairs - Alumni and Industry Relations,Computer Science Dept., Technion.

2009 – present. Development Committee member, Computer Science Dept.,Technion.

2007 – 2009. Coordinator for open days for undergraduates studies.

2005 – 2009. Computing Committee member, Computer Science Dept., Tech-nion.

2004 – 2006. Graduate Studies Committee member, Computer Science Dept.,Technion.

2003 – 2006. Council Secretary, Computer Science Dept., Technion.

4

AWARDS AND HONORS

2010 – The Hershel-Rich Award for Innovation: A Technion award for the workon Super-Resolution (with Matan Protter).

2009 – Best lecturer award – The Technion – Israel Institute of Technology.

2008 – The Henry Taub Prize for Academic Excellence: A Technion award forresearch excellence.

2007 – The Solomon Simon Mani award for excellence in teaching (six awardswere given) – The Technion – Israel Institute of Technology.

2006 – Best reviewer award (ten awards were given) - IEEE Trans. on Imageprocessing journal.

2005 – Best lecturer award – The Technion – Israel Institute of Technology.

2004 – Best lecturer award – The Technion – Israel Institute of Technology.

2003 – Technion Management Career Development Chair – The Technion –Israel Institute of Technology.

2001 – Best lecturer award – The Technion – Israel Institute of Technology.

2000 – Best lecturer award – The Technion – Israel Institute of Technology.

1996 – Guthwirth - Special Excellence Scholarship – During the Ph.D. studies.

1987 – Wiener Excellence Award– During the M.Sc. studies.

1985 – ITT scholarship for excellence – During the undergraduate studies.

GRADUATE STUDENTS

Studies Completed - Ph.D.:

1. Michal Aharon, (May 2004 – November 2006), Learning dictionaries forsparse representations.

2. Matan Protter (March 2006 – January 2011), The NL-Means algorithmand some extensions.

Studies Completed - M.Sc.:

1. Einat Kidron, M.Sc. (January 2004 - July 2005), co-advisor: Yoav Schech-ner, Video-audio localization via sparsity.

2. Boaz Matalon, (May 2004 - November 2006), co-advisor: Michael Zibulevsky.Denoising using over-complete representations.

5

3. Dima Datsenko, (February 2005 - November 2006), Example-based priorsin inverse problems.

4. Svetlana Raboi, (July 2004 - May 2007), co-advisor: Arie Feuer. On therecovery of missing samples via sparsity conditions.

5. Raviv Brueller, (June 2005 – October 2007), co-advisor: Yacov Hel-Or(IDC). Face detection - Extensions of the MRC algorithm.

6. Ori Bryt, (November 2006 – November 2009), Compression of face imagesusing sparse and redundant representations and the K-SVD algorithm.

7. Raja Giryes, (October 2007 – October 2009), co-advisor: Yonina Eldar,Automatic parameter tuning for inverse problems.

8. Neta Shoham, (April 2007 – January 2010), Generalization of the K-SVDalgorithm for pattern detection purposes.

Ph.D. Theses in Progress:

1. Ron Rubinstein, (May 2004 – present), Analysis versus synthesis in reg-ularization of inverse problems – has been transferred to the direct PhDprogram on February 2006.

2. Joseph Shtok (October 2007 – present), Computerized tomography com-bined with sparse and redundant representations and learned dictionaries.

3. Javier Turek (March 2008 - present), co-advisor: Irad Yavneh, Algorithmsfor MMSE estimator approximation for sparse modeling.

4. Idan Ram, (October 2009 – present), co-advisor: Israel Cohen (EE), Dif-fusion maps and sparse representations – manifold learning methods fordata processing.

5. Boaz Ophir, (November 2009 – present), Multi-scale dictionary learningalgorithms.

6. Raja Giryes, (November 2009 – present), On the stability of Sparse Rep-resentations.

7. Amir Adler, (June 2010 – present), co-advisor: Yacov Hel-Or (The Inter-disciplinary Center, CS), Image processing with Sparse and RedundantRepresentations.

M.Sc. Theses in Progress:

1. Dana Segev (November 2008 - present), co-advisor: Yoav Schechner, Mul-timodal signal processing using sparse representations.

6

2. Tomer Faktor, (March 2009 - present), co-advisor: Yonina Eldar, Moleculemodeling: sparse representation modeling of data with atom interconnec-tions.

RESEARCH GRANTS

2009–2012: European Commission, FP7, FET program: SMALL project.[360,080 Euro]

2008–2012: Israel Science Foundation Grant (ISF): Novel Super-ResolutionReconstruction Algorithms with no Explicit Motion-Estimation. [147KNIS/year].

2008–2012: Israel Science Foundation Grant (ISF): Auditory Computer-Vision.With Y. Schechner. [184K NIS/year].

2007 –2009: Ministry of Industry, Trade and Labor. MAGNET program,(BMP consortium): Development and solutions of photonics technologiesfor spectroscopy diagnostics and treatment. With R. Kimmel. [app. 230KILS (per year)].

2007 – 2008: Center for The Security Science and Technology, Technion.Jointly with R. Kimmel [29K$].

2005 – 2009: USA-Israel Binational Science Foundation Grant: Analysis versussynthesis approaches in signal-priors for the solution of inverse problems.With D.L. Donoho and P. Milanfar. [21,375$ per year].

2005 – 2008: Israel Science Foundation Grant (ISF): Sparsity and redundancyin signal representation - design of optimal transforms. With A.M. Bruck-stein. [17K$ equipment (for the first year) and 152K ILS per year].

2005: ISF New Faculty Equipment Support Grant: for equipping a signal/imageprocessing lab. [42K$].

2004 – 2007: Ministry of Industry, Trade and Labor. MAGNET program,(AVNET 37 consortium): 3D face recognition algorithms. With R. Kim-mel. [app. 280K ILS (per year)].

7

LIST OF PUBLICATIONS

THESES

1. M.Sc. thesis: “Digital Coding of Image Sequences with Motion Com-pensation”, 1988, the Technion, Israel Institute of Technology.

2. D.Sc. thesis: “Super resolution Reconstruction of Continuous Im-age”, 1997, the Technion, Israel Institute of Technology.

BOOKS

1. Michael Elad, “Sparse and Redundant Representation – From The-ory to Applications in Signal and Image Processing”, Springer, New-York, August 2010.

JOURNAL PAPERS

1. M. Elad and A. Feuer, “Restoration of Single Super-Resolution ImageFrom Several Blurred, Noisy and Down-Sampled Measured Images”,IEEE Trans. on Image Processing, Vol. 6, no. 12, pp. 1646-58,December 1997.

2. M. Elad and A. Feuer, “Recursive optical Flow Estimation - AdaptiveFiltering approach”, Journal of Visual Comm. and Image Represen-tation, Vol. 9, pp. 119-138, June 1998.

3. M. Elad and A. Feuer, “Super-Resolution Restoration of ContinuousImage Sequence - Adaptive Filtering Approach”, IEEE Trans. onImage Processing, Vol. 8. no. 3, pp. 387-395, March 1999.

4. M. Elad and A. Feuer, “Super-Resolution Reconstruction of Contin-uous Image Sequence”, IEEE Trans. On Pattern Analysis and Ma-chine Intelligence (PAMI), Vol. 21, no. 9, pp. 817-834, September1999.

5. M. Elad and Y. Hel-Or, “A Fast Super-Resolution ReconstructionAlgorithm for Pure Translational Motion and Common Space In-variant Blur”, the IEEE Trans. on Image Processing, Vol.10, no.8,pp.1187-93, August 2001.

6. M. Elad and A.M. Bruckstein, “A Generalized Uncertainty Principleand Sparse Representation in Pairs of RˆN Bases”, IEEE Trans. OnInformation Theory, Vol. 48, pp. 2558-2567, September 2002.

7. M. Elad, “On the Origin of the Bilateral Filter and Ways to ImproveIt”, IEEE Transactions On Image Processing, Vol. 11, Number 10,pp. 1141-1151, October 2002.

8. M. Elad, Y. Hel-Or, and R. Keshet, “Rejection based classifier forface detection”, Pattern Recognition Letters, Vol. 23, Issue 12, pp.1459-1471, October 2002.

8

9. D. Donoho and M. Elad, “Maximal Sparsity Representation via l1Minimization”, the Proc. Nat. Aca. Sci., Vol. 100, no. 5, pp.2197-2202, March 2003.

10. R. Kimmel, M. Elad, D. Shaked, R. Keshet, and I. Sobel, “A Vari-ational Framework to Retinex”, International Journal of ComputerVision, Vol. 52, No. 1, pp. 7-23, April 2003.

11. A. Bruckstein, M. Elad, and R. Kimmel, “Down Scaling for BetterTransform Compression”, IEEE Trans. on Image Processing, Vol.12, No. 9, pp. 1132-44, Sept. 2003.

12. M. Elad, R. Kimmel, D. Shaked, and R. Keshet, “Reduced Com-plexity Retinex Algorithm Via the Variational Approach”, Journalon Visual Communication and Image Representation, Vol.14, No. 4,pp. 369-388, December 2003.

13. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Advances andChallenges in Super-Resolution”, the International Journal of Imag-ing Systems and Technology, Vol. 14, pp. 47-57, April 2004.

14. M. Elad, P. Milanfar, and Gene Golub, “Shape from Moments - AnEstimation Theory Perspective”, IEEE Trans. on Signal Processing,Vol. 52, No. 7, pp. 1814-1829, July 2004.

15. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Fast and Ro-bust Multi-Frame Super-resolution”, IEEE Transactions on ImageProcessing, vol. 13, no. 10, pp. 1327-1344, October 2004.

16. J.-L. Starck, M. Elad, and D.L. Donoho, “Redundant MultiscaleTransforms and their Application for Morphological Component Anal-ysis”, the Journal of Advances in Imaging and Electron Physics, Vol.132, pp. 287-348, 2004.

17. J. Tsaig, M. Elad, P. Milanfar, and G. Golub, “Variable projectionfor near-optimal filtering in low bit-rate block coders”, IEEE Trans.on Circuits and Systems for Video Technology, Vol. 15, No. 1, pp.154-160, January 2005.

18. R. Kimmel, D. Shaked, M. Elad, and I. Sobel, “Space DependentColor Gamut Mapping: A Variational Approach”, IEEE Transac-tions on Image Processing, Vol. 14, pp. 796-803, June 2005.

19. J.L. Starck, M. Elad, and D.L. Donoho, “Image decomposition viathe combination of sparse representations and a variational approach”,the IEEE Trans. On Image Processing, Vol. 14, pp. 1570-1582, Oc-tober 2005.

20. M. Elad, P. Teo, and Y. Hel-Or, “On the Design of Filters for Gradient-Based Motion Estimation”, Journal of Mathematical Imaging andVision, Vol. 23, pp. 345-365, November 2005.

21. G. Boutry, M. Elad, G. Golub, and P. Milanfar, “The GeneralizedEigenvalue Problem for Non-Square Pencils Using A Minimal Per-turbation Approach”, SIAM Journal on Matrix Analysis and Appli-cations, Vol. 27, pp. 582-601, November 2005.

9

22. M. Elad, J-L. Starck, P. Querre, and D.L. Donoho, “SimultaneousCartoon and Texture Image Inpainting Using Morphological Compo-nent Analysis (MCA)”, the Journal on Applied and ComputationalHarmonic Analysis, Vol. 19, pp. 340-358, November 2005.

23. D.L. Donoho, M. Elad, and V. Temlyakov, “Stable Recovery of SparseOvercomplete Representations in the Presence of Noise”, the IEEETrans. On Information Theory, Vol. 52, pp. 6-18, January 2006.

24. S. Farsiu, M. Elad, and P. Milanfar, “Multi-Frame Demosaicing andSuper-Resolution of Color Images”, the IEEE Trans. On Image Pro-cessing, Vol. 15, pp. 141-159, January 2006.

25. D.L. Donoho and M. Elad, “On the Stability of the Basis Pursuitin the Presence of Noise”, EURASIP Signal Processing Journal, Vol.86, No. 3, pp. 511-532, March 2006.

26. M. Aharon, M. Elad, and A.M. Bruckstein, “On the Uniqueness ofOvercomplete Dictionaries, and a Practical Way to Retrieve Them”,the Journal of Linear Algebra and Applications, Vol. 416, pp. 48-67,July 2006.

27. J. Bobin, Y. Moudden, J.-L. Starck, and M. Elad, “Morphological Di-versity and Source Separation”, the IEEE Signal Processing Letters,Vol. 13(7), pp. 409-412, July 2006.

28. M. Elad, “Sparse Representations are Most Likely to be the SparsestPossible”, EURASIP Journal on Applied Signal Processin, Vol. 2006(2006), Article ID 96247, 12 pages.

29. S. Farsiu, M. Elad, and P. Milanfar, “Video-to-Video Dynamic Super-Resolution for Grayscale and Color Sequences”, EURASIP Journalon Applied Signal Processing, Vol. 2006 (2006), Article ID 61859, 15pages.

30. A. Averbuch, R. Coifman, D.L. Donoho, M. Elad, and M. Israeli,“Fast and Accurate Polar Fourier Transform”, the Applied and Com-putational Harmonic Analysis journal, Vol. 21(2), pp. 145-167,September 2006.

31. M. Aharon, M. Elad, and A.M. Bruckstein, “The K-SVD: An Algo-rithm for Designing of Overcomplete Dictionaries for Sparse Repre-sentation”, IEEE Trans. On Signal Processing, Vol. 54, No. 11, pp.4311–4322, November 2006.

32. M. Elad and M. Aharon, “Image Denoising Via Sparse and Redun-dant representations over Learned Dictionaries”, IEEE Trans. onImage Processing, Vol. 15, No. 12, pp. 3736–3745, December 2006.

33. M. Elad, “Why Simple Shrinkage is Still Relevant for RedundantRepresentations?”, IEEE Trans. On Information Theory, Vol. 52,No. 12, pp. 5559–5569, December 2006.

10

34. E. Kidron, Y.Y. Schechner, and M. Elad, “Cross-Modality Localiza-tion via Sparsity”, IEEE Trans. on Signal Processing, Vol. 55, No.4, pp. 1390–1404, April 2007.

35. M. Elad and D. Datsenko, “Example Based regularization Deployedto Super-Resolution Reconstruction of a Single Image”, The Com-puter (a special issue on super resolution methods), Vol. 50, No. 4,pp. 1–16, April 2007.

36. M. Elad, P. Milanfar, and R. Rubinstein, “Analysis Versus Synthesisin Signal Priors”, Inverse Problems. Vol. 23, No. 3, pp. 947–968,June 2007.

37. D.L. Donoho, M. Elad, and V.N. Temlyakov, “On Lebesgue-TypeInequalities for Greedy Approximation”, Journal of ApproximationTheory, Vol. 147, No. 2, pages 185–195, August 2007.

38. D. Datsenko and M. Elad, “Example-Based Single Image Super-Resolution: A Global MAP Approach with Outlier Rejection”, Jour-nal of Multidimensional System and Signal Processing, Vol. 18, No.2-3, pp. 103–121, September 2007.

39. M. Elad, R. Goldenberg, and R. Kimmel, “Low Bit-Rate Compres-sion of Facial Images”, IEEE Trans. on Image Processing, Vol. 16,No. 9, pp. 2379–2383, September 2007.

40. M. Elad, B. Matalon, and M. Zibulevsky, “Coordinate and Sub-space Optimization Methods for Linear Least Squares with Non-Quadratic Regularization”, Applied and Computational HarmonicAnalysis, Vol. 23, pp. 346–367, November 2007.

41. M. Elad, “Optimized Projections for Compressed-Sensing”, IEEETrans. on Signal Processing, Vol. 55, No. 12, pp. 5695–5702, De-cember 2007.

42. J. Mairal, M. Elad, and G. Sapiro, “Sparse Representation for ColorImage Restoration”, IEEE Trans. on Image Processing, Vol. 17, No.1, pp. 53–69, January 2008.

43. J. Mairal, G. Sapiro, and M. Elad, “Learning Multiscale Sparse Rep-resentations for Image and Video Restoration”, SIAM MultiscaleModeling and Simulation, Vol. 7, No. 1, pp. 214–241, April 2008.

44. O. Bryt and M. Elad, “Compression of Facial Images Using the K-SVD Algorithm”, Journal of Visual Communication and Image Rep-resentation, Vol. 19, No. 4, pp. 270–283, May 2008.

45. M. Aharon and M. Elad, “Sparse and Redundant Modeling of ImageContent Using an Image-Signature-Dictionary”, SIAM Journal onImaging Sciences, Vol. 1, No. 3, pp. 228–247, July 2008.

46. A.M. Bruckstein, M. Elad, and M. Zibulevsky, “On the Uniqueness ofNonnegative Sparse Solutions to Underdetermined Systems of Equa-tions”, IEEE Transactions on Information Theory, Vol. 54, No. 11,pp. 4813–4820, October 2008.

11

47. J. Shtok and M. Elad, “Analysis of the Basis Pursuit Via the CapacitySets”, The Journal of Fourier Analysis and Applications, Vol. 14, No.5-6, pp. 688–711, December 2008.

48. M. Protter, M. Elad, H. Takeda, and P. Milanfar, “Generalizing theNon-Local-Means to Super-Resolution Reconstruction”, IEEE Trans-actions on Image Processing, Vol. 18, No. 1, pp. 36–51, January2009.

49. M. Protter and M. Elad, “Image Sequence Denoising Via Sparse andRedundant Representations”, IEEE Trans. on Image Processing, Vol.18, No. 1, pp. 27–36, January 2009.

50. A.M. Bruckstein, D.L. Donoho, and M. Elad, “From Sparse Solutionsof Systems of Equations to Sparse Modeling of Signals and Images”,SIAM Review, Vol. 51, No. 1, pp. 34–81, February 2009.

51. M. Protter and M. Elad, “Super-Resolution with Probabilistic Mo-tion Estimation”, IEEE Transactions on Image Processing, Vol. 18,No. 8, pp. 1899–1904, August 2009.

52. H. Takeda, P. Milanfar, M. Protter, and M. Elad, “Super-resolutionWithout Explicit Subpixel Motion Estimation”, IEEE Transactionson Image Processing, Vol. 18, No. 9, pp. 1958–1975, September2009.

53. M. Elad and I. Yavneh, “A Plurality of Sparse Representations isBetter than the Sparsest One Alone”, IEEE Transactions on Infor-mation Theory, Vol. 55, No. 10, pp. 4701–4714, October 2009.

54. J.M. Fadili, J.-L. Starck, M. Elad and D.L. Donoho “ReproducibleResearch in Signal and Image Decomposition and Inpainting”, Com-puting in Science & Engineering, Vol. 12 No. 1, pp. 44–62, January2010.

55. R. Rubinstein, M. Zibulevsky, and M. Elad, “Double Sparsity: Learn-ing sparse dictionaries for sparse signal approximation”, IEEE Trans-actions on Signal Processing, Vol. 58 No. 3, pp. 1553–1564, March2010.

56. M. Elad and M. Zibulevsky, “Iterated Shrinkage Algorithms in Signaland Image Processing”, IEEE Signal Processing Magazine, Vol. 27,No. 3, pp. 76–88, May 2010.

57. M. Elad, M.A.T. Figueiredo, and Y. Ma, “On the Role of Sparse andRedundant Representations in Image Processing”, IEEE Proceedings- Special Issue on Applications of Compressive Sensing and SparseRepresentation, Vol. 98, No. 6, pp. 972-982, April 2010.

58. R. Rubinstein, A.M. Bruckstein, and M. Elad, “Dictionaries for SparseRepresentation Modeling”, IEEE Proceedings - Special Issue on Ap-plications of Compressive Sensing and Sparse Representation, Vol.98, No. 6, pp. 1045–1057, April 2010.

12

59. M. Protter, I. Yavneh, and M. Elad, “Closed-Form MMSE Estima-tion for Signal Denoising Under Sparse Representation ModellingOver a Unitary Dictionary”, IEEE Transactions on Signal Process-ing, Vol. 58, No. 7, pp. 3471–3484, July 2010.

60. Z. Ben-Haim, Y.C. Eldar, and M. Elad, “Near-Oracle Performanceof Basis Pursuit under Random Noise”, IEEE Transactions on SignalProcessing, Vol. 58, No. 10, pp. 5030–5043, October 2010.

ACCEPTED JOURNAL PAPERS

61. R. Giryes, M. Elad, and Y.C. Eldar, “The projected GSURE for au-tomatic parameter tuning in iterative shrinkage methods”, submittedto Applied Computational Harmonic Analysis.

62. J.S. Turek, I. Yavneh, M. Protter, and M. Elad, “On MMSE andMAP denoising under sparse representation modeling over a unitarydictionary”, submitted to Applied Computational Harmonic Analy-sis.

63. I. Ram, M. Elad, and I. Cohen, “Generalized Tree-Based WaveletTransform”, submitted to IEEE Trans. on Signal Processing.

64. A. Adler, V. Emiya, M.G. Jafari, M. Elad, R. Gribonval and M.D.Plumbley, “Audio Inpainting”, to appear in IEEE Trans. on Audio,Speech and Language Processing.

65. B. Ophir, M. Lustig, and M. Elad, “Multi-Scale Dictionary Learn-ing using Wavelets”, to appear in IEEE Selected Topics in SignalProcessing.

SUBMITTED JOURNAL PAPERS

66. J. Shtok, M. Elad, and M. Zibulevsky, “Spatially-Adaptive Recon-struction in Computed Tomography Based on Statistical Learning”,submitted to IEEE Transactions on Medical Imaging.

67. I. Ram, M. Elad, and I. Cohen, “Generalized Tree-Based WaveletTransform”, submitted to IEEE Trans. on Signal Processing.

68. T. Faktor, Y.C. Eldar, and M. Elad, “Exploiting Statistical Depen-dencies in Sparse Representations for Signal Recovery”, submitted toIEEE Trans. on Signal Processing.

69. R. Giryes and M. Elad, “RIP-Based Near-Oracle Performance Guar-antees for Subspace-Pursuit, CoSaMP, and Iterative Hard-Thresholding”,submitted to IEEE Trans. on Signal Processing.

70. S. Nam, M.E. Davies, M. Elad, and R. Gribonval, “The CosparseAnalysis Model and Algorithms”, submitted to Applied Computa-tional Harmonic Analysis (ACHA).

13

PATENTS

1. Michael Elad, Renato Kresch, and Yacov Hel-Or, “ApproximatedInvariant Method for pattern detection”, US Patent # 6,337,927,January 8, 2002.

2. Craig Gotsman, Daniel Keren, Michael Elad, “Method and systemfor detecting and classifying objects in an image”, US Patent #6,501,857, December 31, 2002.

3. Oded Shmueli, Carl Staelin, Darryl Greig and Michael Elad, “Auto-matic categorization of documents using document signatures”, USPatent # 6,442,555, August 27, 2002.

4. Craig Gotsman, Daniel Keren, Michael Elad, “Template matchingsystem for images”, US Patent # 6,628,834, September 30, 2003.

5. Renato Keshet, Danny Barash, Doron Shaked, Michael Elad, andRon Kimmel, “Bilateral filtering in a demosaicing process”, US Patent# 6,816,197, November 9, 2004 .

6. Ron Kimmel, Doron Shaked, Michael Elad, and Irwin Sobel, “SpaceVarying Gamut Mapping”, US Patent # 6,882,449 April 19, 2005.

7. Michael Elad and Doron Shaked, “Method and apparatus for sub-pixel edge detection”, US Patent # 6,917,721, July 12, 2005.

8. Ronny Kimmel, Michael Elad, Doron Shaked, Renato Keshet, andIrwin Sobel, “System and method for image enhancement, dynamicrange compensation and illumination correction”, US Patent # 6,941,028,September 6, 2005.

9. Ran Bar-Sela, Michael Elad, Jacob Margolin, Menashe Benjamin,and Yosef Reichman, “Data Distribution System”, European Patent# EP0934571, 11 August 2001, US patent # 7,200,858, April 3, 2007.

10. Peyman Milanfar, Sina Farsiu, and Michael Elad, “Robust recon-struction of high resolution grayscale images from a sequence of lowresolution frames”, US Patent application # 20,070,217,713, Septem-ber 20, 2007.

11. Peyman Milanfar, Sina Farsiu, and Michael Elad, “Dynamic recon-struction of high-resolution video from color-filtered low-resolutionvideo-to-video super-resolution”, US Patent # 7,379,612, May 27,2008.

12. M. Aharon, M. Elad and A.M. Bruckstein, “System and MethodFor Designing of Dictionaries For Sparse Representation”, US Patentapplication # 20,080,170,623. July 17, 2008

13. PeymanMilanfar, Sina Farsiu, and Michael Elad, “System and methodfor robust multi-frame demosaicing and color super-resolution”, USPatent # 7,412,107, August 12, 2008.

14

14. Matan Protter and Michael Elad, “Apparatus and method for im-proving image resolution using fuzzy motion estimation”, US Patentapplication #20,090,110,285. April 30, 2009.

OTHER PUBLICATIONS

1. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Simultaneous De-mosaicing and Resolution Enhancement From Under-Sampled ImageSequences”, (Book Chapter) in Single-Sensor Imaging: Methods andApplications for Digital Cameras, CRC Press 2008, Rastislav Lukac(Editor).

2. M. Protter and M. Elad, “Super-Resolution With Probabilistic Mo-tion Estimation” , (Book Chapter) in Super-Resolution Imaging,CRC Press, 2010, Peyman Milanfar (Editor).

3. M. Elad, “Five Lectures on Sparse and Redundant RepresentationsModelling of Images”, Park-City Mathematics Series (PCMI) Lecture-Notes, 2011.

CONFERENCES AND LECTURES

Refereed Papers in Conference Proceedings:

1. M. Elad and A. Feuer, “Super-Resolution Restoration of Continu-ous Image Sequences Using the LMS Algorithm”, The 18-th IEEEConference in Israel, Tel-Aviv, March 1995.

2. M. Elad and A. Feuer, “Super-Resolution Reconstruction of an Im-age”, the 19-th IEEE Conference in Israel, Jerusalem, November1996.

3. M. Elad and A. Feuer, “Recursive Optical Flow Estimation - Adap-tive Filtering approach”, the 19-th IEEE Conference in Israel, Jerusalem,November 1996.

4. T. Sagi, A. Feuer and M. Elad, “The Periodic Step Gradient De-scent Algorithm - General Analysis and Application to the Super-Resolution Reconstruction Problem”, EUSIPCO 1998.

5. M. Elad, P. Teo, and Y. Hel-Or, “Optimal Filters For Gradient BasedMotion Estimation”, International Conference on Computer Vision -ICCV 1999, Corfu, Greece, pp. 559-565, September 1999.

6. M. Elad and A. Feuer, “Super-Resolution Reconstruction of Continu-ous Image Sequences”, International Conference on Image Processing- ICIP 1999, Kobe, Japan, October 1999.

15

7. M. Elad, Y. Hel-Or and R. Keshet, “Pattern Detection Using A Max-imal Rejection Classifier“, The 4th International Workshop on VisualForm, Capri, Italy, May 28-30, 2001.

8. A. Bruckstein, M. Elad, and R. Kimmel, “Down Scaling for BetterTransform Compression”, Scale-Space workshop, ICCV 2001, Van-couver, Canada, July 2001.

9. M. Elad and A.M. Bruckstein, “On Sparse Representations”, ICIP2001, Tsaloniky, Greece, November 2001.

10. R. Kimmel, M. Elad, D. Shaked, R. Keshet, and I. Sobel, “A Vari-ational Framework to Retinex”, SPIE Electronic Imaging, San-Jose,USA, Vol. 4672, January 2002.

11. M. Elad, A. Tal, and S. Ar, “Content based Retrieval of VRML Ob-jects - An iterative and Interactive Approach”, The 6th Eurographicsworkshop in Multimedia, Manchester UK, September 2001.

12. M. Elad, “Analysis of the Bilateral Filter”, The 36th Asilomar onSignals, Systems and Computers, Pacific Grove, CA. November 2002.

13. M. Elad, P. Milanfar, and G. Golub, “Estimation of Shape fromMoments - Inverse Problem”, The 3 6th Asilomar on Signals, Systemsand Computers, Pacific Grove, CA. November 2002.

14. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Robust Super-Resolution”, to appear in the Proceedings of ICIP 2003.

15. J. Tsaig, M. Elad, G. Golub, and P. Milanfar, “Optimal Frameworkfor Low Bit-Rate Block Coders”, the Proceedings of ICIP 2003.

16. X. Huo, M. Elad, A. G. Flesia, B. Muise, R. Stanfill, J. Friedman, B.Popescu, J. Chen, A. Mahalanobis, D. L. Donoho, “Optimal reduced-rank quadratic classifiers using the Fukunaga-Koontz transform, withapplications to automated target recognition”, SPIE’s 7th Interna-tional Symposium on Aerospace/Defense Sensing, April 2003, Or-lando, FL.

17. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Robust Shiftand Add Approach to Super-resolution”, SPIE Annual meeting, 3–8August 2003, San Diego, California, USA.

18. J.-L. Starck, M. Elad, and D. L. Donoho, “Image Decomposition:Separation of Texture from Piece-Wise Smooth Content”, SPIE an-nual meeting, 3–8 August 2003, San Diego, California, USA.

19. A. Averbuch, R.R. Coifman, D.L. Donoho, M. Elad, and M. Israeli,“Accurate and Fast Polar Fourier Transform”, The 37th Asilomaron Signals, Systems and Computers, Pacific Grove, CA. November2003.

20. S. Farsiu, M. Elad, and P. Milanfar, “Multi-Frame Demosaicing andSuper-Resolution from Under-Sampled Color Images”, IS&T - SPIESymposium on Electronic Imaging 2004, San Jose, CA, January 18-22, 2004.

16

21. A. Segall, M. Elad, P. Milanfar, R. Webb and C. Fogg, “ImprovedHigh-Definition Video by Encoding at an Intermediate Resolution,”Proceedings of the SPIE Conference on Visual Communications andImage Processing, San Jose, CA, January 18-22, 2004.

22. S. Farsiu, D. Robinson, M. Elad, and P. Milanfar, “Dynamic Demo-saicing and Color Super-Resolution of Video Sequences”, Proceedingsof SPIE Conference on Image Reconstruction from Incomplete DataIII, - Volume 5562, October 2004.

23. M. Elad, “Retinex by Two Bilateral Filters”, Scale-Space 2005, Hofgeis-mar, Germany, April 2005.

24. E. Kidron, Y.Y. Schechner, and M. Elad, “Pixels That Sound”,CVPR 2005, June 20-26, 2005.

25. S. Farsiu, M. Elad, and P. Milanfar, Constrained, globally optimal,multi-frame motion estimation, Proc. of the 2005 IEEE workshop onstatistical signal processing, Bordeaux, France.

26. M. Aharon, M. Elad, and A.M. Bruckstein, “K-SVD and its non-negative variant for dictionary design”, Proceedings of the SPIE con-ference wavelets, Vol. 5914, July 2005.

27. B. Matalon, M. Zibulevsky, and M. Elad, “Improved denoising ofimages using modeling of the redundant contourlet transform”, Pro-ceedings of the SPIE conference wavelets, Vol. 5914, July 2005.

28. J.-L. Starck, Y. Moudden, J. Bobin, M. Elad, and D.L. Donoho,“Morphological Component Analysis”, Proceedings of the SPIE con-ference wavelets, Vol. 5914, July 2005.

29. M. Elad, “”Shrinkage For Redundant Representations”, Proceedingsof SPARSE’05, Rennes, France, November 2005.

30. M. Aharon, M. Elad, and A.M. Bruckstein, “The K-SVD Algorithm”,Proceedings of SPARSE’05, Rennes, France, November 2005.

31. B. Matalon, M. Elad, and M. Zibulevsky, “Image Denoising with theContourlet Transform”, Proceedings of SPARSE’05, Rennes, France,November 2005.

32. S. Farsiu, M. Elad, and P. Milanfar, “A Practical Approach to Super-Resolution”, Proc. of the SPIE: Visual Communications and ImageProcessing, San-Jose, January 2006.

33. Charest, M., M. Elad, and P. Milanfar, “A General Iterative Regu-larization Framework For Image Denoising”, Proc. of the 40th Con-ference on Information Sciences and Systems, Princeton, NJ, March2006.

34. M. Elad and M. Aharon, “Image denoising via learned dictionariesand sparse representation”, CVPR, NY, June 17-22, 2006.

35. M. Elad, B. Matalon, and M. Zibulevsky, “Image denoising withshrinkage and redundant representations”, CVPR, NY, June 17-22,2006.

17

36. M. Elad, P. Milanfar, and R. Rubinstein, “Analysis versus synthesisin signal priors”, EUSIPCO, Florence, Italy, September 4-8, 2006.

37. M. Elad, B. Matalon, J. Shtok, and M. Zibulevsky, “A Wide-AngleView at Iterated Shrinkage Algorithms”, SPIE (Wavelet XII), San-Diego CA, August 26-29, 2007.

38. M. Protter and M. Elad, “ Sparse and Redundant Representationsand Motion-Estimation-Free Algorithm for Video Denoising”, SPIE(Wavelet XII), San-Diego CA, August 26-29, 2007.

39. J. Mairal, G. Sapiro, and M. Elad, “Multiscale sparse image repre-sentation with learned dictionaries”, ICIP 2007, San-Antonio Texas,September 16-19, 2007.

40. A.M. Bruckstein, M. Elad, and M. Zibulevsky, “A Non-Negative andSparse Enough Solution of an Underdetermined Linear System ofEquations is Unique”, ISCCSP 2008, special session on Sparsity inSignal and Image Processing, Malta, March 11-14, 2008.

41. A.M. Bruckstein, M. Elad, and M. Zibulevsky, “On the Uniquenessof Non-Negative Sparse and Redundant Representations”, ICASSP2008, special session on Compressed Sensing, Las-Vegas, Nevada,March 30, 2008.

42. J. Shtok, M. Elad, and M. Zibulevsky, “Adapted Filtered Back Pro-jection Computed Tomography”, The IEEE 25-th Convention of Elec-trical and Electronics Engineers in Israel, Eilat Israel, December 3-5,2008.

43. N. Shoham and M. Elad, “Alternating KSVD-Denoising for TextureSeparation”, The IEEE 25-th Convention of Electrical and Electron-ics Engineers in Israel, Eilat Israel, December 3-5, 2008.

44. M. Protter, I. Yavneh and M. Elad, “Closed-Form MMSE for De-noising Signals Under Sparse-Representation Modelling”, The IEEE25-th Convention of Electrical and Electronics Engineers in Israel,Eilat Israel, December 3-5, 2008.

45. O. Bryt and M. Elad, “Improving the K-SVD Facial Image Com-pression Using a Linear Deblocking Method”, The IEEE 25-th Con-vention of Electrical and Electronics Engineers in Israel, Eilat Israel,December 3-5, 2008.

46. R. Giryes, Y.C. Eldar and M. Elad, “Automatic Parameter Settingfor Iterative Shrinkage Methods”, The IEEE 25-th Convention ofElectrical and Electronics Engineers in Israel, Eilat Israel, December3-5, 2008.

47. I. Yavneh and M. Elad, “MMSE Approximation for Denoising UsingSeveral Sparse Representations”, the 4th World Conference of theIASC (International Association for Statistical Computing), Decem-ber 5-8, 2008, Yokohama, Japan.

18

48. J. Mairal, M. Elad, and F. Sapiro, “Sparse Learned Representationsfor Image Restoration”, the 4th Wold conference of the IASC (Inter-national Association for Statistical Computing), December 5-8, 2008,Yokohama, Japan.

49. J. Shtok, M. Elad, and M. Zibulevsky, “Direct Adaptive Algorithmsfor CT Reconstruction”, 2009 IEEE International Symposium onBiomedical Imaging, ISBI’09, June 27th-July 1st, 2009, Boston, USA.

50. A. Adler, Y. Hel-Or, and M. Elad, “A Weighted Discriminative Ap-proach for Image Denoising with Overcomplete Representations”,2010 International Conference on Acoustics, Speech, and Signal Pro-cessing (ICASSP), Dallas Tx. March 14-19, 2010.

51. Z. Ben-Haim, Y.C. Eldar, and M. Elad, “Coherence-Based Near-Oracle Performance Guarantees for Sparse Estimation Under Gaus-sian Noise “, 2010 International Conference on Acoustics, Speech,and Signal Processing (ICASSP), Dallas Tx. March 14-19, 2010.

52. A. Adler, Y. Hel-Or, and M. Elad, “A Shrinkage Learning Approachfor Single Image Super-Resolution with Overcomplete Representa-tions”, The 11th European Conference on Computer Vision (ECCV),Crete-Greece, 5-11 September 2010.

53. R. Zeyde, M. Elad, and M. Protter ”On Single Image Scale-Up us-ing Sparse-Representations”, Curves & Surfaces, Avignon-France,June 24-30, 2010 (submitted to Lecture-Notes-on-Computer-Science- LNCS).

54. J. Shtok, M. Elad, and M. Zibulevsky, “Sparsity-Based Sinogramfor Low-Dose Computed Tomography”, International Conference onAcoustics, Speech, and Signal Processing (ICASSP), Prague, CzechRepublic, 22-27 May, 2011.

55. T. Faktor, Y.C. Eldar, and M. Elad, “Denoising of Image Patchesvia Sparse Represenattions with Learned Statistical Dependencies”,International Conference on Acoustics, Speech, and Signal Processing(ICASSP), Prague, Czech Republic, 22-27 May, 2011.

56. A. Adler, V. Emiya, M.G. Jafari, M. Elad, R. Gribonval, and M.D.Plumbley, “A Constrained Matching Pursuit Approach to Audio De-clipping” , International Conference on Acoustics, Speech, and SignalProcessing (ICASSP), Prague, Czech Republic, 22-27 May, 2011.

57. S. Nam, M.E. Davies, M. Elad, and R. Gribonval, “Cosaprse Anal-ysis Modeling - Uniqueness and Algorithms” , International Confer-ence on Acoustics, Speech, and Signal Processing (ICASSP), Prague,Czech Republic, 22-27 May, 2011.

58. R. Giryes and M. Elad, “Denoising with Greedy-Like Pursuit Algo-rithms”, European Signal Processing Conference (EUSIPCO), Barcelona,Spain, August 29, 2011.

19

59. B. Ophir, M. Elad, N. Bertin, and M.D. Plumbley, “Sequential Min-imal Eigenvalues - An Approach to Analysis Dictionary Learning”,European Signal Processing Conference (EUSIPCO), Barcelona, Spain,August 29, 2011.

Plenary or Invited Talks:

1. January 22nd, 2002 - SCCM (Scientific Computing and ComputationMathematics Program) Seminar, Title: “Rejection Based Classifierfor Face Detection”. Joint work with Yacov Hel-Or, Professor at theInterdisciplinary Center (IDC), Herzlia, Israel and Renato Keshet,Hewlett-Packard Laboratories, Israel.

2. March 18th, 2002 - The Computer Vision Workshop - Stanford Com-puter Forum - Invited Talk, Title: “Rejection Based Classificationand its Applications”.

3. March 27th, 2002 - SCCM - Linear Algebra Forum Seminar, Title:“Static and Dynamic Super-Resolution”. Joint work with Arie Feuer,Professor at the Electrical Engineering Department, The Technion,Israel.

4. May 6th, 2002 - SCCM (Scientific Computing and ComputationMathematics Program) Seminar, Title: “On the Bilateral Filter andWays to Improve It”.

5. July 12th, 2002 - The SIAM 50th Anniversary Meeting - Invited Talk,Title: “Shape From Moments - An Estimation Perspective”. Jointwork with Peyman Milanfar, the Electrical Engineering department,University of California - Santa-Cruz, and Gene Golub, the ComputerScience Department - Stanford University.

6. August 13th, 2002 - FoCM - Image & Signal Proc. Workshop -Invited Talk, Title: “Fast Polar Fourier Transform”. Joint workwith David Donoho, Statistics - Stanford University, Amir Aver-buch, Mathematics Department - Tel-Aviv University, and RonaldCoifman, Mathematics Department - Yale.

7. November 13th, 2002 - IDR – Ideal Data Representation Workshop –University of South Carolina - Invited Talk, Title: “Sparse represen-tations and the Basis Pursuit Algorithm. Joint work with Alfred M.Bruckstein, Computer Science department – Technion, Israel, DavidDonoho, Statistics- Stanford University, and Peyman Milanfar, theElectrical Engineering department, University of California - Santa-Cruz.

8. January 10th, 2004 –AMS 10th meeting – special Session on Multi-scale and Oscillatory Phenomena – Invited Talk, Title: “Image De-composition Via the Combination of Sparse Representations and aVariational Approach”, Joint work with Jean-Luc Starck from CEA,France, and David Donoho, Statistics- Stanford University.

20

9. September 25th, 2004 – IPAM MGA Workshop – Invited Talk, Ti-tle: “Sparse Representations of Signals - Theory and Applications”,Joint work with Jean-Luc Starck from CEA, France, David Donoho,Statistics - Stanford University, Alfred Bruckstein – CS, Technion,and V. Temlyakov, Math. - Univesity of South Carolina.

10. January 27th, 2005 - Industrial Affiliate Program, CS department,The Technion. Invited Talk, Title: “Recent Trends in Signal Repre-sentations and their Role in Image Processing”. This talk has beenalso presented in the MVP seminar in Tel-Aviv Univeristy on May25th, 2005.

11. August 2nd, 2005 – SPIE meeting, San-Diego, CA. Invited Talk, Ti-tle: “The K-SVD: Design of Dictionaries for Sparse and RedundantRepresentation of Signals”, Joint work with Michal Aharon and Al-fred M. Bruckstein.

12. August 31st, 2005. Int. Conference on Super-Resolution, Hong-Kong- Invited talk, Title: “Example-Based Priors for Inverse Problems inImage Processing”, Joint work with Dima Dastenko – the Technion.

13. May 15th, 2006. SIAM Imaging Science conference, MinneapolisMinnesota, Invited talk, Title: “An Iterated Shrinkage Algorithmfor Basis Pursuit Minimization”, Joint work with Michael Zibulevskyand Boaz Matalon – The Technion.

14. May 15th, 2006. SIAM Imaging Science conference, MinneapolisMinnesota, Invited talk, Title: “Overcomplete and Sparse Represen-tations for Image Decomposition and Inpainting”, Joint work withJean-Luc Starck from CEA, France, and David Donoho, Statistics-Stanford University.

15. July 11th, 2006. WavE 2006 - Wavelets and Applications conference,Lausanne, Switzerland, Plenary talk, Title: “Sparse and Redun-dant Signal Representation, and its Role in Image Processing”.

16. September 19th, 2006. Astronomical Data Analysis conference, 2006(ADA IV), Marseille, France, Invited talk, Title: Super-Resolutionreconstruction of Images - an Overview”. Joint work with Arie Feuer- The Technion, Peyman Milanfar and Sina Farisu - UC Santa Cruz,USA.

17. September 21st, 2006. Mathematics and Image Analysis conference(MIA’06), Paris, France, Invited talk, Title: “Sparse and RedundantSignal Representation, and its Role in Image Processing”.

18. December 17th, 2006. Israel Computer Vision Day, 2006. Interdis-ciplinary center, Herzlia. Invited Talk, Title: “Denoising and Be-yond via Learned Dictionaires and Sparse Representations”. Jointwork with Michal Aharon and Matan Protter - the CS department,the Technion, Julien Mairal and Guilermo Sapiro, ECE department,University of Minnesota, Minneapolis, USA.

21

19. February 25th, 2007. Medical Imaging workshop - RAMBAM Hos-pital, Haifa. Invited Talk, Title: “New Results in Image ProcessingBased on Sparse & Redundant Representations”.

20. June 20th, 2007. The IV workshop on SIP & IT, Holon Instituteof Technology, Holon. Invited Talk, Title: “Optimized ProjectionDirections for Compressed Sensing”. This talk was also given inMVP seminar in Tel-Aviv university on June 21st, and also in ICIAM,Zurich, on July 17th, 2007.

21. August 26th, 2007. SPIE, Wavelet XII, san-Diego, CA. Plenarytalk. Title: “A Wide-Angle View of Iterated Shrinkage AlgorithmsFor Finding Sparse Representations”. Joint work with Boaz Matalon,Michael Zibulevsky, and Joseph Shtok.

22. March 30th, 2008. ICASSP, Las-Vegas. Title: “A Sparse and Non-Negative Solution of Ax=b is Necessarily Unique”. Joint work withMichael Zibulevsky and Freddy Bruckstein.

23. June 26th, 2008. Tel-Aviv University, Approximation Seminar, theMathematics department. Title: “Image Denoising and Beyond viaLearned Dictionaries and Sparse Representations”.

24. July 8th, 2008. SIAM Imaging Science 2008, San-Diego. Special Ses-sion on Locally Adaptive Patch-based Image and Video Restoration -Part II. Title: “Super-Resolution-Reconstruction of Image SequencesWithout Explicit Motion Estimation”. Joint work with Matan Prot-ter (CS - Technion), Hiro Takeda and Peyman Milanfar (UCSC).

25. July 8th, 2008. SIAM Imaging Science 2008, San-Diego. SpecialSession on Topics in Sparse and Redundant Representations - PartI. Title: “A Weighted Average of Sparse Several Representations isBetter than the Sparsest One Alone “. Joint work with Irad Yavneh.

26. December 11th, 2008. Computational Algebraic Statistics, Theoryand Applications (CASTA), Kyoto, Japan. Title: “Sparse and Re-dundant Representation Modeling for Image Processing”. Joint workwith Michal Aharon (CS - Technion, Guillermo Sapiro (UMN), JulienMairal (Inria - France), and Matan Protter (CS - Technion).

27. April 6th, 2009. Statistics seminar, Ecole Polytechnique, France. Ti-tle: “MMSE Estimation for Sparse Representation Modeling”. Jointwork with Irad Yavneh and Matan Protter (CS - Technion).

28. March 2nd, 2010. Invited talk for the High-Technion distinguishedlecture series, the Technion, Haifa. Title: “Atomic Decomposition ofImages - Advanced Topics in Image Processing”.

29. April 14th, 2010. SIAM Imaging Science 2010 Conference, Chicago.Title: “Single Image Super-Resolution Using Sparse Representation”,Joint work with Roman Zeyde and Matan Protter (CS - Technion).

22

30. June 9th, 2010. Workshop on Sparsity and Computation, Bonn Ger-many. Title: “Topics in Minimum-Mean-Squared-Error (MMSE) Es-timation in Sparse Approximation”, Joint work with Irad Yavneh,Javier Turek, and Matan Protter.

31. June 25th, 2010. Plenary talk at the Curves and Surfaces confer-ence, Grenoble, France. Title: “Sparse and redundant representationmodeling of signals - theory and applications”.

32. July 12-16 2010. summer school in Park-City, Utah. Title: “FiveLectures on Sparse and Redundant Representation Modeling of Im-ages” - PCMI Summer-School.

33. August 15-20 2010. Summer School in Iceland. Title: “A Courseon Sparse and Redundant Representation Modeling of Images - Ice-land Summer-School”.

34. January 7th, 2011, Invited talk in the SMALL workshop on SparseDictionary Learning. Title: “Exploiting Statistical Dependencies inSparse Representations”.

EDITORIAL BOARDS AND CONFERENCE PROGRAM COM-MITTEES

Editorial Board of IEEE Trans. On Image Processing, edited by Prof. CharlesBouman, 2006–2010.

Editorial Board of EURASIP Journal on Applied Signal Processing, edited byProf. Ali H. Sayed, since April 2006 till December 2007.

Editorial Board of SIAM Journal on Imaging Sciences, since September 2008.

Technical Program Committee of International Conference on Image Process-ing, ICIP 2004, Singapore, October 24-27, 2004.

Technical Program Committee International Conference on Acoustics, Speech,and Signal Processing, ICASSP 2004, Montreal, Quebec, Canada, May17-21, 2004.

Technical Program Committee of IEEE Computer Society International Con-ference on Computer Vision and Pattern Recognition, CVPR 2005, SanDiego, USA, June 20-25, 2005.

Technical Program Committee of International Conference on Image Process-ing, ICIP 2005, Genova, Italy, September 11-14, 2005.

Technical Program Committee of IEEE Computer Society Conference on Com-puter Vision and Pattern Recognition, CVPR 2006, New York, USA, June17-22, 2006.

23

Co-organizer (jointly with Emmanuel Candes from Caltech) of three specialsessions on “Sparse Representations and Their Role in Image processing”,in the 2006 SIAM Imaging Science Conference, Minneapolis, Minnesota,May 15-17, 2006.

Co-organizer (jointly with Peyman Milanfar from UCSC) of special sessions on“Locally adaptive patch-based image and video restoration”, in the 2008SIAM Imaging Science Conference, San-Diego, California, July 8, 2008.

Co-organizer (jointly with Jean-Luc Starck from CNRS-CEA, France) of spe-cial sessions on “Topics in sparse and redundant representations”, in the2008 SIAM Imaging Science Conference, San-Diego, California, July 8,2008.

Organizing (Program) Committee Member of Dagstuhl Workshop on SparseRepresentations, Germany, January 30, 2009.

Organizing (Program) Committee Member of SIAM Conference on ImagingScience (IS10), Chicago, Illinois, USA, April 12-14, 2010.

Organizing (Program) Committee Member of Dagstuhl Workshop on SparseRepresentations, Germany, January 30, 2011.

24

1

BiographyRobert F.H. Fischer (SeniorMember, IEEE) received theDr.-Ing. degree in 1996, and the habilitationdegree in 2001, from the University of Erlangen-Nürnberg, Erlangen, Germany. &e subject of hisdissertation was multichannel and multicarrier modulation, that of his habilitation was precoding andsignal shaping.

Form 1992 to 1996, he was a Research Assistant at the Telecommunications Institute, University ofErlangen-Nürnberg. During 1997, he was with the IBM Research Laboratory, Zürich, Switzerland.In 1998, he returned to the Telecommunications Institute II, University of Erlangen-Nürnberg, andin 2005 he spent a sabbatical at ETH, Zürich, Switzerland. Currently, he teaches graduate courses indigital communications. His research concentrates on fast digital transmission including single- andmulticarrier modulation techniques. His current interests are information theory, coded modulation,digital communications and signal processing, and especially precoding and shaping techniques forhigh-rate transmission schemes.

Dr. Fischer received the Dissertation Award form the Technische Fakultät, University of Erlangen-Nürnberg, in 1997, the Publication Award of the German Society of Information Techniques (ITG) in2000, the Wolfgang Finkelnburg habilitation award in 2002, and the Philipp-Reis-Preis in 2005. He isauthor of the textbook “Precoding and Signal Shaping for Digital Transmission” (John Wiley & Sons,New York, 2002).

2

List of Publications[1] R. Fischer und J. B. Huber. Signalformung zur Begrenzung der Dynamik bei der Tomlinson-

Harashima-Vorcodierung. In ITG-Fachtagung, Vol. 130, pp. 457–466, München, October1994

[2] R. F.H. Fischer, J. B. Huber, G. Komp. Coordinated Digital Transmission: &eory andExamples. Archiv für Elektronik und Übertragungstechnik (AEÜ), pp. 289–300, Novem-ber/December 1994

[3] J. B. Huber, R. Fischer. Dynamically Coordinated Reception of Multiple Signals in CorrelatedNoise. In Proceedings of the International Symposium on Information #eory (ISIT), pp. 132,Trondheim, Norway, 1994

[4] R. F.H. Fischer. Using Flexible Precoding for Channels with Spectral Nulls. IET ElectronicsLetters, Vol. 31, No. 5, pp. 356–358, March 1995

[5] R. F.H. Fischer, J. B. Huber. Dynamics Limited Shaping for Fast Digital Transmission. In IEEEInternational Conference on Communications (ICC), pp. 22–26, Seattle, WA, USA, June 1995

[6] W.Gerstacker, R. F.H. Fischer, J. B. Huber. Blind Equalization for FastDigital Cable Transmis-sionwith Tomlinson-Harashima Precoding and Shaping. In IEEE International Conference onCommunications (ICC), pp. 493–497, Seattle, WA, USA, June 1995

[7] R. F.H. Fischer, W. Gerstacker, J. B. Huber. Dynamics Limited Precoding, Shaping, and BlindEqualization for Fast Digital Transmission over Twisted Pair Lines. IEEE Journal on SelectedAreas in Communications, Vol. 13, No. 9, pp. 1622–1633, December 1995

[8] R. F.H. Fischer, J. B. Huber, U. Wachsmann. Multilevel Coding: Aspects from Information&eory. In Proceedings of the IEEE Information#eory Workshop (ITW), No. 2.2, pp. 9, Haifa,Israel, June 1996

[9] R. F.H. Fischer, J. B. Huber, U. Wachsmann. Coded Modulation: Design of Signal Setand Shaping. In 25th General Assembly of URSI, pp. paperC6.6,p.151, Lille, France, Au-gust/September 1996

[10] R. F.H. Fischer, J. B. Huber. Neues Verfahren zur Raten- und Leistungsverteilung beiMehrträgersystemen. In OFDM-Fachgespräch, Braunschweig, Germany, September 1996

[11] R. Bäuml, R. F.H. Fischer, J. B. Huber. Reducing the Peak-to-Average Power Ratio of Mul-ticarrier Modulation by Selected Mapping. IET Electronics Letters, Vol. 32, pp. 2056–2057,October 1996

[12] R. F.H. Fischer, J. B. Huber. A New Loading Algorithm for Discrete Multitone Transmission.In IEEE Global Telecommunications Conference (GLOBECOM), pp. 724–728, London, UK,November 1996

[13] R. F.H. Fischer, J. B. Huber, U. Wachsmann. Multilevel Coding: Aspects from Information&eory. In Communication#eory Mini-Conference at IEEE Global Telecommunications Con-ference (CTMC), pp. 26–30, London, UK, November 1996

3

[14] S.Müller, R. Bäuml, R. F.H. Fischer, J. B. Huber. OFDMwith Reduced Peak-to-Average PowerRatio by Multiple Signal Representation. Annals of Telecommunications, Vol. 52, No. 1-2, pp.58–67, February 1997

[15] R. F.H. Fischer, J. B. Huber. Comparison of Precoding Schemes for Digital Subscriber Lines.IEEE Transactions on Communications, Vol. 45, No. 3, pp. 334–343, March 1997

[16] R. F.H. Fischer, J. B. Huber. On &e Equivalence of Single- and Multicarrier Modulation: ANewView. In International Symposium on Information#eory (ISIT), pp. 197, Ulm, Germany,June 1997

[17] U. Wachsmann, R. F.H. Fischer, J. B. Huber. Multilevel Coding: Use of Hard Decisions inMultistage Decoding. In Allerton Conference on Communication, Control, and Computing,pp. 966–975, Monticello, IL, USA, September-October 1997

[18] W.Gerstacker, R. F.H. Fischer, J. B.Huber. A TransmissionScheme for Twisted Pair Lines withCoding, Precoding, and Blind Equalization. In IEEE Global Telecommunications Conference(GLOBECOM), pp. 52–56, Phoenix, Arizona, USA, November 1997

[19] R. F.H. Fischer, J. B. Huber. Finite-Word-Length and Nonrecursive Implementation ofTomlinson-Harashima Precoding. International Journal of Electronics and Communications(AEÜ), Vol. 51, No. 4, pp. 187–195, 1997

[20] J. B. Huber, U. Wachsmann, R. F.H. Fischer. Coded Modulation by Multilevel-Codes:Overview and State of the Art. In ITG-Fachbericht: Codierung für Quelle, Kanal und Über-tragung, pp. 255–266, Aachen, Germany, March 1998

[21] R. F.H. Fischer, J. B. Huber, U. Wachsmann. On the Combination of Multilevel Coding andSignal Shaping. In ITG-Fachbericht: Codierung für Quelle, Kanal und Übertragung, pp. 273–278, Aachen, Germany, March 1998

[22] R. F.H. Fischer, J. B. Huber. Optimales Multiplexübertragungsverfahren für verzerrendeKanäle. In ITG-Fachbericht: Codierung für Quelle, Kanal und Übertragung, pp. 201–206,Aachen, Germany, March 1998

[23] W. Gerstacker, R. F.H. Fischer, J. B. Huber. Blinde Entzerrung für digitale Übertragung überZweidrahtleitungen mit Codierung und Vorcodierung. In ITG-Fachbericht: Codierung fürQuelle, Kanal und Übertragung, pp. 239–244, Aachen, Germany, March 1998

[24] U. Wachsmann, J. B. Huber, R. F.H. Fischer. Multilevel Coding: Uso of Hard Decisions inMultistage Decoding. In ITG-Fachbericht: Codierung für Quelle, Kanal und Übertragung, pp.231–236, Aachen, Germany, March 1998

[25] R. F.H. Fischer, S. Calabrò, L. Lampe, S. Müller-Weinfurtner. Performance of coded modula-tion employing diOerential encoding over Rayleigh fading channels. IET Electronics Letters,Vol. 35, pp. 122–123, January 1999

[26] J. B. Huber, R. F.H. Fischer, U. Wachsmann. Codierte Modulation mittels Multilevel-Codes:Entwicklung und aktueller Stand der Forschung. IT+TI, pp. 30–35, Oldenbourg-Verlag, Jan-uary 1999

4

[27] L. Lampe, R. F.H. Fischer, S. Calabrò. Channel capacity of fading channels for diOerentiallyencoded Transmission.. IET Electronics Letters, Vol. 35, pp. 192–194, February 1999

[28] L. Lampe, R. F.H. Fischer. Comparison and Optimization of DiOerentially Encoded Trans-mission on Fading Channels. In Proceedings of 3rd International Symposium on Power-LineCommunications and its Applications (ISPLC), pp. 107–113, Lancaster, UK, March 1999

[29] L. Lampe, S. Calabrò, R. F.H. Fischer, S. Müller-Weinfurtner, J. B. Huber. On the DiPculty ofBit-Interleaved Coded Modulation for DiOerentially Encoded Transmission. In Proceedingsof IEEE Information #eory Workshop (ITW), pp. 111, Kruger National Park, South Africa,June 1999

[30] U. Wachsmann, R. F.H. Fischer, J. B. Huber. Multilevel Codes: &eoretical Concepts andPractical Design Rules. IEEE Transactions on Information #eory, Vol. 45, No. 5, pp. 1361–1391, July 1999

[31] R. F.H. Fischer. Calculation of Shell Frequency Distributions Obtained with Shell-MappingSchemes. IEEE Transactions on Information #eory, pp. 1631–1639, July 1999

[32] W. Gerstacker, R. F.H. Fischer, J. B. Huber. Blind Equalization Techniques for xDSL usingChannel Coding and Precoding. International Journal of Electronics and Communications(AEÜ), No. 4, pp. 194–204, August 1999

[33] R. F.H. Fischer, L. Lampe, S. Calabrò, S. Müller-Weinfurtner. Coded Modulation using Dif-ferential Encoding over Rayleigh Fading Channels. In Proceedings of 50th IEEE VehicularTechnology Conference (VTC) Fall, pp. 2525–2529, Amsterdam,&e Netherlands, September1999

[34] R. F.H. Fischer, L. Lampe, J. B.Huber. Analysis of Synchronisation Requirements for ADSL. InProceedings of International OFDMWorkshop, pp. 13.1–13.5, Hamburg, Germany, September1999

[35] L. Lampe, R. F.H. Fischer, S. Calabro, S. Müller-Weinfurtner. CodedModulation for DPSK onFading Channels. In IEEE Global Telecommunications Conference (GLOBECOM), pp. 2540–2544, Rio, Brazil, December 1999

[36] R. F.H. Fischer, L. Lampe, S. Müller-Weinfurtner, J. B. Huber. Coded Modulation for Dif-ferential Encoding and Non-Coherent Reception on Fading Channels. In Proceedings of 3.International ITG Conference on Source and Channel Coding (SCC), pp. 139–146, München,Germany, January 2000

[37] L. Lampe, R. F.H. Fischer, R. Schober. Performance Evaluation of Non-Coherent Transmis-sion over Power Lines. In International Syposium on Power-Line Communications (ISPLC),pp. 23–30, Limerick, Ireland, April 2000

[38] L. Lampe, R. F.H. Fischer, J. B. Huber. DiOerential Phase Shift Keying with ConstellationExpansion Diversity. In International Symposium on Information #eory (ISIT), pp. 136, Sor-rento, Italy, June 2000

5

[39] L. Lampe, R. F.H. Fischer. Noncoherent Coded Modulation for Fading Channels. Interna-tional Journal of Electronics and Communications (AEÜ), Vol. 54, No. 6, pp. 399–411, June2000

[40] L. Lampe, R. Schober, R. F.H. Fischer. Noncoherent and Coded OFDM Using Decision-Feedback Demodulation and Diversity. In 5th International OFDMWorkshop, pp. 15.1–15.6,Hamburg, Germany, September 2000

[41] R. F.H. Fischer, R. Tzschoppe, J. B. Huber. Signal Shaping for Peak-Power and DynamicsReduction. In Proceedings of the ’WorkshopWhat is next in xDSL’ , Vienna, Austria, September2000

[42] L. Lampe, R. F.H. Fischer. Low Complexity Multilevel Coding for Multiple-Symbol DiOeren-tial Detection. IET Electronics Letters, Vol. 36, No. 25, pp. 2081–2082, December 2000

[43] R. F.H. Fischer, L. Lampe, S. Calabrò. DiOerential Encoding Strategies for Transmission overFading Channels. International Journal of Electronics and Communications (AEÜ), Vol. 54,No. 1, pp. 59–67, 2000

[44] L. Lampe, R. F.H. Fischer. Random Coding Exponent Based Design of Coded Modulationfor Multiple-Symbol DiOerential Detection. In Proceedings of International Symposium onInformation #eory (ISIT), pp. 163, Washington, DC, USA, June 2001

[45] R. F.H. Fischer, L. Lampe, S. Müller-Weinfurtner. Coded Modulation for Noncoherent Re-ception with Application to OFDM. IEEE Transactions on Vehicular Technology, Vol. 50, No.4, pp. 910–919, July 2001

[46] R. F.H. Fischer, E. Eberlein. Improved DiOerential Demodulation of OFDM over Two-PathChannels. In Proceedings of 6. International OFDMWorkshop, Hamburg, Germany, Septem-ber 2001

[47] S. Huettinger, J. B. Huber, R. Johannesson, R. F.H. Fischer. Information Processing in Soft-Output Decoding. In Proceedings of 39thAllertonConference on Communication, Control, andComputing, pp. 301–310, Monticello, IL, USA, October 2001

[48] R. F.H. Fischer, R. Tzschoppe, J. B. Huber. Signal Shaping for Reduction of Peak-Power andDynamic Range in Precoding Schemes. In Proceedings of IEEE Global TelecommunicationsConference (GLOBECOM), Vol. 1, pp. 339–341, San Antonio, TX, USA, November 2001

[49] S. Huettinger, J. B. Huber, R. F.H. Fischer, R. Johannesson. Soft-Output-Decoding: SomeAspects From Information&eory. InProceedings of 4. International ITGConference on Sourceand Channel Coding (SCC), pp. 81–89, Berlin, Germany, January 2002

[50] R. F.H. Fischer, C. Windpassinger, A. Lampe, J. B. Huber. Space-Time Transmission usingTomlinson-Harashima Precoding. InProceedings of 4. International ITGConference on Sourceand Channel Coding (SCC), pp. 139–147, Berlin, Germany, January 2002

[51] R. F.H. Fischer, C. Windpassinger, A. Lampe, J. B. Huber. Tomlinson-Harashima Precodingin Space-Time Transmission for Low-Rate Backward Channel. In Proceedings of InternationalZurich Seminar on Broadband Communications, pp. 7.1–7.6, Zurich, Switzerland, February2002

6

[52] R. F.H. Fischer, R. Tzschoppe, J. B. Huber. Signal Shaping for Peak-Power and DynamicsReduction in Transmission Schemes Employing Precoding. IEEE Transactions on Communi-cations, Vol. 50, No. 5, pp. 735–741, May 2002

[53] R. F.H. Fischer, C.Windpassinger, A. Lampe, J. B. Huber. MIMOPrecoding for DecentralizedReceivers. In Proceedings of International Symposium on Information #eory (ISIT), pp. 496,Lausanne, Switzerland, June/July 2002

[54] L. Lampe, R. Schober, R. F.H. Fischer. Multilevel Coding forMultiple-Antenna Transmission.In Proceedings of International Symposium on Information #eory (ISIT), pp. 104, Lausanne,Switzerland, June/July 2002

[55] T. Vencel, C.Windpassinger, R. F.H. Fischer. Sorting in theV-BLASTAlgorithm and Loading.In Proceedings of Communication Systems and Networks (CSN), pp. 304–309, Malaga, Spain,September 2002

[56] C.Windpassinger, T. Vencel, R. F.H. Fischer. OptimisingMIMODFE for systems with spatialloading. IET Electronics Letters, Vol. 38, No. 24, pp. 1591–1593, November 2002

[57] R. F.H. Fischer, C. Windpassinger. Real- vs. complex-valued equalisation in V-BLAST sys-tems. IET Electronics Letters, Vol. 39, No. 5, pp. 470–471, March 2003

[58] C. Windpassinger, R. F.H. Fischer. Low-Complexity Near-Maximum-Likelihood Detectionand Precoding for MIMO Systems using Lattice Reduction. In Proceedings of IEEE Informa-tion#eory Workshop , pp. 345–348, Paris, France, March/April 2003

[59] C.Windpassinger, T. Vencel, R. F.H. Fischer. Precoding and Loading for BLAST-like Systems.In Proceedings of IEEE International Conference on Communications (ICC), pp. 3061–3065,Anchorage, AK, USA, May 2003

[60] L. Lampe, R. Schober, R. F.H. Fischer. DiOerential Space-Time Modulation — Coding andCapacity Results. In Proceedings of IEEE International Conference on Communications (ICC),pp. 2593–2597, Anchorage, AK, USA, May 2003

[61] C. Windpassinger, R. F.H. Fischer. Optimum and Sub-Optimum Lattice-Reduction-AidedDetection and Precoding for MIMOCommunications. In Proceedings of the CanadianWork-shop on Information #eory, pp. 88–91, Waterloo, Ontario, Canada, May 2003

[62] R. F.H. Fischer, C. Stierstorfer, C.Windpassinger. Precoding and Signal Shaping for Transmis-sion over MIMO Channels. In Proceedings of the Canadian Workshop on Information#eory,pp. 83–87, Waterloo, Ontario, Canada, May 2003

[63] L. Lampe, R. Schober, R. F.H. Fischer. Coded DiOerential Space-Time Modulation for FlatFading Channels. IEEE Transactions onWireless Communications, Vol. 2, No. 3, pp. 582–590,May 2003

[64] R. F.H. Fischer, C. Windpassinger, J. B. Huber. Modulo-Lattice Reduction in PrecodingSchemes. In Proceedings of the International Symposium on Information #eory (ISIT), pp.163, Yokohama, Japan, June 2003

7

[65] C. Windpassinger, L. Lampe, R. F.H. Fischer. From Lattice-Reduction-Aided Detection To-wardsMaximum-LikelihoodDetection inMIMO Systems. In Proceedings of the InternationalConference on Wireless and Optical Communications (WOC), BanO, Canada, July 2003

[66] R. F.H. Fischer, J. B. Huber, C. A. Windpassinger. Signal Processing in Decision-FeedbackEqualization of Intersymbol-Interference and Multiple-Input / Multiple-Output Channels: AUniSed View. IEEE Transactions on Signal Processing, Vol. 83, No. 8, pp. 1633–1642, August2003

[67] R. F.H. Fischer, J. B. Huber, C. A. Windpassinger. Precoding for Point-to-Multipoint Trans-mission. In Eighth International Workshop on Signal Processing for Space Communication, pp.137–144, Catania, Italy, September 2003

[68] R. F.H. Fischer,C. A.Windpassinger. ImprovedMIMOPrecoding forDecentralized ReceiversResembling Concepts from Lattice Reduction. In Proceedings of IEEE Global Telecommunica-tions Conference (GLOBECOM), pp. CT08–7, San Francisco, CA, USA, December 2003

[69] R. F.H. Fischer, J. B. Huber. Signal Processing in Receivers for Communication over MIMOISI Channels. In Proceedings of IEEE International Symposium on Signal Processing and Infor-mation Technology (ISSPIT), pp. 298–301, Darmstadt, Germany, December 2003

[70] R. F.H. Fischer, C. Windpassinger. Even-Integer Interference Precoding for Broadcast Chan-nels. In 5th International ITG Conference on Source and Channel Coding (SCC), pp. 395–402,Erlangen, Germany, January 2004

[71] R. F.H. Fischer, R. Tzschoppe, R. Bäuml. Lattice Costa Schemes using Subspace Projectionfor Digital Watermarking. In 5th International ITG Conference on Source and Channel Coding(SCC), pp. 127–134, Erlangen, Germany, January 2004

[72] C. Windpassinger, R. F.H. Fischer, J. B. Huber. Lattice-Reduction-Aided Broadcast Precod-ing. In 5th International ITG Conference on Source and Channel Coding (SCC), pp. 403–408,Erlangen, Germany, January 2004

[73] L. Lampe, R. Schober, R. F.H. Fischer. Multilevel Coding forMultiple-Antenna Transmission.IEEE Transactions on Wireless Communications, Vol. 3, No. 1, pp. 203–208, January 2004

[74] R. F.H. Fischer, C. Stierstorfer, J. B. Huber. Precoding for Point-to-Multipoint Transmis-sion over MIMO ISI Channels. In International Zurich Seminar (IZS), pp. 208–211, Zurich,Switzerland, February 2004

[75] C. Windpassinger, R. F.H. Fischer, T. Vencel, J. B. Huber. Precoding in Multi-Antenna andMulti-User Communications. IEEE Transactions on Wireless Communications, Vol. 3, No. 4,pp. 1305–1316, June 2004

[76] C. Windpassinger, L. Lampe, R. F.H. Fischer, T. Hehn. A Study of Low-Complexity and Low-LatencyMIMODetectors. In Proceedings of the International Symposium on Information#e-ory (ISIT), pp. 501, Chicago, IL, USA, June 2004

[77] R. F.H. Fischer, R. Tzschoppe, R. Bäuml. Lattice Costa Schemes using Subspace Projectionfor Digital Watermarking. European Transactions on Telecommunications (ETT), Vol. 15, No.4, pp. 351–36, July/August 2004

8

[78] R. F.H. Fischer, C. Stierstorfer, J. B. Huber. Point-to-Point Transmission over MIMO Chan-nels with Intersymbol Interference: Comparison of Single- and Multicarrier Modulation. InProceedings of the 9th International OFDMWorkshop, pp. 1–5, Dresden, Germany, September2004

[79] R. F.H. Fischer. MMSE DFE for High-Rate MIMO Transmission over Channels with ISI. InProceedings of the 5th IEE International Conference on 3GMobile Communication Technologies3G, pp. 83–87, London, United Kingdom, October 2004

[80] C.Windpassinger, R. F.H. Fischer, J. B.Huber. Lattice-Reduction-Aided Broadcast Precoding.IEEE Transactions on Communications, Vol. 52, No. 12, pp. 2057–2060, December 2004

[81] R. Tzschoppe, R. Bäuml, R. F.H. Fischer, J. B. Huber, A. Kaup. Additive Non-GaussianAttackson the Scalar Costa Scheme (SCS). In Proceedings of SPIE, Security, Steganography, and Wa-termarking of Multimedia Contents VII, Vol. 5681, pp. 114–123, San Jose, CA, USA, January2005

[82] R. F.H. Fischer. MIMO and Transmit Processing - Part I: Fundamentals, Dualities, and As-pects from Information&eory. In Proceedings of International ITG/IEEEWorkshop on SmartAntennas, Universität Duisburg-Essen, Germany, April 2005

[83] R. F.H. Fischer. &e Modulo-Lattice Channel: &e Key Feature in Precoding Schemes. Inter-national Journal of Electronics and Communications (AEÜ), Vol. 59, pp. 244–253, June 2005

[84] R. F.H. Fischer. Sorted Spectral Factorization of Matrix Polynomials in MIMO Communica-tions. IEEE Transactions on Communications, Vol. 12, pp. 945–951, June 2005

[85] R. F.H. Fischer, C. Siegl. Lattice-Reduction-Aided Equalization for Transmission overIntersymbol-Interference Channels. IET Electronics Letters, Vol. 41, pp. 969–970, August 2005

[86] C. Stierstorfer, R. F.H. Fischer. Comparison of Coding Strategies for Multi-Antenna Multi-Carrier Transmission. In Proceedings of the 10th International OFDM Workshop, Hamburg,Germany, August/September 2005

[87] R. F.H. Fischer, C. Stierstorfer. Comparison of Code Design Requirements for Singlecarrierand Multicarrier Transmision over Frequency-Selective MIMO Channels. In Proceedings ofInternational Symposium on Information #eory (ISIT), pp. 1145–1149, Adelaide, Australia,September 2005

[88] R. F.H. Fischer, J. B. Huber. Equalization Strategies for Transmission over Space and Time.Elektrotechnik und Informationstechnik, No. 6, pp. 187–195, 2005

[89] R. F.H. Fischer, C. Siegl. On the Relation between Lattice-Reduction-Aided Equalization andPartial-Response Signaling. In International Zurich Seminar (IZS), pp. 34–37, Zurich, Switzer-land, February 2006

[90] C. Stierstorfer, R. F.H. Fischer. Rate Regions for Multipoint-to-Point-Transmission overChannels with Intersymbol Interference. In Proceedings of International ITG/IEEE Workshopon Smart Antennas, Castle Reisensburg, Germany, March 2006

9

[91] R. F.H. Fischer. Lattice-Reduction-Aided Equalization and Generalized Partial Response Sig-naling for Point-to-Point Transmission over Flat-Fading MIMO Channels. In Proceedings of4th International Symposium on Turbo Codes in connection with the 6th International Confer-ence on Source and Related Topics, München, Germany, April 2006

[92] R. F.H. Fischer, C. Stierstorfer. Single- and Multicarrier Transmission in Multipoint-to-PointScenarios with Intersymbol Interference: A Comparison. In Proceedings of 4th InternationalSymposium on Turbo Codes in connection with the 6th International Conference on Source andRelated Topics, München, Germany, April 2006

[93] R. F.H. Fischer, J. B. Huber. Rate Region Combining in Multiuser MIMO. In Proceedings ofInternational Symposium on Information#eory (ISIT), pp. 2279–2283, Seattle, WA,USA, July2006

[94] C. Windpassinger, L. Lampe, R. F.H. Fischer, T. Hehn. A Performance Study of MIMO De-tectors. IEEE Transactions onWireless Communications, Vol. 5, No. 8, pp. 2004–2008, August2006

[95] R. F.H. Fischer. Peak-to-Average Power Ratio (PAR) Reduction in OFDM based on LatticeDecoding. In Proceedings of the 11th International OFDM Workshop, pp. 71–75, Hamburg,Germany, August 2006

[96] C. Stierstorfer, R. F.H. Fischer. Rate Regions for Multicarrier Point-to-Multipoint Transmis-sion over Channels with Intersymbol Interference. In Proceedings of the 11th InternationalOFDMWorkshop, pp. 293–297, Hamburg, Germany, August 2006

[97] J. B. Huber. R. F.H. Fischer. On the Impact of Information &eory on Today’s Communica-tion Technology. In Proceedings of 7th Workshop Digital Broadcasting, pp. 41–47, Erlangen,Germany, September 2006

[98] R. F.H. Fischer, M. Hoch. Directed Selected Mapping for Peak-to-Average Power Ratio Re-duction in MIMO OFDM. IET Electronics Letters, Vol. 42, No. 22, pp. 1289–129, October2006

[99] C. Stierstorfer, R. F.H. Fischer. Lattice-Reduction-AidedTomlinson-Harashima Precoding forPoint-to-Multipoint Transmission. International Journal of Electronics and Communications(AEÜ), Vol. 60, pp. 328–330, 2006

[100] R. F.H. Fischer, C. Siegl. InUated Lattice Precoding, Bias Compensation, and the Up-link/Downlink Duality: &e Connection. IEEE Communications Letters, Vol. 11, No. 2, pp.185–187, February 2007

[101] R. F.H. Fischer, C. Siegl, M. Hoch. Out-of-Band Power Reduction in MIMO OFDM. In Pro-ceedings of International ITG/IEEE Workshop on Smart Antennas, Vienna, Austria, February2007

[102] C. Stierstorfer, R. F.H. Fischer. (Gray) Mappings for Bit-Interleaved Coded Modulation.In Proceedings of 65th IEEE Vehicular Technology Conference (VTC) Spring, pp. 1703–1707,Dublin, Ireland, April 2007

10

[103] R. F.H. Fischer, M. Hoch. Peak-to-Average Power Ratio Reduction in MIMOOFDM. In Pro-ceedings of the IEEE International Conference on Communications (ICC), pp. 762–767, Glas-gow, United Kingdom, June 2007

[104] C. Siegl, R. F.H. Fischer. Peak-to-Average Power Ratio Reduction in Multi-User OFDM. InProceedings of International Symposium on Information#eory (ISIT), pp. 2746, Nice, France,June 2007

[105] R. F.H. Fischer. Widely-Linear Selected Mapping for Peak-to-Average Power Ratio Reductionin OFDM. IET Electronics Letters, Vol. 43, No. 14, pp. 766–767, July 2007

[106] R. F.H. Fischer, C. Stierstorfer. Single- and Multicarrier Transmission in Up- and DownlinkScenarios with Intersymbol Interference: A Comparison. European Transactions on Telecom-munications (ETT), Vol. 18, pp. 467–477, August 2007

[107] C. Siegl, R. F.H. Fischer. Directed Selected Mapping for Peak-to-Average Power Ratio Reduc-tion in Single-Antenna OFDM. In Proceedings of 12th International OFDMWorkshop, Ham-burg, Germany, August 2007

[108] C. Stierstorfer, R. F.H. Fischer. Intralevel Interleaving for BICM in OFDM Scenarios. In Pro-ceedings of 12th International OFDMWorkshop, Hamburg, Germany, August 2007

[109] C. Siegl, R. F.H. Fischer. Joint Spatial and Temporal PAR Reduction in MIMO OFDM. InProceedings of 7th International International ITG Conference on Source and Channel Coding(SCC), Ulm, Germany, January 2008

[110] C. Stierstorfer, R. F.H. Fischer. Adaptive Interleaving for Bit-Interleaved Coded Modulation.InProceedings of 7th International International ITGConference on Source andChannel Coding(SCC), Ulm, Germany, January 2008

[111] C. Stierstorfer, R. F.H. Fischer. Mappings for BICM in UWB Scenarios. In Proceedings of7th International International ITG Conference on Source and Channel Coding (SCC), Ulm,Germany, January 2008

[112] C. Siegl, R. F.H. Fischer. Comparison of Partial Transmit Sequences and Selected Mapping forPeak-to-Average Power Ratio Reduction in MIMOOFDM. In International ITG/IEEEWork-shop on Smart Antennas, pp. 324–331, Darmstadt, Germany, February 2008

[113] R. F.H. Fischer, C. Siegl. Peak-to-Average Power Ratio Reduction in OFDM using Reed-SolomonCodes. In International Zurich Seminar (IZS), pp. 40–43,Zurich, Switzerland,March2008

[114] R. F.H. Fischer, C. Siegl. OFDMPeak-to-AveragePowerRatioReductionbased on the SimplexCode. In Proceedings of the International Symposium on Information#eory (ISIT), pp. 1303–1307, Toronto, Canada, July 2008

[115] C. Stierstorfer, R. F.H. Fischer. Rate Loading in OFDM Based on Bit Level Capacities. InProceedings of the International Symposium on Information #eory (ISIT), pp. 1308–1312,Toronto, Canada, July 2008

11

[116] C. Siegl, R. F.H. Fischer. Tone Reservation for Peak-to-Average Power Ratio Reduction inOFDMunderDiOerentOptimizationConstraints. InProceedings of 13th International OFDMWorkshop, Hamburg, Germany, August 2008

[117] C. Stierstorfer, R. F.H. Fischer. Aspects of Rate and Power Loading in (Coded-)OFDM. InProceedings of 13th International OFDMWorkshop, Hamburg, Germany, August 2008

[118] C. Siegl, R. F.H. Fischer. Partial Transmit Sequences for Peak-to-Average Power Ratio Reduc-tion in Multi-Antenna OFDM. EURASIP Journal on Wireless Communications and Network-ing, 2008

[119] C. Stierstorfer, R. F.H. Fischer. Asymptotically Optimal Mappings for BICM with M-PAMand M2-QAM. IET Electronics Letters, Vol. 45, No. 3, pp. 173–174, January 2009

[120] C. Siegl, R. F.H. Fischer. Selected Sorting for PAR Reduction in OFDMMulti-User BroadcastScenarios. In Proceedings of International ITG/IEEE Workshop on Smart Antennas, pp. 243–250, Berlin, Germany, February 2009

[121] R. F.H. Fischer, C. Siegl. Reed-Solomon and Simplex Codes for Peak-to-Average Power RatioReduction inOFDM. IEEE Transactions on Information#eory, Vol. 55, No. 4, pp. 1519–1528,April 2009

[122] R. F.H. Fischer, C. Siegl. Successive PAR Reduction in (MIMO) OFDM. In Proceedings of theIEEE International Conference on Communications (ICC), pp. 1–5, Dresden, Germany, June2009

[123] C. Siegl, R. F.H. Fischer. Uplink-Downlink Duality with Regard to Constraints Imposed inPractice. International Journal of Electronics and Communications (AEÜ), Vol. 63, No. 7, pp.584–594, July 2009

[124] A. Schenk, R. F.H. Fischer, L. Lampe. A Stopping Radius for the Sphere Decoder and itsApplication to MSDD of DPSK. Communications Letters, Vol. 13, No. 7, pp. 465–467, July2009

[125] C. Stierstorfer, R. F.H. Fischer. Loading-Aware Bit-Interleaver Design. In Proceedings of 14thInternational OFDMWorkshop, Hamburg, Germany, September 2009

[126] C. Siegl, R. F.H. Fischer. Out-of-Band Power Reduction using Selected Mapping with Power-AmpliSer-OrientedMetrics. In Proceedings of 14th International OFDMWorkshop, Hamburg,Germany, September 2009

[127] A. Schenk, R. F.H. Fischer, L. Lampe. A New Stopping Criterion for the Sphere Decoder inUWB Impulse-RadioMultiple-Symbol DiOerential Detection. In Proceedings of IEEE Interna-tional Conference on Ultra-Wideband (ICUWB), pp. 606–611, Vancouver, Canada, September2009

[128] R. F.H. Fischer, C. Siegl. Peak-to-Average Power Ratio Reduction in Single- and Multi-Antenna OFDM via Directed Selected Mapping. IEEE Transactions on Communications, Vol.57, No. 11, pp. 3205–3208, November 2009

12

[129] R. F.H. Fischer. Capacity of Clipped 4-QAM-OFDM. In Proceedings of 8th International ITGConference on Source and Channel Coding, Siegen, Germany, January 2010

[130] C. Siegl, R. F.H. Fischer. Selected Mapping with Implicit Transmission of Side Informationusing Discrete Phase Rotations. In Proceedings of 8th International ITG Conference on Sourceand Channel Coding, Siegen, Germany, January 2010

[131] A. Schenk, R. F.H. Fischer. A Stopping Radius for the Sphere Decoder: Complexity ReductioninMultiple-Symbol DiOerential Detection. In Proceedings of 8th International ITG Conferenceon Source and Channel Coding, Siegen, Germany, January 2010

[132] A. Schenk, R. F.H. Fischer. Multiple-Symbol-Detection-Based Noncoherent Receivers forUltra-Wideband Impulse-Radio. InProceedings of International Zurich Seminar (IZS), Zurich,Switzerland, March 2010

[133] C. Stierstorfer, R. F.H. Fischer, J. B. Huber. Optimizing BICM with Convolutional Codes forTransmission over the AWGNChannel. In Proceedings of International Zurich Seminar (IZS),Zurich, Switzerland, March 2010

[134] C. Siegl, R. F.H. Fischer. Transmission and Detection of Side Information for Selected Map-ping in MIMO OFDM. In Proceedings of International ITG/IEEE Workshop on Smart Anten-nas, Bremen, Germany, March 2010

[135] C. Siegl, R. F.H. Fischer. Asymptotic Performance Analysis and Successive Selected Mappingfor PARReduction inOFDM. IEEETransactions on Signal Processing, Vol. 58, No. 6, pp. 3228–3237, April 2010

[136] C. Siegl, R. F.H. Fischer. Selected Mapping with Explicit Transmission of Side Information. InProceedings of Wireless Communications and Networking Conference, Sydney, Australia, April2010

[137] A. Schenk, R. F.H. Fischer. Soft-Output Sphere Decoder for Multiple-Symbol DiOerentialDetection of Impulse-Radio Ultra-Wideband. In Proceedings of International Symposium onInformation #eory (ISIT), pp. 2258–2262, Austin, TX, USA, June 2010

[138] C. Siegl, R. F.H. Fischer, E. MustaSn. Active Constellation Extension for Increasing the Ca-pacity of Clipped OFDM. In Proceedings of 15th International OFDM Workshop (InOWo),Hamburg, Germany, September 2010

[139] C. Stierstorfer, C. Siegl, R. F.H. Fischer, T. Wild, C. Hoek. Network MIMO Downlink Trans-mission. In Proceedings of 15th International OFDMWorkshop (InOWo), Hamburg, Germany,September 2010

[140] R. F.H. Fischer, C. Siegl. Probabilistic Signal Shaping in MIMO OFDM via Successive Can-didate Generation. European Transactions on Telecommunications (ETT), Vol. 21, No. 7, pp.648–654, 2010

[141] R. F.H. Fischer. FromGram-Schmidt Orthogonalization via Sorting and Quantization to Lat-tice Reduction. In Proceedings of Joint Workshop on Coding and Communications (JWCC),Santo Stefano Belbo, Italy, October 2010

13

[142] Ü.Abay, R.F.H. Fischer. Comparison ofGeneralized Tomlinson-Harashima Precoding Strate-gies for the Broadcast Channel. In Proceedings of International ITG/IEEE Workshop on SmartAntennas , Aachen, February 2011

[143] A. Schenk, R. F.H. Fischer. Decision-FeedbackDiOerential Detection in Impulse-RadioUltra-Wideband Systems. Accepted for publication in IEEE Transactions on Communications, 2011

[144] R.F.H. Fischer. EPcient Lattice-Reduction-Aided MMSE Decision-Feedback Equalization.Accepted for presentation at International Conference on Acoustics, Speech and Signal Process-ing (ICASSP), May 2011

Bertrand M. HochwaldDepartment of Electrical Engineering home:University of Notre Dame 1329 E. Jefferson Blvd275 Fitzpatrick Hall South Bend, IN 46617Notre Dame, IN 46556 tel: 574-520-1600voice: 574-631-8875, cell: 574-261-1857e-mail: bhochwald@nd.edu, hochwald@ieee.org

Degrees: BS (Engineering) 1984, Swarthmore CollegeMS (Electrical Engineering) 1986, Duke UniversityMA (Statistics) 1993, Yale UniversityPhD (Electrical Engineering) 1995, Yale University

Experience: Department of Defense, Fort Meade, Maryland. Electrical Engineer, 1986–1989.Yale University, New Haven, Connecticut. Teaching assistant, 1990–1994.University of Illinois, Urbana-Champaign

Postdoctoral Research Associate in data compression, 1995.Visiting Faculty in Department of Electrical Engineering, 1996.

Bell Laboratories, Lucent Technologies, Murray Hill, New JerseyMember of Technical Staff, 1996–2002.Distinguished Member of Technical Staff, 2002–2005.

Columbia University, New YorkVisiting Faculty in Department of Electrical Engineering, 2005.

Beceem Communications, Santa Clara, CaliforniaChief Scientist, 2005–2009,Vice-President Systems Engineering, 2009–2010.

Stanford University, Palo Alto, CaliforniaConsulting Professor of Electrical Engineering, 2006–2010.

University of Notre Dame, Notre Dame, IndianaFrank M. Freimann Professor of Electrical Engineering, 2011–present.

Honors: New York State Regents Scholarship, 1980.Pennsylvania ACM computer programming competition. Winner, 1983.Duke University. Eta Kappa Nu (engineering honor society), 1985.Department of Defense. Special Achievement Awards, 1988, 1989.Yale University. Prize Teaching Fellowship (teaching award), 1993.Bell Laboratories. President’s Gold Award, 2002.Thomson Essential Science Indicators. Top one-tenth of one percent

referenced papers, 2002 and 2003.IEEE Transactions on Communications. Steven O. Rice Best Paper Award, 2006.IEEE Fellow, 2008.

Patents: “Multiple Antenna Communication System and Method Thereof,” # 6058105, May 2, 2000.“Wireless Transmission Method for Antenna Arrays, Having Improved Resistance

to Fading,” # 6327310, December 4, 2001.“Antenna Array Having Reduced Sensitivity to Frequency-Shift Effects,”

# 6349219, February 19, 2002.“Wireless Transmission Method for Antenna Arrays Using

Unitary Space-Time Signals,” # 6363121, March 26, 2002.

Patents (cont’d):“Space-Time Spreading Method of CDMA Wireless Transmission,”

# 6452916, September 17, 2002.“Method of Wireless Communication Using Structured Unitary Space-Time Signal

Constellations,” # 6693976, February 17, 2004.“Method for Wireless Differential Communication Using Multiple

Transmitter Antennas,” # 6724842, April 20, 2004.“Method for Wireless Communication using Unitary

Space-Time Signal Constellations,” # 6801579, October 5, 2004.“Method of Multiple-Antenna Wireless Communication Using

Space-Time Codes,” # 6944236, September 13, 2005.“Cayley-Encodation of Unitary Matrices for Differential Communication,”

# 7170954, January 30, 2007.“Method and Apparatus for Detection and Decoding of Signals Received

from a Linear Propagation Channel,” # 7236536, June 26, 2007.“Method of Signal Transmission to Multiple Users From a

Multi-Element Array,” # 7317764, January 08, 2008.“Downlink Coordinated Transmission in OFDMA Systems,” # 7706335, April 27, 2010.“Downlink Coordinated Transmission in OFDMA Systems, Including

WiMax Systems” # 7764658, July 27, 2010.

Professional Activities and Plenary Talks

“Multiple Antennas: How a Point-to-Point Advantage Becomes a Multi-user Advantage.” Plenary Speakerat the 22nd Biennial Symposium on Communications, Queens University, Kingston, Ontario, June 2004.

“A Random-Channel Graph-Theoretic Perspective of Wireless Networks.” Plenary Speaker at the 2006Seventh Annual IEEE Workshop on Signal Processing Advances in Wireless Communication, Cannes,France, July 2006.

“The Role of MIMO in Fourth-Generation Mobile Wireless Systems and Beyond.” Plenary Speaker at the2009 IEEE Communication Theory Workshop, Napa, California, May 2009.

“What Have We Learned So Far About MIMO in Mobile Wireless Systems?” Plenary Speaker at the 2009Tenth Annual IEEE Workshop on Signal Processing Advances in Wireless Communication, Perugia,Italy, June 2009.

Editorial and Panelist Activities

Guest Associate Editor, IEEE Transactions on Signal Processing Special Issue on Signal Processing forCommunications, with N. Al-Dhahir, G. Giannakis, B. Hughes and T. Marzetta, vol. 50, October 2002.

Guest Editor, IEEE Transactions on Information Theory Special Issue on Space-Time Transmission, Re-ception, Coding and Signal Design, with G. Caire, B. Hassibi and T. Marzetta, vol. 49, October 2003.

Associate Editor for MIMO Techniques, IEEE Transactions on Communications, November 2003–2005.

Panelist, National Science Foundation Signal Processing Systems Faculty Early Career Development Pro-gram (CAREER), November 2002; National Science Foundation Computer and Information ScienceCommunications/Signal-Processing Research Program, April 2004; National Science Foundation The-oretical Foundations of Communications and Signal-Processing Research Program, May 2007; Na-tional Science Foundation Computing and Communication Foundations (CCF): Core Programs, Febru-ary 2010.

Owner and Editor of http://mars.bell-labs.com, the Multiple-Antenna Research and Solutionsweb-site dedicated to promoting research into space-time techniques. (800 subscribers)

Courses, Book Chapters, Tutorials

“Probabilistic Methods in Signal and System Analysis.” Senior-level undergraduate course, University ofIllinois, Urbana-Champaign, January–May 1996.

“Multi-Antenna Wireless Communications—from Theory to Algorithms,” with B. Hassibi and T.Marzetta. Tutorial at IEEE Conference on Acoustics, Speech and Signal Processing, Orlando, FL,May 2002.

“Communication Theory.” Senior-level undergraduate course, Columbia University, September–December 2005.

“Linear and Dirty-Paper Techniques for the Multiuser MIMO Downlink,” with Christian B. Peel, QuentinH. Spencer, A. Lee Swindlehurst and Martin Haardt. Book chapter in Space-Time Processing forMIMO Communications, A. B. Gershman and N. D. Sidiropoulos (editors), Chichester: John Wiley &Sons, 2005.

Co-Advised PhD Students

Ibrahim Abou-Faycal (Massachusetts Institute of Technology) 1998; Sriram Vishwanath (Stanford Uni-versity) 2002; Christian Peel (Brigham-Young University) 2003; Radhika Gowaikar (Caltech) 2005;Heunchul Lee and Kyoung Jae Lee (Korea University) 2007.

Theses and Journal Papers

“Aspects of Vector-Sensor Processing.” PhD thesis, Yale University, 1995.

B. Hochwald and A. Nehorai, “Concentrated Cramer-Rao bound expressions,” IEEE Transactions on In-formation Theory, vol. 40, pp. 363–371, March 1994.

B. Hochwald and A. Nehorai, “Minimum bias priors for estimating additive terms in state-space models,”IEEE Transactions on Automatic Control, vol. 40, pp. 684–693, April 1995.

B. Hochwald and A. Nehorai, “Polarimetric modeling and parameter estimation with applications to re-mote sensing,” IEEE Transactions on Signal Processing, vol. 43, pp. 1923–1935, August 1995.

B. Hochwald and A. Nehorai, “Identifiability in array processing models with vector-sensor applications,”IEEE Transactions on Signal Processing, vol. 44, pp. 83–95, January 1996.

B. Hochwald and A. Nehorai, “On identifiability and information-regularity in parameterized normal dis-tributions,” Circuits, Systems, and Signal Processing, vol. 16, pp. 83–89, January 1997.

B. Hochwald and A. Nehorai, “Magnetoencephalography with diversely-oriented and multi-componentsensors,” IEEE Transactions on Biomedical Engineering, vol. 44, pp. 40–50, January 1997.

B. Hochwald and K. Zeger, “Tradeoff between source and channel coding,” IEEE Transactions on Infor-mation Theory, vol. 43, pp. 1412–1424, September 1997.

B. Hochwald, “Tradeoff between source and channel coding on a Gaussian channel.” IEEE Transactionson Information Theory, vol. 44, pp. 3044–3055, November 1998.

B. Hochwald and P. Jelenkovic, “State Learning and Mixing in Entropy of Hidden Markov Processes andthe Gilbert-Elliott Channel,” IEEE Transactions on Information Theory, vol. 45, pp. 128–138, January1999.

T. Marzetta and B. Hochwald, “Capacity of a mobile multiple-antenna communication link in Rayleighflat fading,” IEEE Transactions on Information Theory, vol. 45, pp. 139–157, January 1999.

B. Hochwald and T. Marzetta, “Unitary space-time modulation for multiple-antenna communications inRayleigh flat fading,” IEEE Transactions on Information Theory, vol. 46, pp. 543–564, March 2000.

B. Hochwald, T. Marzetta, T. Richardson, W. Sweldens, and R. Urbanke, “Systematic design of uni-tary space-time constellations,” IEEE Transactions on Information Theory, vol. 46, pp. 1962–1973,September 2000.

B. Hochwald and W. Sweldens, “Differential unitary space-time modulation,” IEEE Transactions on Com-munications, vol. 48, pp. 2041–2052, December 2000.

B. Hochwald and T. Marzetta, “Adapting a downlink array from uplink measurements,” IEEE Transactionson Signal Processing, vol. 49, pp. 642–653, March 2001.

B. Hochwald, T. Marzetta, and C. Papadias, “A transmitter diversity scheme for wideband CDMA systemsbased on space-time spreading,” IEEE Journal on Selected Areas of Communication: Special Issue onWideband CDMA, vol. 19, pp. 48–60, March 2001.

A. Shokrollahi, B. Hassibi, B. Hochwald, and W. Sweldens, “Representation theory for high-rate multiple-antenna code design,” IEEE Transactions on Information Theory, vol. 47, pp. 2335–2367, September2001.

B. Hochwald, T. Marzetta, and B. Hassibi, “Space-time autocoding,” IEEE Transactions on InformationTheory, vol. 47, pp. 2761–2781, November 2001.

T. Marzetta, B. Hassibi, and B. Hochwald, “Structured unitary space-time autocoding constellations,”IEEE Transactions on Information Theory, vol. 48, pp. 942–950, April 2002.

B. Hassibi and B. Hochwald, “Cayley differential unitary space-time codes,” IEEE Transactions on Infor-mation Theory, vol. 48, pp. 1485–1503, June 2002.

B. Hassibi and B. Hochwald, “High-rate codes that are linear in space and time,” IEEE Transactions onInformation Theory, vol. 48, pp. 1804–1824, July 2002.

N. Al-Dhahir, G. Giannakis, B. Hochwald, B. Hughes, and T. Marzetta, “Guest editorial,” IEEE Transac-tions on Signal Processing, vol. 50, pp. 2381–2384, October 2002.

B. Hochwald and S. ten Brink, “Achieving near-capacity on a multiple-antenna channel,” IEEE Transac-tions on Communications, vol. 53, pp. 389–399, March 2003.

B. Hassibi and B. Hochwald, “How much training is needed in multiple-antenna wireless links?” IEEETransactions on Information Theory, vol. 49, pp. 951–963, April 2003.

B. Hochwald, G. Caire, B. Hassibi, and T. Marzetta, “The academic and industrial embrace of space-time methods,” IEEE Transactions on Information Theory: Special Issue on Space-Time Transmission,Reception, Coding and Signal Processing, vol. 49, pp. 2329–2331, October 2003.

B. Hochwald, T. Marzetta, and V. Tarokh, “Multiple-antenna channel hardening and its implications forrate-feedback and scheduling,” IEEE Transactions on Information Theory, vol. 50, pp. 1893–1909,September 2004.

H. Vikalo, B. Hassibi, B. Hochwald, and T. Kailath, “On the capacity of frequency-selective channelsin training-based transmission schemes,” IEEE Transactions on Signal Processing, vol. 52, pp. 2572–2583, September 2004.

D. Garrett, L. Davis, S. ten Brink, B. Hochwald, and G. Knagge, “Silicon complexity for maximum-likelihood MIMO detection using spherical decoding,” IEEE Journal of Solid State Circuits, vol. 39,pp. 1544–1552, September 2004.

A. Alexiou, D. Avidor, P. Bosch, S. Das, P. Gupta, B. Hochwald, T. Klein, J. Ling, A. Lozano, T. Marzetta,S. Mukherjee, C. Papadias, R. Valenzuela, and H. Viswanathan, “Duplexing, resource allocation, andinter-cell coordination: design recommendations for next-generation wireless systems,” Wireless Com-munications and Mobile Computing, vol. 5, pp. 77–93, May 2005.

T. Marzetta and B. Hochwald, “Fast transfer of channel state information in wireless systems,” IEEETransactions on Signal Processing, vol. 54, pp. 1268–1278, April 2006.

R. Gowaikar, B. Hochwald, and B. Hassibi, “Communication over a wireless network with random con-nections,” IEEE Transactions on Information Theory, vol. 52, pp. 2857–2871, July 2006.

C. Peel, B. Hochwald and A. L. Swindlehurst, “A vector-perturbation technique for near-capacity multi-antenna multi-user communication—Part I: Channel inversion and regularization,” IEEE Transactionson Communications, vol. 53, pp. 195–202, January 2005. Winner of Steven O. Rice Best PaperAward in 2006.

B. Hochwald, C. Peel, and A. L. Swindlehurst, “A vector-perturbation technique for near-capacity multi-antenna multi-user communication—Part II: Perturbation,” IEEE Transactions on Communications,vol. 53, pp. 537–544, March 2005. Winner of Steven O. Rice Best Paper Award in 2006.

A. Ashikhmin, A. van Wijngaarden, Z. Haibo, B. Hochwald, T. Marzetta, V. Purohit, C. Qinghong, P.Wilford, S-R. Zhou, M. Zuniga, E. Zuranski, “Design and development of a terrestrial digital videobroadcast demodulation core: An international collaborative effort,” Bell Labs Technical Journal, vol.12, pp. 97–118, 2007.

B. Hochwald and H. Artes, “Orthogonalizing beams to train unscheduled terminals,” IEEE Transactionson Signal Processing, vol. 57, pp. 3063–3074, August 2009.

E. Stauffer and B. Hochwald, “Low-complexity multi-stream space-time codes—Part I: Direct-sum codesand design criteria,” submitted to IEEE Transactions on Communications, March 2010.

B. Hochwald and E. Stauffer, “Low-complexity multi-stream space-time codes—Part II: Unitary-transform codes,” submitted to IEEE Transactions on Communications, April 2010.

Conference Papers

B. Hochwald and A. Nehorai, “Minimum bias priors for estimating additive terms in state-space models,”Proceedings of the Twenty-Sixth Asilomar Conference on Signals, Systems, and Computers, pp. 836–840, Pacific Grove, CA, October 1992 (Invited).

B. Hochwald and A. Nehorai, “Electromagnetic vector sensors and active target localization and identi-fication,” IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. IV 25–28,Minneapolis, MN, April 1993.

B. Hochwald and A. Nehorai, “Identifiability in array processing models with vector-sensor applications,”Proceedings of the IEEE Seventh Signal Processing Workshop on Statistical Signal and Array Process-ing, pp. 121–124, Quebec City, Canada, June 1994.

B. Hochwald and A. Nehorai, “Polarimetric modeling and parameter estimation with electromagnetic vec-tor sensors,” Proceedings of the 1994 IEEE International Geoscience and Remote Sensing Symposium,pp. 1129–1132, Caltech, Pasadena, CA, August 1994 (Invited).

B. Hochwald and A. Nehorai, “Optimizing an array of sensors for magnetoencephalography,” Proceedingsof the 17th Annual International Conference of the IEEE Engineering in Medicine and Biology Society,pp. 861–862, Montreal, Canada, September 1995.

B. Hochwald and K. Zeger, “Bounds on the tradeoff between source and channel coding with a delayconstraint,” Proceedings of 1996 International Symposium on Information Theory and its Applications,pp. 755–758, Victoria, Canada, September 1996.

B. Hochwald and K. Zeger, “Tradeoff between source and channel coding,” Proceedings of 1997 Interna-tional Symposium on Information Theory, pg. 335, Ulm, Germany, June 1997.

B. Hochwald and T. Marzetta, “Multiple-antenna communications when nobody knows the Rayleigh fad-ing coefficients,” Proceedings of Thirty-Fifth Annual Allerton Conference on Communication, Controland Computing, pp. 1033–1042, Monticello, IL, September 1997.

B. Hochwald and P. Jelenkovic, “The role of memory in entropy approximation for hidden Markov mod-els,” Proceedings of Thirty-Fifth Annual Allerton Conference on Communication, Control and Com-puting, pp. 1013–1022, Monticello, IL, September 1997.

T. Marzetta and B. Hochwald, “Fundamental limitations on multiple-antenna wireless links in Rayleighfading,” Proceedings of 1998 International Symposium on Information Theory, pg. 310, Boston, MA,August 1998.

B. Hochwald, “Source and channel coding tradeoff on a Gaussian channel,” Proceedings of 1998 Interna-tional Symposium on Information Theory, pg. 248, Boston, MA, August 1998.

B. Hochwald and T. Marzetta, “Space-time modulation scheme for unknown Rayleigh fading environ-ments,” Proceedings of Thirty-Sixth Annual Allerton Conference on Communication, Control and Com-puting, pp. 431–440, Monticello, IL, September 1998.

B. Hochwald and T. Marzetta, “Space-time modulation for unknown fading,” Proceedings of SPIE, DigitalWireless Communication, pp. 10–19, Orlando, FL, April 1999.

B. Hochwald, C. Papadias, T. Marzetta, M. Buehrer and R. Soni, “Space-time spreading for CDMA sys-tems,” Sixth workshop on Smart Antennas in Wireless Mobile Communications, Stanford University,Stanford, CA, July 1999.

B. Hochwald and W. Sweldens, “Multiple-antenna differential modulation,” Proceedings of Thirty-SeventhAnnual Allerton Conference on Communication, Control, and Computing, pp. 1266–1273, Monticello,IL, September 1999.

B. Hochwald, T. Marzetta, and C. Papadias, “A novel space-time spreading scheme for wireless CDMAsystems,” Proceedings of Thirty-Seventh Annual Allerton Conference on Communication, Control, andComputing, pp. 1284–1293, Monticello, IL, September 1999.

T. Marzetta, B. Hochwald, and B. Hassibi, “A new approach to single-user multiple-antenna wirelesscommunication,” Proceedings of the 2000 Conference on Information Sciences and Systems, pp. WA4-16–WA4-21, Princeton, NJ, March 2000.

T. Marzetta, B. Hochwald, and B. Hassibi, “Space-time autocoding: arbitrarily reliable communication ina single fading interval,” Proceedings of the 2000 International Symposium on Information Theory, pg.313, Sorrento, Italy, June 2000.

B. Hassibi, B. Hochwald, A. Shokrollahi, and W. Sweldens, “Multiple antennas and representation theory,”Proceedings of the 2000 International Symposium on Information Theory, pg. 337, Sorrento, Italy, June2000.

B. Hochwald and W. Sweldens, “A method of differential transmission with multiple antennas,” Proceed-ings of the IEEE Sixth International Symposium on Spread-Spectrum Techniques and Applications, pg.122, Parsippany, NJ, September 2000.

B. Hassibi, B. Hochwald, A. Shokrollahi, and W. Sweldens, “Codes for differential signaling with manyantennas,” Wireless Communications and Networking Conference, pp. 23–24, vol. 1, 2000.

B. Hassibi and B. Hochwald, “Optimal training in space-time systems,” Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers, pp. 743–747, vol. 1, Asilomar, CA,October 2000.

B. Hassibi and B. Hochwald, “High-rate linear space-time codes,” Proceedings of the Thirty-Eighth An-nual Allerton Conference on Communication, Control and Computing, pp. 1047–1056, Monticello, IL,October 2000.

H. Vikalo, B. Hassibi, B. Hochwald, and T. Kailath, “Optimal training for frequency-selective fadingchannels,” Proceedings of the 2001 IEEE International Conference on Acoustics, Speech and SignalProcessing, pp. 2105–2108, vol. 4, Salt Lake City, UT, May 2001.

B. Hassibi and B. Hochwald, “High-rate linear space-time codes,” Proceedings of the 2001 IEEE Interna-tional Conference on Acoustics, Speech and Signal Processing, pp. 2461–2464, vol. 4, Salt Lake City,UT, May 2001.

B. Hassibi and B. Hochwald, “Linear dispersion codes,” Proceedings of the IEEE International Symposiumon Information Theory, pg. 325, Washington, D.C., June 2001.

T. Marzetta, B. Hassibi, and B. Hochwald, “Space-time autocoding constellations with pairwise-independent signals,” Proceedings of the IEEE International Symposium on Information Theory, pg.326, Washington, D.C., June 2001.

B. Hochwald and S. ten Brink, “Iterative list sphere decoding to attain capacity on a multi-antenna link,”Proceedings of the Thirty-Ninth Annual Allerton Conference on Communication, Control and Comput-ing, pp. 815–824, Monticello, IL, October 2001.

B. Hochwald and B. Hassibi, “Cayley codes for multi-antenna differential modulation,” Conference Recordof the Thirty-Fifth Asilomar Conference on Signals, Systems and Computers, pp. 232–235, vol. 1,Asilomar, CA, October 2001.

V. Tarokh and B. Hochwald, “Existence and construction of block interleavers,” IEEE International Con-ference on Communications, pp. 1855–1857, vol. 3, New York, NY, April 2002.

S. ten Brink and B. Hochwald, “Detection thresholds of iterative MIMO processing,” Proceedings of the2002 International Symposium on Information Theory, pg. 22, Lausanne, Switzerland, June 2002.

B. Hochwald and S. Vishwanath, “Space-Time Multiple Access: Linear growth in the sum-rate,” Proceed-ings of the Fortieth Annual Allerton Conference on Communication, Control and Computing, Monti-cello, IL, October 2002.

B. Hochwald, T. Marzetta, and V. Tarokh, “Multi-antenna channel hardening and its implications forrate feedback and scheduling,” DIMACS Workshop on Signal Processing for Wireless Transmission,Piscataway, NJ, October 2002.

D. Garrett, L. Davis, B. Hochwald, and S. ten Brink, “APP processing for high-performance MIMO sys-tems,” Proceedings of the Twenty-Fifth IEEE Custom Integrated Circuits Conference, San Jose, CA,September 2003.

B. Hochwald, C. Peel, and L. Swindlehurst, “Achieving near-capacity in multi-antenna multi-user sys-tems,” Proceedings of the Forty-First Annual Allerton Conference on Communication, Control andComputing, Monticello, IL, October 2003.

T. Marzetta and B. Hochwald, “Learning the channel at the transmitter,” Proceedings of the Forty-SecondAnnual Allerton Conference on Communication, Control and Computing, Monticello, IL, October2004.

R. Gowaikar, B. Hochwald and B. Hassibi, “An Achievability result for random networks,” Proceedingsof the 2005 International Symposium on Information Theory, Adelaide, Australia, September 2005.

C. Yuen and B. Hochwald, “Dropping users in a multi-antenna broadcast channel,” Proceedings of theInformation Theory and Applications Workshop, San Diego, CA, February 2006.

R. Gowaikar, B. Hochwald and B. Hassibi, “Throughput scaling in random wireless networks,” Proceed-ings of the Information Theory and Applications Workshop, San Diego, CA, February 2006.

C. Yuen and B. Hochwald, “How to gain 1.5 dB in vector precoding” Proceedings of the 2006 IEEE GlobalTelecommunications Conference, San Francisco, CA, November 2006.

D. Love, B. Hochwald and K. Krishnamurthy, “Exchanging third-party information in a network,” Pro-ceedings of the Information Theory and Applications Workshop, San Diego, CA, February 2007.

B. Hochwald and H. Artes, “Orthogonalizing a random set of beams,” Proceedings of the InformationTheory and Applications Workshop, San Diego, CA, February 2008.

E. Stauffer and B. Hochwald, “Low-complexity space-time codes for high and low-priority streams,” Pro-ceedings of the Information Theory and Applications Workshop, San Diego, CA, February 2009.

L. Jalloul, N. Czink, B. Hochwald, and A. Paulraj, “Why downlink cyclic delay diversity helps uplinktransmit diversity,” Proceedings of the 69th IEEE Vehicular Technology Conference, Barcelona, Spain,April 2009.

B. Hochwald and L. Jalloul, “Statistical distributions that arise in constrained beamforming with incom-plete channel information,” Proceedings of the Information Theory and Applications Workshop, SanDiego, CA, February 2010.

CURRICULUM VITAE Alexander Semenovich HOLEVO (KHOLEVO) Born 2 September 1943 in Moscow, USSR. 1960 - 1969: Moscow Institute for Physics and Technology Diploma - with first class honors in applied mathematics and computer science: 1966 Candidate of physico-mathematical sciences (PhD): 1969 1969 -: Steklov Mathematical Institute, Moscow Senior researcher: 1975 Doctor of physico-mathematical sciences (Dr. habil.): 1975 Member of the Scientific Council on Analysis, Probability and Mathematical Statistics: 1980- Leading researcher: 1986- 1970 - : Parallel teaching at the Moscow Institute for Physics and Technology, Moscow Independent University, Lomonosov State University Docent: 1978 Professor: 1984 Visiting Professorships: 1993: The Royal Society Kapitza Visiting Research Fellow, University of Nottingham 1992 -- 1997: Visiting Professor for several short periods, University of Milan 1994, 1997: Visiting Professor, University of Marburg 1997: Visiting Professor, Northwestern University, Evanston Il 1995 -- 2000: Visiting Professor for several short periods,Tamagawa University, Tokyo 1999 -- 2000: The A. von Humboldt Awardee, Technical University of Braunschweig 2000 -- 2001: The Mercator Professor, University of Marburg 2003: Visiting Research Scholar, St John’s College, Cambridge UK 2004: Follow-up visit as A. von Humboldt Awardee, Technical University of Braunschweig 2005 – 2006: The Leverhulme Visiting Professor, University of Cambridge UK Visiting for short periods the Universities and Research Institutes in Berlin, Goettingen, Clausthal, Koeln, Heidelberg, Leipzig, Garching, Stockholm, London, Warwick, Swansea, Dublin, Pasadena, Albuquerque, Rome, Trieste, Como, Pavia, Genova, Pisa, Bari, Tokyo, Nagoya, Kyoto, Delhi, Calcutta, Bangalore, Warsaw, Torun, Budapest, St.Petersburg, Kazan, Vilnius, Tashkent, Singapore Member of the Editorial Boards: Reports on Mathematical Physics: 1976- Izvestija Vuzov – Mathematica: 1990- Lobachevsky Journal of Mathematics: 1996- Quantum Information Processing: 2002- Probability Theory and its Applications: 2002- Theoretical and Mathematical Physics: 2009- Russian Mathematical Surveys (Uspekhi): 2011- Member of Editorial Advisory Board in the book publishing program in mathematics http://www.versita.com/Book_Author/Mathematics/ launched jointly by de Gruyter and Versita: 2010-

Awards: Annual Russian Academy of Sciences Awards for the best scientific achievement - 1992, 1995, 2008 Russian Federation Stipendium for Distinguished Scientists - 1994-; International Quantum Communication Award - 1996 Markov Prize, Russian Academy of Sciences -- 1997 A. von Humboldt Research Award -- 1999 Publications: Complete list contains nearly 170 titles in leading scientific journals (see attached list), including the monographs: “Investigations in the general theory of statistical decisions”. Proc. Steklov Math. Inst. 1976, v.124, (AMS Translation 1978, Issue 3); “Probabilistic and statistical aspects of quantum theory”. Nauka, Moscow, 1980 (North Holland Translation 1982; 2nd Edition – Edizioni SNS, Pisa 2011); “Statistical structure of quantum theory”. Lect. Notes Phys. m67, Springer, Berlin, 2001; “An introduction to quantum information”. Moscow Independent University, Moscow, 2002 (in Russian); “Quantum systems, channels, information”. Moscow Independent University, Moscow, 2010 (in Russian). Festschrift: “Quantum Information, Statistics, Probability”. Rinton Press, Princeton NJ, 2004. http://www.mi.ras.ru/~holevo/festschrift.html

LIST OF PUBLICATIONSby A. S. Holevo

1. A generalization of von Neumann’s theorem on the operator T ∗T to spaces withindefinite metric. Sci. Notes Az. Univ. (Ser. phys.-math.), 1965, N2, 45-48,

2. Automata forecasting stochastic process. USSR Acad. Sci. Dokl. Math., 1965,v.164, N3, 515-518,

3. On sequential estimates of parameters. Theor. Probab. and Appl., 1967, v.12, N1,172-179,

4. Estimates of parameters of a diffusion process via stochastic approximation method.Proc. Comp. Center USSR Acad. Sci., 1967, v.12, 179-120

5. On adaptive filters. 1st All-Union Symp. Statist. Probl. in Techn. Cybern.,Moscow, 1967, Abstracts, pt.1, 143-144

6. On estimates of regression coefficients. Theor. Probab. and Appl., 1969, v.14, N1,78-101

7. On the estimates of regression coefficients in case of continuous time. Theor.Probab. Appl., 1969, v.14, N4, 753

8. On estimates of regression coefficients. Candidate dissertation. Steklov Math. Inst.,1969, 73p.

9. On quantum characteristic functions. Probl. Inform. Transm., 1970, v.6, N4, 42-48

10. Estimates of almost-periodic signals. Theor. Probab. and Appl., 1971, v.16, N2249-263

11. On the asymptotic efficiency of the pseudo-best estimates. Theor. Probab. andAppl., 1971, v.16, N3, 524-534

12. On the asymptotic normality of the regression coefficients estimates. Theor. Probab.and Appl., 1971, v.16, N4, 724-728

13. Generalized free states of the C∗-algebra of the CCR. Theor. Math. Phys., 1971,v.6, N1, 3-20

14. Generalized free states of the C∗-algebra of the CCR. II. Theor. Math. Phys., 1971,vol. 6, N2, 145-150

15. On quasiequivalence of locally normal states. Theor. Math. Phys., 1972, v.13, N2,184-199

16. On the estimates of functions of the mean value. Theor. Probab. and Appl., 1972,v.17, N3, 573-575

1

17. Towards the mathematical theory of quantum communication channels. Probl. In-form. Transm., 1972, v.8, N1, 63-71

18. Statistical problems in quantum physics. Proc. 2nd Japan-USSR Symp. on Probab.Theory, Kyoto, 1972, v.1, 22-40

19. An analog of statistical decision theory in the noncommutative probability. Proc.Moscow Math. Soc., 1972, v.26, 133-149

20. Some statistical problems for quantum fields. Theor. Probab. and Appl., 1972, v.1972, v.17, N2, 360-365

21. On quasiequivalence of the generalized free states on the C∗-algebra of CAR. Theor.Math. Phys., 1973, v.14, N2, 145-151

22. On the general problem of mean estimation. J. Multiv. Anal., 1973, v.3, N3 262-275

23. Information-theoretic aspects of quantum measurement. Probl. Inform. Transm.1973, v. 9, N2, 31-42

24. Some estimates for information quantity transmitted by quantum communicationchannel. Probl. Inform. Transm., 1973, v. 9, N3, 3-11

25. Optimal measurements of quantum signal parameters. 3d Int. Symp. Inf. Theory,Tallin, 1973, Abstracts, pt.1, 147-149

26. On the noncommutative analog of the maximum likelihood method. Int. Conf.Theor. Probab. and Statist., Vilnius, 1973, Abstracts, v.2,317-320

27. Statistical decision theory for quantum systems. J. Multiv. Anal., 1973, v.3, N4,337-394

28. On a generalization of Cramer-Rao inequality. Theor. Probab. Appl.,1973, v.18,N2, 371-375

29. Statistical decisions in quantum theory. Theor. Probab. Appl.,1973, v.18, N2,442-444

30. Optimal quantum measurements. Theor. Math. Phys., 1973, v.17, N3, 184-199

31. On the optimal measurement of the mean value of Gaussian state. Techn. Cyber-netics, 1974, N5, 152-152

32. On statistical decision theory on an operator algebra. USSR Acad. Sci. Dokl.Math., 1974, v.218, N1, 54-57

33. Remarks on optimal quantum measurements. Probl. Inform. Transm., 1974, v.10,N4, 51-55

34. Some statistical problems for quantum Gaussian states. IEEE Trans. Inform. The-ory, 1975, v.21, N5, 533-543

2

35. On a vector valued integral in the “non-commutative” statistical decision theory. J.Multiv. Anal., 1975, v.5, 462-465

36. Mathematical problems in the theory of quantum channels. Proc. Steklov Inst.Math., 1975, v.135; English translation - 1978, Issue 1, 231-233

37. Integral with respect to measure with values in the space dual to partially orderedBanach space. Notices Sci. Sem. LOMI, 1976, v.55, 26-34

38. Investigations in the general theory of statistical decisions. Proc. Steklov Math.Inst. 1976, v.124 , 140p.; AMS Translation - 1978, Issue 3

39. Noncommutative analogues of the Cramer-Rao inequality in quantum measurementtheory. Lect. Notes Math., 1976, v.550, 194-222. Reproduced in Math. Methods ofStatistics, 2001, vol. 10, N1, 6-22.

40. Problems in the mathematical theory of quantum communication channels. Rep.Math. Phys., 1977, v.12, N2, 273-278

41. Commutation superoperator of a state and its applications to the noncommutativestatistics. Rep. Math. Phys., 1977, v.12, N2, 251-271

42. Estimation of shift parameters of quantum state. Rep. Math. Phys., 1978, v.13,N3, 379-399

43. On asymptotically optimal hypotheses testing in quantum statistics. Theor. Probab.Appl., 1978, v.23, N2, 429-432

44. (with N. P. Rasulov) A regression problem for continuous time series. Theor.Probab. Appl., 1978, v.23, N4, 762-771

45. On the capacity of quantum communication channel. Probl. Inform. Transm.,1979, v.15, N4, 3-11

46. Minimax measurements of parameters of quantum state. 5th Int. Symp. Inform.Theory, Tbilisi, 1979, Abstracts, 194-196

47. Sufficient statistics. Math. Encycl., v.2, 375-377. Soviet Encycl., Moscow, 1979

48. Quantum communication channel. Math. Encycl., v.2, 707-709. Soviet Encycl.,Moscow, 1979

49. Covariant measurements and uncertainty relations. Rep. Math. Phys., 1980, v.16,N3, 289-304

50. Probabilistic and statistical aspects of quantum theory. Nauka, Moscow, 1980 320p.; North Holland Translation - 1982

51. Uncertainty relations for angular parameter. 3d Int. Conf. Theor. Probab. Math.Stat., Vilnius, 1981, Abstracts, v.2, 232-233

3

52. (with N. A. Bogomolov) Resolutions of identity covariant with respect to represen-tation of locally compact Abelian group. Proc. Comp. Center MSU, 1981 45-59

53. Quantum-probabilistic study of the counting statistics with application to the Dolinarreceiver. Izv. VUZ. Matematika, 1982, v.26, N8, 3-19 ; English translation- SovietMath., 1-20.

54. Testing statistical hypotheses in quantum theory. Probab. Math. Statist., 1982,v.3, N1, 113-126 .

55. Quantum communication channel. Math. Encycl., v.2, 707-709. Soviet Encycl.,Moscow, 1982 .

56. Correlation function. Math. Encycl., v.3, 23-25. Soviet Encycl., Moscow, 1982 .

57. (with N. A. Bogomolov) On a bound for precision of covariant quantum measure-ments. Comp. Center MSU, 1982, 78-79 .

58. Bounds for generalized uncertainty of shift parameters. Lect. Notes Math., 1983,v. 1021, 243-251.

59. Generalized imprimitivity systems for Abelian groups. Izv VUZ. Matematika, 1983,N2, 49-71 ; English translation - Soviet Math., 53-80.

60. Measuring parameters of quantum stochastic process. 2nd All-Union Conf. Theor.Metrology, Abstracts, Leningrad, 1983, 28-29 .

61. (with N. A. Bogomolov) On a characterization of covariant resolutions of identity.Funct. Anal. Appl., 1983, v.17, N2, 64-65 .

62. On the measurements of parameter of a quantum stochastic process. Theor. Math.Phys., 1983, v. 57, N3, 424-437 .

63. On the structure of generalized imprimitivity systems. Int. Congress Math., Warszawa,1983, Abstracts, v.XI, 53.

64. Covariant measurements and imprimitivity systems. Lect. Notes Math., 1984, v.1055, 153-172.

65. Continuous measurements over quantum stochastic process. 6th Int. Symp. Inform.Theory, Tashkent, 1984, Abstracts, 255-257.

66. Statistical definition of observable and the structure of statistical models. Rep.Math. Phys., 1985, v.22, N3, 385-407.

67. On the principle of quantum non-demolition measurements. Theor. Math. Phys.1985, v. 65, N3, 415-422 .

68. Statistical structure of quantum theory and hidden variables. Ser. Math. Cybern.N6, Znanie, Moscow, 1985.

4

69. On a generalization of canonical quantization. Izv. Acad. Nauk SSSR, ser. mat.,1986, v.50, N1, 181-194 ; Translation - Math USSR Izvestiya, 1987, v.28, N1, 175-188.

70. Infinitely divisible measurements in quantum probability theory. Theor. Probab.Appl., 1986, v.32, N3, 560-564 .

71. Infinitely divisible characteristic functions in quantum probability. World BernoulliSoc. Congr., Tashkent, 1986, Abstracts, v.2, 691

72. The Levy-Khinchin type representation in quantum probability theory. Theor.Probab. Appl., 1987, v.32, N1, 142-146 .

73. Quantum estimation. Adv. Statist. Signal Proc.,1987, v.1, 157-202.

74. Conditionally positive-definite functions in quantum probability. Proc. of Internat.Congress of Mathematicians, Berkeley, Calif., USA (1986), 1987, 1011-1020.

75. A noncommutative generalization of conditionally positive definite functions. Lect.Notes Math., 1987, v.1303. 128-147.

76. Limit theorems for repeated measurements and continuous measurement processes.Lect. Notes Math., 1989, v.1396, 229-255.

77. Stochastic representations of quantum dynamical semigroups. Proc. Steklov Math.Inst., 1989, v.191, 130-139 ; AMS Translation: 1992, Issue 2, 145-154

78. Elements of multivariate random analysis and the theory of stochastic processes.Lecture course. Moscow Phys.-Tech. Inst., Moscow, 1989.

79. (with L. V. Denisov) Conditionally positive definite functions on the coefficientalgebra of a nonabelian group. Proc. 5th Vilnius Conf. Theor. Probab. and Math.Statist., 1989. V.1, 261-270.Mokslas, Vilnius - VSP, Utrecht, 1990.

80. Statistical inference for quantum processes. Lect. Notes Phys.,1991, v.378, 127-137.

81. Quantum stochastic calculus. Journ. of Soviet Math., 1991, v.56, 2609-2624.

82. An analog of the Ito decomposition for multiplicative processes with values in a Liegroup. Sankhya, ser. A, 1991, v.53, Pt.2, 158-161.

83. Quantum probability and quantum statistics. VINITI, Moscow, 1991, v.83, 132p.

84. Time-ordered exponentials in quantum stochastic calculus. Quant. Probab. Rel.Topics., 1992, v.7, 175-202.

85. A brief survey of the modern statistical theory of quantum measurement. in: Con-ceptual problems of quantum measurement theory, RAN INION, Moscow, 1992,19-29 .

5

86. (with A. Barchielli, G. Lupieri) An analog of Hunt’s representation theorem inquantum probability. J. Theor. Probab., 1993, v.6, 231-265.

87. A note on covariant dynamical semigroups. Rep.Math.Phys., 1993, v.32, 211-216.

88. On conservativity of covariant dynamical semigroups. Rep.Math.Phys., 1993, v.33,95-110.

89. Structure of covariant dynamical semigroups. Russian Acad. Sci. Dokl. Math.,1993, v.328, N6, 666-670 ; English translation - v.47, 161-167.

90. On the Levy-Khinchin formula in the non-commutative probability theory. Theor.Probab. and Appl., v.37, N2, 1993, 211-216.

91. (with A. Barchielli) Constructing quantum measurement processes via classicalstochastic calculus. Stoch.Proc. and Appl., 1995, v.58, 293-317.

92. On translation-covariant Markovian master equations. Izvestiya: Mathematics,1995, v.59, N2, 205-221 ; English translation - 427-443.

93. On the structure of covariant dynamical semigroups. J. Funct. Anal., 1995, v.131,255-278.

94. Excessive maps, ”arrival times” and perturbations of dynamical semigroups. Izvestiya:Mathematics., 1995, v.59, N6, 207-222 ; English translation - 1311-1325.

95. On dissipative stochastic equations in Hilbert space. Probab. Theory Rel. Fields,1996, v.104, 483-500.

96. Exponential formulae in quantum stochastic calculus. Proc. Royal Academy ofEdinbourgh., 1996, v.126A, 375-389.

97. Covariant quantum Markovian evolutions. J. Math. Phys., 1996, v.37(4), 1812-1832.

98. (with M. Sasaki, T. S. Usuda and O. Hirota) Application of the Jaynes- Kummingsmodel for the detection of nonorthogonal quantum states. Phys. Rev. A, 1996,v.53, 1273-1279.

99. Stochastic differential equations in Hilbert space and quantum Markovian evolu-tions. In: Probability Theory and Mathematical Statistics. Proc. 7th Japan-Russia Symp. Tokyo, 26-30.07.1995. Ed. S. Watanabe, M. Fukushima, Yu. V.Prohorov and A. N. Shiryaev. World Scientific, 1996, 122-131.

100. The structure of classical noise. In: Analysis, Geometry and Probability: Essays inhonour of K. R. Parthasarathy. Ed. R. Bhatia with assist. A. G. Bhatt. HindustanPublishing House, 1996.

101. There exists a non-standard dynamical semigroup on B(H). Uspekhi Mat. Nauk.,v. 51(6), 1996, 225-226.

6

102. On covariant instruments in quantum measurement theory. In: Quantum Communi-cation, Computing and Measurement. Proc. of the Third International Conference,Shizuoka, 25-30.09.1996. Ed. by O. Hirota, A. S. Holevo and C. M. Caves. PlenumPress, New York - London, 1997, 223-232.

103. The capacity of quantum channel with general signal states. Arxiv e-print quant-ph/9611023, 1996. Appeared in IEEE Trans. Inform. Theory, v. 44, N1, 1998,269-273.

104. On quantum communication channels with constrained inputs. Arxiv e-print quant-ph/9705054, 1997.

105. Coding theorems for quantum communication channels. Arxiv e-print quant-ph/9708046,1997. Extended abstract of the talk at ISIT’98, Cambridge MA, 16-21.08.1998.

106. Covariant quantum dynamical semigroups: unbounded generators. Arxiv e-printquant-ph/9701037, 1997. Appeared in “Quantum Theory in Rigged Hilbert Space– Irreversibility and Causality. Reviews and Contributions of the Semigroup Sim-posium at the XXI International Colloquium on Group Theoretical Methods inPhysics”, Eds. A. Bohm, H.-D. Doebner, P. Kielanowski, 1998.

107. (with M. V. Burnashev) On reliability function of quantum communication channel.Arxiv e-print quant-ph/9703013, 1997. Appeared in Probl. Peredachi Inform., v.34, N2, 1998, 1-13.

108. Dynamical semigroup. In: Encyclopaedia “Mathematical Physics,” Moscow, 1998,173-174.

109. Quantum measurement. In: Encyclopaedia “Mathematical Physics,” Moscow, 1998,256-258.

110. Quantum stochastic calculus. In: Encyclopaedia “Mathematical Physics,” Moscow,1998, 259-260.

111. Radon-Nikodym derivatives of quantum instruments. J. Math. Phys., vol. 39, N31998, 1373-1387.

112. Coding theorems for quantum channels. Research Reviews of Tamagawa University,N4, 1998. Extended version: Arxiv e-print quant-ph/9809023.

113. Generalized imprimitivity systems and canonical conjugateness in quantum me-chanics. In: Quantisation, Coherent States and Poisson Structures. Proc. XIVWorkshop on Geometrical Methods in Physics. Bialowieza 9-15.07.1995. PWN1998.

114. Quantum coding theorems. Uspekhi Mat. Nauk, vol. 53, N6, 1998, 193-230 ;English translation: Russian Math. Surveys, vol. 53, N6, 1998, 1295-1331.

7

115. Sending quantum information with Gaussian states. Arxiv e-print quant-ph/9809022.Proc. of the Fourth International Conference on Quantum Communication, Com-puting and Measurement, Evanston, 22-27.08.1998. Ed. by P.Kumar, M. D’Arianoand O. Hirota. Plenum Press, New York - London, 1999, 75-82.

116. (with M. Sohma and O. Hirota) The capacity of quantum Gaussian channels. Phys.Rev. A, vol. 59, N3, 1999, 1820-1828.

117. Probability in quantum physics. In: Encyclopaedia “Probability and MathematicalStatistics,” Moscow, 1999, 97-98 .

118. Quantum theory of hypotheses testing and estimation. In: Encyclopaedia “Proba-bility and Mathematical Statistics,” Moscow, 1999, 226-228 .

119. Quantum communication channel. In: Encyclopaedia “Probability and Mathemat-ical Statistics,” Moscow, 1999, 228-229.

120. Reliability function of general classical-quantum channel. IEEE Trans. on Infor-mation Theory, vol. 46, N6, 2000, 2256-2260. Arxiv e-print quant-ph/9907087,1999.

121. (with M. Sohma, O. Hirota) Error exponents of quantum channels with constrainedinputs. Rep. Math. Phys., vol. 46, N3, 2000, 343-358.

122. (with G. G. Amosov and R. F. Werner) On some additivity problems in quantuminformation theory. Probl. Inform. Transm., vol. 36, N4, 2000, 25-34. Arxiv e-printquant-ph/0003002.

123. (with R. F. Werner) Evaluating capacities of Bosonic Gaussian channels. Phys.Rev. A. , vol. 63, 2001, 032312; Arxiv e-print quant-ph/9912067, 1999.

124. Levy processes and continuous quantum measurements. In: “Levy processes,” Ed.O. Barndorff-Nielsen, T. Mikosch, S. Resnick, Birkhauser, Boston, 2001, pp. 225-239.

125. (with G. G. Amosov and R. F. Werner) On additivity/multiplicativity problemsfor quantum channels. Proc. V-th International Conference on Quantum Commu-nication, Computing and Measurement, Capri, 03-08.07.2000. Ed. O. Hirota, P.Tombesi. Kluver/Plenum Press, New York- London, 2001, pp. 3-10.

126. Coding theorems of quantum information theory. Proc. XIII International Congressfor Mathematical Physics, London, 16-23.07.2000. Ed. A. Fokas, A Grigoryan, T.Kibble, B. Zegarlinski. International Press, Boston, 2001, pp. 415-422.

127. An invitation to quantum estimation. Math. Methods of Statistics, vol. 10, N1,2001, 1-5.

128. Statistical structure of quantum theory. Lect. Notes Phys. m67, Springer, Berlin2001. 159p.

8

129. (with G. G. Amosov) On the multiplicativity conjecture for quantum channels.Arxiv e-print math-ph/0103015, 2001. Theor. Probab. Appl., vol. 47, N1, 2002,143-146.

130. On entanglement-assisted classical capacity. Arxiv e-print quant-ph/0106075, 2001.J. Math. Phys., vol. 43, N9, 2002, 4326-4333.

131. (with R. F. Werner) Counterexample to an additivity conjecture for output purityof quantum channels. Arxiv e-print quant-ph/0203003, 2002. J. Math. Phys., vol.43, N9, 2002, 4353-4357.

132. On states, channels and purification. Arxiv e-print quant-ph/0204077, 2002. Quan-tum Information Processing, vol.1, N1, 2002.

133. An introduction to quantum information theory. MCCME (Moscow IndependentUniversity), Moscow 2002. (rus.) 126p.

134. Entanglement-assisted capacity of constrained quantum channel. Arxiv e-printquant-ph/0211170, 2002.

135. Remarks on the classical capacity of quantum channel. Arxiv e-print quant-ph/0212025,2002.

136. Classical capacities of constrained quantum channel. Probab. theory and appl. v.48, N2, 2003, 359-374.

137. (with M. E. Shirokov) On Shor’s channel extension and constrained channels. Arxive-print quant-ph/0306196, 2003. Commun. Math. Phys. v. 249, 417-430, 2004.

138. Optimal receiver of a binary coherent signals based on the principle of optical feed-back. Laser Physics, vol. 13, N10, 2003, 1-4.

139. Asymptotic estimation of shift parameter of a quantum state, Arxiv quant-ph/0307225,2003. Probab. theory and appl. v. 49, N2, 2004,

140. Probabilistic and statistical aspects of quantum theory. 2d edition, corrected andcomplemented. ICI, Moscow-Izhevsk, 2003. (rus.) 404 p.

141. (with M. E. Shirokov) Additivity problem for constrained quantum channels. Rus-sian Math. Surveys, vol. 59, N2, 2004, 195-196.

142. (with N. Datta and Yu. M. Suhov) A quantum channel with additive minimumoutput entropy, Arxiv quant-ph/0403072. Problems of Information Transmission.41, N2, 2005, 9-25.

143. Additivity conjecture and covariant channels, Proc. Conference “Foundations ofQuantum Information”, Camerino, 16-19.04.2004. Int. J. Quant. Inform., vol. 3,N1, 2005, 41-48

9

144. (with M. E. Shirokov) Continuous ensembles and the χ-capacity of infinite dimen-sional channels. Probab. Theory and Appl. vol. 50, N1, 2005, 98-114.

145. Quantum Communication Channels in Infinite Dimensions, in: “Quantum Informa-tion Processing: from Theory to Experiment”, IOS Press, Amsterdam 2006, 41-60.

146. Convergence and compactness in state spaces, Proc. conf. to the memory of T. A.Sarymsakov, Tashkent, Sept. 2005.

147. The additivity problem and constrained quantum channels, Proc. Int. Soc. Opt.Eng., v. 5833, 196-201, 2005.

148. (with N. Datta and Yu. M. Suhov) Additivity for transpose depolarizing channels,Int. J. Quant. Inform., vol. 4, N1, 2006; Arxiv quant-ph/0412034.

149. (with M. E. Shirokov and R. F. Werner) On the notion of entanglement in infinitedimensional spaces, Russian Math. Surveys, vol. 60, N2, 2005, 153-154.

150. Classical capacity of quantum channels. in Encyclopaedia “Mathematical Physics”,Elsevier, Oxford, 2006, 142-144.

151. Photon localization: observables and uncertainty relation, Microelectronics, vol. 35,N1, 2006, 27-36.

152. On complementary channels and the additivity problem, Arxiv quant-ph/0509101,2005; Probab. theory and appl. vol. 51, N1, 2006, 133-143.

153. (with N. Datta) Complementarity and additivity for depolarizing channels, Arxivquant-ph/0510145, 2005.

154. (with M. Fukuda) On Weyl-covariant channels, Arxiv quant-ph/0510148, 2005.

155. (with N. Datta and M. Fukuda) Complementarity and additivity for covariant chan-nels, Quantum Information Processing, vol. 5, N3, 2006, 179-207.

156. Multiplicativity of p-norms of completely positive maps and the additivity problemin quantum information theory, Russian Math. Surveys, vol. 61, N2, 2006, 113-152.

157. The additivity problem in quantum information theory, Proc. of InternationalCongress of Mathematicians, Madrid, Spain, 2006. vol. 3, pp. 999-1018, Publ.EMS 2006.

158. One-mode quantum Gaussian channels, Problems of Information Transmission, v.43,1-11, 2007; Arxiv quant-ph/0607051.

159. (with F. Caruso, V. Giovannetti) One-mode Bosonic Gaussian channels: a full weak-degradability classification, New Journal of Physics 8, 310 (2006); Arxiv quant-ph/0609013.

160. (with V. Giovannetti) Quantum shared broadcasting, Quant. Inform. Proc. 7,55-69 2008. Arxiv:0710.2487.

10

161. (with M. E. Shirokov) On approximation of infinite-dimensional quantum channels,Problems of Information Transmission, v. 44, n. 2, 3-22, 2008. Arxiv:0711.2245.

162. (with F. Caruso, J. Eisert, V. Giovannetti) Multi-mode bosonic Gaussian channels,New Journal of Physics 10, 083030 (33 pp) 2008. Arxiv:0804.0511

163. Quantum informatics, World of Science (Russian edition of ”Scientific American”)N 7, 68-75, 2008.

164. Entanglement-breaking channels in infinite dimensions, Problems of InformationTransmission, v. 44, n. 3, 3-18, 2008. Arxiv:0802.0235

165. (with J.-P. Pelonpaa) Extreme covariant observables for type I symmetry groups,Foundations of Physics, 39, Issue 6, 625-641, 2009.

166. (with M. M. Wolf, T. Heinosaari), The semigroup structure of Gaussian channels,Quantum Information and Communication, 2010, v.10, N7-8, 0619-0635

167. Two mathematical problems of quantum information theory, Lecture Note Series,IMS, NUS, 2010, v. 20, 109-131

168. (with M. E. Shirokov), Mutual and coherent information for infinite-dimensionalquantum channels, Problems Inform. Transmission, 46:3 (2010), 201218.

169. Quantum systems, channels, information, Moscow Independent University, Moscow2010 (327 pp., in Russian)

170. (with V. Giovannetti, S. Lloyd, L. Maccone) Generalized minimal output entropyconjecture for one-mode Gaussian channels: definitions and some exact results, J.Phys. A: Math. Theor. 43 (2010) 415305, 10 pp.

171. The entropy gain of infinite-dimensional quantum evolutions, Dokl. Math., 82:2(2010), 730-731.

172. Statistical inference for quantum systems, International Encyclopedia of StatisticalScience, ed. M. Lovric, Springer, 2011, 1420-1423.

173. Entropy gain and the Choi-Jamiolkowski correspondence for infinite-dimensionalquantum evolutions, Theoretical and Mathematical Physics, 166:1 (2011), 123-138.

174. Probabilistic and Statistical Aspects of Quantum Theory, 2nd edition, Edizioni SNS,Pisa 2011.

11

1

Angel Lozano Office

Dept. of Information & Communication Technologies UPF (Universitat Pompeu Fabra) C/ Roc Boronat 138 08018 Barcelona, Spain

Phone: +34 93 542-2581 E-mail: angel.lozano@upf.edu Web: www.dtic.upf.edu/~alozano

Home

Rambla Volart 74, 3-4 08041 Barcelona, Spain

VITA

Angel Lozano is a Professor of Information and Communication Technologies at UPF (Universitat Pompeu Fabra) in Barcelona, Spain, where he teaches and conducts research on wireless communications as head of the WiCom (Wireless Communications) Group. Born in Manresa, Spain, Prof. Lozano received the Telecommunications Engineering degree from UPC, Spain, in 1992 and the Master of Science and Ph.D. degrees in Electrical Engineering from Stanford University, USA, in 1994 and 1998, respectively. Contemporarily, between 1996 and 1998, he also worked for Rockwell Semiconductor Systems (now Conexant Systems) in San Diego, USA. In 1999, he joined Bell Labs (Lucent Technologies, now Alcatel-Lucent) in Holmdel, USA, where he was a member of the Wireless Communications Research Department until 2008. Between 2005 and 2008 he was also an Adjunct Associate Professor of Electrical Engineering at Columbia University, NY, USA. Prof. Lozano is a senior member of the IEEE since 1999. He served as associate editor for the IEEE Transactions on Communications between 1999 and 2009, has guest-edited various journal special issues, and is actively involved in committees and conference organization tasks for the IEEE. In particular, he is the vice-chair of the IEEE Communication Theory Technical Committee. Since 2010, he is also an associate editor for the Journal of Communications & Networks. He has further participated in standardization activities for 3GPP, 3GPP2, IEEE 802.20 and the IETF. Prof. Lozano has authored over 90 technical journal and conference papers, as well as one monograph, holds 15 patents, and has contributed to several books. His papers have received two awards: the best paper at the 2006 IEEE Int’l Symposium on Spread Spectrum Techniques & Applications, and the Stephen O. Rice prize to the best paper published in the IEEE Transactions on Communications in 2008. He also received the Bell Labs President’s Gold Award in 2002 and the ICREA Academia Award from the Catalan Government in 2011. He has held visiting appointments at the University of Cambridge (UK), at the University of Texas at Austin (USA), at the Hebrew University of Jerusalem (Israel), at the University of Minnesota (USA), at Stanford University (USA), and at Universidad Técnica Federico Santa María (Chile).

2

EDUCATION

1995-1998 Ph.D. in Electrical Engineering. Stanford University, Stanford, USA. Dissertation: “Integrated Dynamic Channel Assignment and Power Control for Mobile Wireless Communication Systems” (Advisor: Prof. Donald C. Cox).

1993-1994 Master of Science in Electrical Engineering. Stanford University, Stanford, USA.

1986-1992 Telecommunications Engineer. UPC, Barcelona, Spain.

ACADEMIC POSITIONS

2008-Present Full Professor. Dept. of Information & Communication Technologies, UPF (Universitat Pompeu Fabra), Barcelona, Spain.

⎯ Teaching on various communications and information-theory topics at both the undergraduate and graduate levels.

⎯ Coordinator of the Master ASMT (Advanced Sciences in Modern Telecommunications), offered jointly by UPF and by Universitat de València.

⎯ Department Vice-Chair.

⎯ Chair of Graduate Studies Committee.

⎯ Head of the WiCom (Wireless Communications) Research Group.

⎯ Research collaborations with The University of Texas at Austin (USA), University of Minnesota (USA), Lund University (Sweden), The Hebrew University of Jerusalem (Israel), Telefónica I+D, and CTTC (Centre Tecnològic de Telecomunicacions de Catalunya).

⎯ Participation in the Consolider-Ingenio 2010 Project COMONSENS (Foundations & Methodologies for Future Communication & Sensor Networks), 2009-2013, as well as other National and European Projects.

2005-2008 Adj. Associate Professor of Electrical Engineering. Columbia University, New York City, NY, USA. Teaching:

⎯ E4703 Wireless Communications. Undergraduate/graduate level, broadcast and webcast by the Columbia Video Network.

⎯ E4702 Communication Theory. Undergraduate/graduate level, broadcast and webcast by the Columbia Video Network.

⎯ E6880 Space-Time Coding & Signal Processing. Graduate level.

VISITING ACADEMIC APPOINTMENTS

April 2011 Dept. of Engineering, The University of Cambridge, Cambridge, UK. Host: Prof. Albert Guillèn.

3

Nov. 2010 Wireless Networking & Communications Group (WNCG), The University of Texas at Austin, Austin, USA. Host: Prof. Robert W. Heath, Jr.

Summer 2010 Engineering & Computer Science School, The Hebrew University of Jerusalem, Jerusalem, Israel. Host: Prof. Dana Porrat.

Summer 2009 Dept. of Electrical & Computer Engineering, University of Minnesota, Minneapolis, USA. Host: Prof. Nihar Jindal.

May 2009 Dept. of Electrical Engineering, Stanford University, USA. Host: Prof. Andrea Goldsmith.

Summer 2008 Departamento de Ingeniería Eléctrica, Universidad Técnica Federico Santa Maria, Valparaíso, Chile. Host: Prof. Rodolfo Feick.

INDUSTRIAL EXPERIENCE

1999-2009 Wireless Communications Research Department, Bell Labs (Lucent Technologies), Holmdel, NJ, USA.

⎯ Member of the team that pioneered and demonstrated MIMO (multiple-input multiple-output) communication, now integral part of several wireless standards. Specifically, co-invented the PARC (Per-Antenna Rate Control) MIMO scheme, adopted by the 3GPP (3rd Generation Partnership Project) for UMTS Release 7. Variants of PARC have been adopted by other wireless systems, such as IEEE 802.16 and IEEE 802.20, and for 3GPP’s Long-Term Evolution.

⎯ Research collaborations with Princeton University (USA), Università degli Studi di Napoli “Federico II” (Italy), and Stanford University (USA).

⎯ First demonstration of out-of-cell MIMO interference cancellation at the 2003 IST European Summit in Aveiro, Portugal.

⎯ Technical leadership of EU Project FITNESS (Fourth-generation Intelligent Transparent Networks Enhanced through Space-time Systems), IST 5th Framework Programme.

⎯ Lucent Technologies delegate to 3GPP (3rd Generation Partnership Project) Radio Access Network Working Group for UTRAN Long-Term Evolution, 2006-2007.

⎯ Lucent Technologies delegate to IEEE 802.20 Working Group for Mobile Broadband Wireless Access, 2005.

1996-1998 Rockwell Semiconductor Systems, San Diego, CA, USA. ⎯ In parallel with doctoral work, developed dynamic channel assignment

algorithms for Japanese PHS (Personal Handyphone System) in cooperation with wireless operator DDI. Some of these algorithms were adopted and deployed in DDI’s network.

DISTINCTIONS

• ICREA-Academia 2011-2015.

⎯ ICREA (Catalan Institution for Research & Advanced Studies) is a publicly funded foundation designed to attract and retain talent in Catalonia. The

4

ICREA-Academia prize distinguishes the top academic researchers over 5-year periods.

• 2009 Stephen O. Rice prize to the best original paper published in the IEEE Transactions on Communications in 2008.

• Marie Curie International Reintegration Grant, European Commission, 2007.

• Best paper award, IEEE Int’l Symposium on Spread Spectrum Techniques & Applications (ISSSTA’06), Manaus, Brazil, Aug. 2006.

• Central Bell Labs teamwork award, May 2004.

• Bell Labs President’s Gold Award on research excellence, 2002.

• Fellowship “la Caixa” to pursue graduate studies in the USA, 1993.

MONOGRAPHS

M1 A. Lozano, Dynamic Channel Assignment & Power Control for Wireless Communication, ISBN 978-3-8383-2060-1, Lambert Academic Publishing, 2009.

BOOK CHAPTERS

B4 M. R. Palattella, A. Faridi, G. Boggia, P. Camarda, L. A. Grieco, M. Dohler and A. Lozano, “Performance Analysis of the IEEE 802.15.4 MAC Layer,” ZigBee Networks, Protocols and Applications, CRC Press, 2010.

B3 [Invited chapter] A. Lozano, A. M. Tulino and S. Verdú, “Multiantenna Capacity: Myths and Realities,” Space-Time Wireless Systems: From Array Processing to MIMO Communications, Cambridge University Press, 2006, ISBN: 0521071208.

B2 [Invited chapter] A. M. Tulino, A. Lozano and S. Verdú, “The Power-Bandwidth Tradeoff of Multi-antenna Systems in the Low-power Regime,” Multiantenna Channels: Capacity, Coding and Signal Processing, American Mathematical Society, 2003, ISBN: 082183407X.

B1 [Invited chapter] A. Lozano, “Multiantenna Technology for High-speed Wireless Internet Access,” Wireless Internet Handbook: Technologies, Standards, and Applications, CRC Press, 2003, ISBN: 0849315026.

JOURNAL PAPERS

J33 F. Rusek, A. Lozano and N. Jindal, “Mutual Information of IID Complex Gaussian Signals on Block Rayleigh-faded Channels,” IEEE Trans. on Information Theory, to appear.

J32 A. Lozano and D. Porrat, “Non-Peaky Signals in Wideband Fading Channels: Achievable Bit Rates and Optimal Bandwidth”, IEEE Trans. on Wireless Communications, to appear.

5

J31 A. Lozano and N. Jindal, “Are Yesterday’s Fading Models and Performance Metrics Adequate for Today’s Wireless Systems?,” IEEE Wireless Communications Magazine, in review.

J30 M. Dohler, R. W. Heath Jr., A. Lozano, C. Papadias and A. Lozano, “Is the PHY Layer Dead?,” IEEE Communications Magazine, Vol. 49, No. 4, Apr. 2011, pp. 159-165.

J29 A. Faridi, M. R. Palattella, A. Lozano, M. Dohler, G. Boggia, A. Grieco and P. Camarda, “Comprehensive Evaluation of the IEEE 802.15.4 MAC Layer Performance with Retransmissions,” IEEE Trans. on Vehicular Technology, Vol. 59, No. 8, Oct. 2010, pp. 3917-3932.

J28 N. Jindal and A. Lozano, “A Unified Treatment of Optimum Pilot Overhead in Multipath Fading Channels,” IEEE Trans. on Communications, Vol. 58, No. 10, Oct. 2010, pp. 2939-2948.

J27 A. Lozano, “Per-Antenna Rate and Power Control for MIMO Layered Architectures in the Low- and High-Power Regimes,” IEEE Trans. on Communications, Vol. 58, No. 2, Feb. 2010, pp. 652-659.

J26 A. Lozano and N. Jindal, “Transmit Diversity v. Spatial Multiplexing in Modern MIMO Systems,” IEEE Trans. on Wireless Communications, Vol. 8, No. 1, Jan. 2010, pp. 186-197.

J25 S. Venkatesan, H. C. Huang, A. Lozano and R. Valenzuela, “A WiMAX-based Implementation of Network MIMO for Indoor Wireless Systems,” EURASIP Journal on Advances in Signal Processing (Special Issue on Multiuser MIMO Transmission with Limited Feedback, Cooperation, and Coordination), Vol. 2009, Oct. 2009.

J24 B. Clerckx, A. Lozano, S. Sesia, C. van Rensburg and C. B. Papadias, “3GPP LTE and LTE-Advanced,” EURASIP Journal on Wireless Communications and Networking, Vol. 2009, Feb. 2009, pp. 1-3.

J23 A. Lozano, “Interplay of Spectral Efficiency, Power and Doppler Spectrum for Reference-Signal-Assisted Wireless Communication,” IEEE Trans. on Wireless Communications, Vol. 7, No. 12, Dec. 2008, pp. 5020-5029.

J22 [Stephen O. Rice Prize] A. Lozano, A. M. Tulino and S. Verdú, “Optimum Power Allocation for Multiuser OFDM with Arbitrary Signal Constellations,” IEEE Trans. on Communications, Vol. 56, No. 5, May 2008, pp. 828-837.

J21 A. Lozano, A. Goldsmith, R. A. Valenzuela, M. A. Lagunas and D. Gesbert, “Advances in Smart Antennas,” IEEE Communications Magazine (Guest Editorial), Vol. 13, No. 4, Aug. 2006, pp. 6-7.

J20 A. Lozano, A. M. Tulino and S. Verdú, “Optimum Power Allocation for Parallel Gaussian Channels with Arbitrary Input Distributions,” IEEE Trans. on Information Theory, Vol. 52, No. 7, July 2006, pp. 3033-3051.

J19 A. M. Tulino, A. Lozano and S. Verdú, “Capacity-achieving Input Covariance for Single-user Multi-antenna Channels,” IEEE Trans. on Wireless Communications, Vol. 5, No. 2, March 2006, pp. 662-671.

6

J18 A. Lozano, A. M. Tulino and S. Verdú, “High-SNR Power Offset in Multiantenna Communication,” IEEE Trans. on Information Theory, Vol. 51, No. 12, Dec. 2005, pp. 4134-4151.

J17 A. M. Tulino, A. Lozano and S. Verdú, “Impact of Correlation on the Capacity of Multiantenna Channels,” IEEE Trans. on Information Theory, Vol. 51, No. 7, July 2005, pp 2491-2509.

J16 D. Samardzija, A. Lozano and C. Papadias, “Design & Experimental Validation of MIMO Multiuser Detection for Downlink Packet Data,” EURASIP Journal on Applied Signal Processing, Vol. 2005, No. 11, July 2005, pp. 1769-1777.

J15 [Invited paper] A. Alexiou, D. Avidor, P. Bosch, S. Das, P. Gupta, B. Hochwald, T. Klein, J. Ling, A. Lozano, T. Marzetta, S. Mukherjee, S. Mullender, C. Papadias, R. Valenzuela and H. Viswanathan, “Duplexing, Resource Allocation & Intercelll Coordination – Design Considerations for Next Generation Systems,” Wireless Communications & Mobile Computing, No. 5, pp. 77-93, 2005.

J14 S. T. Chung, A. Lozano, H. C. Huang, A. Sutivong and J. M. Cioffi, “Approaching the MIMO Capacity with V-BLAST: Theory and Practice,” EURASIP Journal on Applied Signal Processing (special issue on MIMO), Vol. 2004, No. 5, May 2004, pp. 762-771.

J13 H. Zheng, A. Lozano and M. Haleem, “Multiple ARQ Processes for MIMO Systems,” EURASIP Journal on Applied Signal Processing (special issue on MIMO), Vol. 2004, No. 5, May 2004, pp. 762-771.

J12 A. Lozano, A. M. Tulino and S. Verdú, “Multiple-antenna Capacity in the Low-power Regime,” IEEE Trans. on Information Theory (special issue on space-time transmission, reception, coding & signal design), Vol. 49, No. 10, Oct. 2003, pp. 2527-2544.

J11 A. Lozano, “Capacity-approaching Rate Function for Layered Multi-antenna Architectures,” IEEE Trans. on Wireless communications, Vol. 2, No. 4, Jul. 2003, pp. 616-620.

J10 Q. Sun, D. C. Cox, H. C. Huang and A. Lozano, “Estimation of Continuous Flat-fading MIMO Channels,” IEEE Trans. on Wireless Communications, Vol. 1, No. 4, Oct. 2002, pp. 549-553.

J9 A. Lozano and A. M. Tulino, “Capacity of Multiple-transmit Multiple-receive Antenna Architectures,” IEEE Trans. on Information Theory, Vol. 48, No. 12, Dec. 2002, pp. 3117-3128.

J8 A. Lozano and D. C. Cox, “Distributed Dynamic Channel Assignment in TDMA Mobile Wireless Communication Systems,” IEEE Trans. on Vehicular Technology, Vol. 51, No. 6, Nov. 2002, pp. 1397-1406.

J7 F. R. Farrokhi, A. Lozano, G. J. Foschini and R. A. Valenzuela, “Spectral Efficiency of FDMA/TDMA Wireless Systems with Transmit and Receive Antenna Arrays,” IEEE Trans. on Wireless Communications, Vol. 1, No. 4, Oct. 2002, pp. 591-599.

7

J6 A. Lozano and C. B. Papadias, “Layered Space-time Receivers for Frequency-selective Wireless Channels,” IEEE Trans. on Communications, Vol. 50, No. 1, Jan. 2002, pp. 65-73.

J5 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Lifting the Limits on High-speed Wireless Data Access Using Antenna Arrays,” IEEE Communications Magazine, Vol. 39, No. 9, Sept. 2001, pp. 156-162.

J4 F. R. Farrokhi, G. J. Foschini, A. Lozano and R. A. Valenzuela, “Link-optimal Space-time Processing with Multiple Transmit and Receive Antennas,” IEEE Communication Letters, Vol. 5, No. 3, Mar. 2001, pp. 85-87.

J3 D. Chizhik, F. R. Farrokhi, J. Ling and A. Lozano, “Effect of Antenna Separation on the Capacity of BLAST in Correlated Channels,” IEEE Communication Letters, Vol. 4, No. 11, Nov. 2000, pp. 334-336.

J2 A. Lozano and D. C. Cox, “Integrated Dynamic Channel Assignment and Power Control in TDMA Mobile Wireless Communication Systems,” IEEE Journal on Sel. Areas in Communications, Vol. 17, No. 11, Nov. 1999, pp. 2031-2040.

J1 J. M. Rius, A. Lozano and L. Jofre, “Spectral Algorithm for RCS Computation in Electrically Large or Intermediate Perfectly Conducting Waveguide Cavities,” IEEE Trans. on Antennas & Propagation, Vol. 42, No. 6, June 1994, pp 790-797.

REFEREED CONFERENCE PAPERS

C55 [Invited paper] N. Jindal and A. Lozano, “Fading Models and Metrics for Contemporary Wireless Systems,” Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, Nov. 2010.

C54 F. Rusek, A. Lozano and N. Jindal, “Mutual Information of IID Complex Gaussian Signals on Block Rayleigh-faded Channels,” IEEE Int’l Symp. on Inform. Theory (ISIT´10), Austin, USA, June 2010.

C53 [Invited paper] A. Lozano and N. Jindal, “Optimum Pilot Overhead in Wireless Communication: A Unified Treatment of Continuous and Block-Fading Channels,” European Wireless 2010, Lucca, Italy, Apr. 2010.

C52 [Invited paper] A. Lozano and N. Jindal, “Are Yesterday's Fading Models and Performance Metrics Adequate for Today's Wireless Systems?,” Int’l Zürich Seminar on Communications, Zürich, Switzerland, Mar. 3-5 2010.

C51 N. Jindal and A. Lozano, “De-hyping Transmit Diversity in Modern MIMO Cellular Systems,” IEEE Global Telecommunications Conf. (GLOBECOM’09), Honolulu, USA, Dec. 2009.

C50 N. Jindal, A. Lozano and T. L. Marzetta, “What is the Value of Joint Processing of Pilots and Data in Block-Fading Channels?,” IEEE Int’l Symp. on Inform. Theory (ISIT´09), Seoul, Republic of Korea, June 2009.

8

C49 A. García Armada, L. Hong and A. Lozano, “Bit Loading for MIMO with Statistical Channel Information at the Transmitter and ZF Receivers,” IEEE Int’l Conf. on Communications (ICC´09), Dresden, Germany, June 2009.

C48 S. Sridharan, A. Lozano, H. Viswanathan and S. Vishwanath, “Capacity to within One Bit of a Class of Gaussian Multicast Channels with Interference,” IEEE Information Theory Workshop (ITW´08), Porto, Portugal, May 2008.

C47 A. Lozano, “Spectral efficiency in reference-signal-assisted low-power wireless communication,” IEEE Int’l Conf. on Communications (ICC’08), Beijing, China, May 2008.

C46 [Invited paper] S. Venkatesan, A. Lozano and R. A. Valenzuela, “Network MIMO: Overcoming Intercell Interference in Indoor Wireless Systems,” Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, Nov. 2007.

C45 J. S. Kwak, J. Andrews and A. Lozano, “MIMO Capacity in Correlated Interference-Limited Channels,” IEEE Int’l Symp. on Information Theory (ISIT’07), Nice, France, Jun. 2007.

C44 A. Lozano, “Long-term Transmit Beamforming for Wireless Multicasting,” IEEE Int’l Conf. on Acoustics, Speech & Signal Processing (ICASSP’07), Honolulu, USA, April 2007.

C43 A. Lozano, A. M. Tulino and S. Verdú, “Optimum Ergodic Power Allocation for Multiuser OFDM with Arbitrary Signal Constellations,” IEEE Global Telecommunications Conf. (GLOBECOM’06), San Francisco, USA, Nov. 2006.

C42 [Best paper award] A. Lozano, A. M. Tulino and S. Verdú, “Multiuser Mercury/waterfilling for Downlink OFDM with Arbitrary Input Constellations,” IEEE Int’l Symp. on Spread Spectrum Techniques & Applications (ISSSTA’06), Manaus, Brazil, Aug. 2006.

C41 G. Alfano, A. M. Tulino, A. Lozano and S. Verdú, “Eigenvalue Statistics of Finite-dimensional Random Matrices for MIMO Wireless Communication,” IEEE Int’l Conf. on Communications (ICC’06), Istanbul, Turkey, June 2006.

C40 [Invited paper] G. Alfano, A. M. Tulino, A. Lozano and S. Verdú, “Random Matrix Transforms and Applications via Non-asymptotic Eigenanalysis,” Int’l Zurich Seminar on Communications, ETH Zurich, Switzeland, Feb. 2006.

C39 [Invited paper] A. Lozano, A. M. Tulino and S. Verdú, “Mercury/waterfilling for Fixed Wireless OFDM Systems,” IEEE Radio & Wireless Symposium (RWS’06), San Diego, USA, Jan. 2006.

C38 M. Sanchez and A. Lozano, “Doppler Sensitivity of Link Reciprocity in TDD MIMO Systems,” IEEE Global Telecomm. Conf. (GLOBECOM’05), St. Louis, USA, Nov. 2005.

C37 A. Lozano, A. M. Tulino and S. Verdú, “Mercury/waterfilling: Optimum Power Allocation with Arbitrary Input Constellations,” IEEE Int’l Symp. on Information Theory (ISIT’05), Adelaide, Australia, Sep. 2005.

9

C36 M. Sanchez, M. L. Pablo and A. Lozano, “Exploiting Multiuser Diversity through Pplink Scheduling,” IEEE Vehicular Technology Conf. (VTC’05), Stockholm, Sweden, May 2005.

C35 A. M. Tulino, A. Lozano and S. Verdú, “High-SNR Power Offset in Multi-antenna Ricean Channels,” IEEE Int´l Conf. on Communications (ICC’05), Seoul, Republic of Korea, May 2005.

C34 D. Samardzija, A. Lozano and C. B. Papadias, “Experimental Validation of MIMO Multiuser Detection for UMTS High-speed Downlink Packet Access,” IEEE Global Telecomm. Conf. (GLOBECOM’04), Dallas, USA, Dec. 2004.

C33 G. Alfano, A. M. Tulino, A. Lozano and S. Verdú, “Mutual Information and Eigenvalue Distribution of MIMO Ricean Channels,” Int. Symp. on Information Theory & Applications (ISITA’04), Parma, Italy, Oct. 2004.

C32 A. M. Tulino, A. Lozano and S. Verdú, “Power Allocation in Multi-antenna Communication with Statistical Channel Information at the Transmitter,” Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’04), Barcelona, Spain, Sep. 2004.

C31 G. Alfano, A. M. Tulino, A. Lozano and S. Verdú, “Capacity of MIMO Channels with One-sided Correlation,” IEEE Int’l Symp. on Spread Spectrum Techniques & Applications (ISSSTA’04), Sydney, Australia, Aug. 2004.

C30 A. M. Tulino, A. Lozano and S. Verdú, “MIMO Capacity with Channel State Information at the Transmitter,” IEEE Int’l Symp. on Spread Spectrum Techniques & Applications (ISSSTA’04), Sydney, Australia, Aug. 2004.

C29 A. Lozano, A. Tulino and S. Verdú, “High-SNR Power Offset in Multi-antenna Communication,” IEEE Int’l Symp. on Information Theory (ISIT’04), Chicago, USA, July 2004.

C28 [Invited paper] A. M. Tulino, A. Lozano and S. Verdú, “Capacity-achieving Input Covariance for Correlated Multi-antenna Channels,” Allerton Conf. in Communication, Control & Computing, Monticello, USA, 1-3 Oct. 2003.

C27 A. Lozano, A. M. Tulino and S. Verdú, “Multi-antenna Capacity in Interference-limited Low-power Conditions,” IEEE Int’l Symp. on Information Theory (ISIT’03), Yokohama, Japan, June 2003.

C26 A. Lozano, A. M. Tulino and S. Verdú, “Correlation Number: A New Design Criterion in Multi-antenna Communication,” IEEE Vehicular Technology Conf. (VTC’03 Spring), Jeju, Korea, April 2003.

C25 A. M. Tulino, S. Verdu and A. Lozano, “Capacity of Antenna Arrays with Space, Polarization and Pattern diversity,” IEEE Information Theory Workshop (ITW’03), Paris, France, Mar. 2003.

C24 A. Lozano, “Enhancing UMTS High-speed Downlink Packet Access with Dual-antenna Terminals,” IEEE Global Telecomm. Conf. (GLOBECOM’02), Taipei, Taiwan, Nov. 17-21, 2002.

10

C23 A. Lozano, A. M. Tulino and S. Verdú, “Capacity of Multi-antenna Channels in the Low-power Regime,” IEEE Information Theory Workshop (ITW’02), Bangalore, India, Oct. 20-25, 2002.

C22 [Invited paper] A. Lozano, A. M. Tulino and S. Verdú, “Multi-antenna Capacity in the Low-power Regime,” Center for Discrete Mathematics & Theoretical Computer Science (DIMACS) Workshop on Signal Processing for Wireless Transmission, Piscataway, USA, Oct. 7-11, 2002.

C21 H. Zheng, A. Lozano and M. Haleem, “Multiple ARQ Processes for MIMO Systems,” Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’02), Lisbon, Portugal, Sept. 15-18, 2002.

C20 Q. Sun, D. C. Cox, H. C. Huang and A. Lozano, “Estimation of Continuous Flat-fading MIMO Channels,” IEEE Wireless Communication & Networking Conf. (WCNC’02), Orlando, USA, March 2002.

C19 Q. Sun, D. C. Cox, A. Lozano and H. C. Huang, “Training-based Channel Estimation for Continuous Flat-fading BLAST,” IEEE International Conf. on Communications (ICC’02), New York City, USA, April 2002.

C18 S. T. Chung, A. Lozano and H. C. Huang, “Approaching Eigenmode BLAST Channel Capacity using V-BLAST with Rate and Power Adaptation,” IEEE Vehicular Technology Conf. (VTC’01 Fall), Atlantic City, USA, Oct. 2001.

C17 S. T. Chung, A. Lozano and H. C. Huang, “Low Complexity Algorithm for Rate and Power Quantization in Extended V-BLAST,” IEEE Vehicular Technology Conf. (VTC’01 Fall), Atlantic City, USA, Oct. 2001.

C16 [Invited paper] A. Lozano, C. B. Papadias and R. A. Valenzuela, “FITNESS: Intelligent Antennas Beyond 3G,” 3rd Generation Infrastructure & Services Symposium, Athens, Greece, July 3rd 2001.

C15 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Asymptotically Optimal Open-loop Space-time Architecture Adaptive to Scattering Conditions,” IEEE Vehicular Technology Conf. (VTC’01 Spring), Rhodes, Greece, May 2001.

C14 X. Li, H. Huang, A. Lozano and G. J. Foschini, “Reduced-complexity Detection Algorithms for Systems using Multi-element arrays,” IEEE Global Telecomm. Conf. (GLOBECOM’00), San Francisco, USA, Nov. 2000.

C13 D. Chizhik, F. R. Farrokhi, J. Ling and A. Lozano, “Antenna Separation and Capacity of BLAST in Correlated Channels,” IEEE APS Conf. on Antennas & Propagation for Wireless Communications, Walthan, USA, Nov. 2000.

C12 F. R. Farrokhi, G. J. Foschini, A. Lozano and R. A. Valenzuela, “Link-optimal BLAST Processing with Multiple-access Interference,” IEEE Vehicular Technology Conf. (VTC’00 Fall), Boston, USA, Sept. 2000.

C11 H. C. Huang, C. B. Papadias and A. Lozano, “Spectral Efficiency of CDMA Systems with Transmit and Receive Antenna Arrays,” IEEE Wireless Communications & Networking Conf. (WCNC’00), Chicago, USA, Sept. 23-28, 2000.

11

C10 F. R. Farrokhi, A. Lozano, G. J. Foschini and R. A. Valenzuela, “Spectral Efficiency of Wireless Systems with Multiple Transmit and Receive Antennas,” Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’00), London, UK, Sept. 18-22, 2000.

C9 A. Lozano and C. B. Papadias, “Space-time Receiver for Wideband BLAST in Rich-scattering Wireless Channels,” IEEE Vehicular Technology Conf. (VTC’2000 Spring), Tokyo, Japan, May 2000.

C8 A. Lozano and G. J. Foschini, “BLAST: Una Nueva Técnica de Radio-comunicación de Extraordinaria Eficiencia Espectral,” Telecom I+D, Barcelona-Madrid, Spain, Nov. 1999.

C7 A. Lozano, D. C. Cox and T. R. Bourk, “Uplink-downlink Imbalance in TDMA Personal Communication Systems,” Int’l Conf. on Universal Personal Communications (ICUPC’98), Florence, Italy, Oct. 1998.

C6 T. Larsson, A. Lozano and G. Peponides, “Soft-output MLSE for IS-136 TDMA”, Int’l Conf. on Universal Personal Communications (ICUPC’97), San Diego, USA, Oct. 1997.

C5 A. Lozano and G. Peponides, “Adaptive MLSE Receiver for Dual-band IS-136 TDMA,” Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’97), Helsinki, Finland, Sept. 1-4, 1997.

C4 J. M. Rius, A. Lozano and A. Cardama, “RCS of Engine Inlet by a Spectral Iterative Technique,” 23rd European Microwave Conf., Madrid (Spain), Sept. 1993.

C3 J. M. Rius, A. Lozano, L. Jofre and A. Cardama, “Spectral Propagation Algorithm for RCS of Perfectly Conducting Cavities,” IEEE-AP Int’l Symp. & URSI Radio Science Meeting, Chicago, USA, July 1992.

C2 A. Lozano, J. M. Rius and A. Cardama, “Algoritmo Iterativo de Propagación Espectral para el Cálculo de RCS en Cavidades Conductoras,” Nat’l Symp. of URSI, Malaga (Spain), Sept. 1992.

C1 A. Lozano, J. M. Rius and A. Cardama, “Cálculo de RCS de Bordes Arbitrarios y Cavidades en Aviones Complejos,” Nat’l Symp. of URSI, Cáceres (Spain), Sept. 1991.

BIBLIOMETRIC PARAMETERS [Source: Google Scholar, Including Patents]

• Total number of citations: 2642. • Number of items with over 100 citations: 10. • Hirsch’s h-index: 27.

INVITED LECTURES, SEMINARS & SHORT COURSES

L30 “MIMO: The Final Frontier in Wireless Communications(?),” USA - Spain Scientific Workshop on Information Sciences & Related Technologies, “Prince of

12

Asturias” Endowed Chair, Santa Fe, USA, Dec. 3rd 2010. Host: Prof. Fernando Pérez-González.

L29 “MIMO: The Final Frontier in Wireless Communications(?),” Joint Communications & Signal Processing Chapter, IEEE Central Texas Section, Austin, USA, Nov. 11th 2010.

L28 “Are Yesterday's Fading Models and Performance Metrics Adequate for Today's Wireless Systems?,” Wireless Networking & Communications Seminar Series, University of Texas at Austin, Austin, USA, Nov. 5th 2010. Host: Prof. Sujay Sanghavi.

L27 “Wireless Communications: Chronicle of a Technological Revolution,” Plenary Talk at EUNICE 2009, Barcelona, Spain, Sept. 7th 2009.

L26 “Contemporary Perspectives on Diversity (A Reflection on Modeling Artifacts),” Yonsei Distinguished Seminar Series: Wireless Communications & Networking, Yonsei University, Seoul, Republic of Korea, June 25th 2009. Host: Prof. Kaibin Huang.

L25 “Advanced Wireless Communications,” Short Course at Universidad Politécnica de Madrid (UPM), Madrid, Spain, June 9th-12th 2009. Host: Prof. Santiago Zazo.

L24 “Diversity v. Multiplexing in Modern MIMO Systems,” Fraunhofer Institut Nachrichtentechnik (Heinrich-Hertz-Institut), Berlin, Germany, June 5th 2009. Host: Prof. Holger Boche.

L23 “Contemporary Perspectives on Diversity (A Reflection on Modeling Artifacts),” Information Systems Colloquium, Stanford University, Stanford, USA, May 19th 2009. Host: Prof. Andrea Goldsmith.

L22 “Network MIMO for indoor wireless applications,” (jointly with H. C. Huang, S. Venkatesan and R. A. Valenzuela), IEEE Communication Theory Workshop (CTW'09), Napa Valley, USA, May 12th 2009. Host: Prof. Robert W. Heath.

L21 “Contemporary Perspectives on Diversity (A Reflection on Modeling Artifacts),” Universidade do Porto, Porto, Portugal, Apr. 8th 2009. Host: Prof. Joao Barros.

L20 “Contemporary Perspectives on Diversity (A Reflection on Modeling Artifacts),” CTTC (Centre Tecnològic de Telecomunicacions de Catalunya), Barcelona, Spain, Feb. 18th 2009. Host: Dr. Mischa Dohler.

L19 “Long-term Transmit Beamforming for Wireless Multicasting,” 25th IEEE Convention of Electrical and Electronics Engineers in Israel, Eilat, Israel, Dec. 4th 2008. Host: Prof. Uri Erez.

L18 “A Decade of MIMO: From Fundamentals to Product,” Universidad Técnica Federico Santa María, Valparaiso, Chile, Aug. 26th 2008. Host: Prof. Rodolfo Feick.

L17 “A Decade of MIMO: From Fundamentals to Product,” Plenary Talk at the REGACOM Mini-workshop, Monasterio de Poio (Pontevedra), Spain, July 24th 2008. Host: Prof. Luis Castedo.

13

L16 “Wireless Communications: Brief Chronicle of a Technological Revolution,” Institut Lacetania, Manresa, Spain, April 1st 2008. Host: Prof. Francisco Delis.

L15 “A Chronicle of the MIMO Layered Architecture,” Universidad de Málaga, July 14th 2007. Host: Prof. Juan Romero.

L14 “The MIMO Layered Architecture,” University of New Mexico, Albuquerque, USA, Feb. 26th 2007. Host: Prof. Sudharman Jayaweera.

L13 “The MIMO Layered Architecture: From Fundamentals to Product,” University of Arizona, Tucson, USA, Feb. 23rd 2007. Host: Prof. Shuguang Cui.

L12 “Research, Innovation and the Role of the University,” Fundació Universitària del Bages (Universitat Autònoma de Barcelona), Manresa, Spain, Nov. 14th 2006. Host: Mr. Alex Puig.

L11 “Mercury/waterfilling: Optimum Power Allocation for Parallel Gaussian Channels”, University of Texas, Austin, USA, Oct. 27th 2006. (On-line at http://coe-jaguar.engr.utexas.edu/Mediasite/Viewer/?peid=9ec4f14b-10b8-46ef-a879-9637200ed53d) Host: Prof. Robert Heath Jr.

L10 “Mercury/waterfilling for Optimum Power Allocation in Parallel Gaussian Channels with Arbitrary Signaling Constellations,” Fraunhofer Institut Nachrichtentechnik (Heinrich-Hertz-Institut), Berlin, Germany, June 9th 2006. Host: Dr. Volker Jungnickel.

L9 “The MIMO Layered Architecture: From Fundamentals to Practice,” Boston University, Boston, USA, March 31st 2006. Host: Prof. Mansor Shariff.

L8 “The MIMO Layered Architecture: From Fundamentals to Practice,” University of Connecticut, Storrs, USA, April 7th 2005. Host: Prof. Shengli Zhou.

L7 “BLAST: Theoretical Foundation and Experimental Evidence,” Università di Salerno, Salerno, Italy, May 10th, 2002. Host: Prof. Maurizio Longo.

L6 “BLAST: Theoretical Foundation and Experimental Evidence,” Università degli Studi del Sannio, Benevento, Italy, May 9th, 2002. Host: Prof. Antonia M. Tulino.

L5 “BLAST: Theoretical Foundation and Experimental evidence,” Forschungszentrum Telekommunikation Wien (FTW), Vienna, Austria, Mar. 15th, 2002. Host: Dr. Ralf Müller.

L4 “BLAST: A New Wireless Communication Technique of Extraordinary Spectral Efficiency,” Autorità per le Garanzie nelle Comunicazioni, Naples, Italy, June 2000.

L3 “BLAST: A New Wireless Communication Technique of Extraordinary Spectral Efficiency,” Mobile & Personal Communications Systems Group, European Commission, Brussels, Belgium, June 2000. Host: Dr. Jorge Pereira.

L2 “BLAST: Principles & Overview”, Plenary Talk, Bell Labs BLAST Workshop, Murray Hill, USA, Feb. 2nd 2000. Host: Dr. Paul Mankiewich.

L1 “Integrated DCA and Power Control in Mobile Wireless Systems”, Stanford University, Stanford, USA, Nov. 1998. Host: Prof. Dale Harris.

14

TUTORIALS & PANELS

T5 [Invited tutorial] A. Lozano and C. B. Papadias, “MIMO Systems for Wireless Communication,” online tutorial offered by the IEEE Communications Society (http://www.comsoc.org/ tutorialsnow).

T4 A. Lozano and C. B. Papadias, “MIMO Systems for Wireless Communication,” tutorial delivered at the IEEE Int’l Conf. on Communications (ICC’06), Istanbul, Turkey, June 2006.

T3 [Invited panel] “The Physical Layer is Dead,” panel discussion at the IEEE Vehicular Technology Conference (VTC’09 Spring), Barcelona, Spain, Apr. 29th 2009.

T2 [Invited panel] “MIMO Technologies - Since Then,” panel discussion at the Wireless Personal Multimedia Communications Conf. (WPMC’05), Aalborg, Denmark, Sept. 19th 2005.

T1 [Invited tutorial] C. B. Papadias and A. Lozano, “An Introduction to MIMO Systems for Wireless Communications,” tutorial delivered at the IEEE Int’l Conference on Acoustics, Speech & Signal Processing (ICASSP’05), Philadelphia, PA, USA, March 18th 2005.

PATENTS

P15 G. J. Foschini, H. C. Huang, A. Lozano, R. A. Valenzuela and S. Venkatensan, “Method for Adaptive Formation of Cell Clusters for Cellular Wireless Networks with Coordinated Transmission and Reception,” priority June 17th 2008.

⎯ Patent pending.

P14 A. Lozano and S. Venkatesan, “Reverse Link Channel Estimation Using Common and Dedicated Pilot Channels,” priority Jan. 24th 2008.

⎯ European Patent EP 2238722 (issued Oct. 13th 2010). ⎯ Chinese Patent 101939957 (issued Jan. 5th 2011). ⎯ Japanese Patent 2011-510599 (issued Mar. 31st 2011). ⎯ Korean Patent 2010-0101706 (issued Sept. 17th 2010).

P13 A. Lozano and R. A. Valenzuela, “Superposition Transmission of Access and Backhaul for Wireless Systems Using Relays,” priority Feb. 12th 2008.

⎯ Patent pending.

P12 A. Lozano and R. Bachl, “Method of Grouping Users for Opportunistic Downlink in Multiuser, Multiple-input Multiple-output Wireless communication,” priority May 1st 2007.

⎯ Patent pending.

P11 A. Lozano, “Method of Transmit Beamforming for Multicasting in a Wireless Communication System,” priority Jul. 11th 2007.

⎯ US Patent No. 7747285 (issued June 29th 2010).

15

P10 A. Lozano and R. Bachl, “Dynamic Power Allocation for Unicast-Multicast Superposition in Wireless Broadcasting,” priority Jan. 22nd 2007.

⎯ US Patent No. 7738905 (issued June 15th 2010). ⎯ European Patent EP 2127464 (issued Dec. 2nd 2009). ⎯ Chinese Patent 10-1584228 (issued Nov. 18th 2009). ⎯ Japanese Patent 2010-517428.

P9 A. Lozano, “Method for Allocation of Power in Multiuser Orthogonal Frequency Division Multiplexing,” priority Mar. 30th 2006.

⎯ US Patent 7852953 (issued Dec. 14th 2010)

P8 A. Lozano, S. Verdú and A. M. Tulino, “Method of Allocating Power over Channels of a Communication System,” priority June 1st 2005.

⎯ US Patent No. 7489944 (issued Feb. 10th 2009).

P7 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Space-time Processing for Wireless Systems with Multiple Transmit and Receive Antennas,” priority May 11th 2004.

⎯ US Patent No. 7113558 (issued Sept. 26th 2006). ⎯ Korean Patent 10-0811577 (issued Mar. 3rd 2008). ⎯ Chinese Patent 1233106 (issued Dec. 21st 2005).

P6 A. Lozano, S. Verdú and A. M. Tulino, “Method for Optimizing the Transmit Signal in Multiple Antenna Wireless Links,” priority Sept. 30th 2003.

⎯ US Patent No. 7194286 (issued March 20th 2007). ⎯ European Patent EP 1521383 (issued April 6th 2005), German Patent

602004003873 (published Oct. 11th 2007).

P5 A. Lozano, “Rate Control Technique for Layered Architectures with Multiple Transmit and Receive antennas,” priority Oct. 18th 2001.

⎯ US Patent No. 7116652 (issued Oct. 3rd 2006). ⎯ European Patent EP 1309102 (issued May 7th 2003), German Patent 60203234

(published Feb. 9th 2006).

P4 S.-T. Chung, A. Lozano and H. C. Huang, “Feedback Technique for Wireless Systems with Multiple Transmit and Receive Antennas,” priority Nov. 16th 2000.

⎯ Canadian Patent 2361886 (issued May 16th 2002). ⎯ European Patent EP 1207645 (issued May 22nd 2002). ⎯ Chinese Patent 1354610 (issued June 19th 2002).

P3 A. Lozano, “Method and Apparatus for Communicating Heterogeneous Data Traffic,” priority Dec. 20th 2000.

⎯ US Patent No. 6920118 (issued July 19th 2005).

P2 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Space-time Processing for Wireless Systems with Multiple Transmit and Receive Antennas,” priority Aug. 18th 2000.

⎯ US Patent No. 6778612 (issued Aug. 17th 2004). ⎯ Canadian Patent 2350878 (issued Feb. 18th 2002).

16

⎯ European Patent EP 1187363 (issued Mar. 13th 2002), German Patent 60104252 (published Sept. 8th 2005).

⎯ Korean Patent 2002-0014774 (issued Feb. 25th 2002). ⎯ Japanese Patent 2002-124899 (issued Apr. 26th 2002). ⎯ Chinese Patent 1339881 (issued Mar. 13th 2002). ⎯ Brazilian Patent 0103224. ⎯ Australian Patent 5799301.

P1 G. J. Foschini, A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Space-time Processing for Multiple-input Multiple-output Wireless Systems,” priority Jan. 13th 2000.

⎯ US Patent No. 6888809 (issued May 3rd 2005). ⎯ Canadian Patent 2327611 (issued Jan 24th 2006). ⎯ European Patent EP 1117197 (issued Apr. 9th 2003), German Patent 60104252

(published Sept. 8th 2005), Austrian Patent 271284. ⎯ Korean Patent 10-0716397 (issued May 5th 2007). ⎯ Chinese Patent 1264287 (issued Jul. 12th 2006). ⎯ Japanese Patent 2001-237751 (issued Aug. 31st 2001). ⎯ Brazilian Patent 0100011. ⎯ Australian Patent 1108401.

STANDARDS CONTRIBUTIONS

S4 T. Tsao, R. Alexander, M. Dohler, A. Lozano and V. Daza, “A Security Framework for Routing over Low Power and Lossy Networks,” Networking Working Group, IETF (Internet Engineering Task Force), Sept. 2009.

S3 Alcatel-Lucent, “User Grouping Method for PU2RC Downlink MU-MIMO,” R1-072401 TSG-RAN Working Group 1 #49, 3GPP (3rd Generation Partnership Project), Kobe, Japan, May 2007.

S2 Lucent Technologies and China Mobile, “MIMO for E-MBMS in 5 MHZ LTE,” R1-062390 TSG-RAN Working Group 1 #46, 3GPP (3rd Generation Partnership Project), Tallinn, Estonia, Aug. 2006.

S1 Lucent Technologies, “On a Link-level Channel Model for SFN Systems,” R1-062391 TSG-RAN Working Group 1 #46, 3GPP (3rd Generation Partnership Project), Tallinn, Estonia, Aug. 2006.

PROFESSIONAL SERVICE

• Senior Member of the IEEE, since 1999.

• Vice-Chair, IEEE Communication Theory Technical Committee, since 2011.

• Associate Editor, IEEE Transactions on Communications, 1999-2009.

• Associate Editor, Journal of Communications and Networks, since 2010.

17

• Guest Editor, Eurasip Journal on Wireless Communications & Networking (special issue on 3GPP LTE and LTE Advanced), Feb. 2009.

• Guest Editor, IEEE Wireless Communications Magazine (Special Issue on Advances in Smart Antennas), Aug. 2006.

• General Co-Chair, 11th Winter School of Information Theory, Barcelona, Spain, March 2011.

• Local Co-Chair, Communication Theory Workshop (CTW’11), Sitges, Spain, May 2011.

• Technical Co-Chair, Communication Theory Workshop (CTW’10), Cancun, Mexico, May 2010.

• Local Co-Chair, Int’l Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP'09), Aruba, Dec. 2009.

• Invited Papers Co-Chair, IEEE Vehicular Technology Conf. (VTC´09 Spring), Barcelona, Spain, April 2009.

• Industry Liaison, Communication Theory Workshop (CTW’08), US Virgin Islands, May 2008.

• Industry Chair, Int´l Conf. on Access Networks (AccessNets’07), Ottawa, Canada, Aug. 22nd-24th, 2007.

• Finances, 6th IEEE Int’l Workshop on Signal Processing Advances in Wireless Communications (SPAWC’05), New York City, NY, June 2005.

• Technical Program Committee member:

⎯ IEEE Int’l Conf. in Communications (ICC’12), Ottawa, Canada, June 2012. ⎯ IEEE Information Theory Workshop (ITW’11), Paraty, Brazil, Oct. 2011. ⎯ IEEE Int’l Conf. in Communications (ICC’11), Kyoto, Japan, June 2011. ⎯ IEEE Int’l Conf. on Smart Grid Communications (SmartGridComm’11),

Gaithersburg, USA, Oct. 2010. ⎯ Int’l Conf. on Computer Communications & Networks (ICCCN’10), Zurich,

Switzerland, Aug. 2010. ⎯ Int’l Workshop on Femtocell Networks (FEMnet), Miami, FL, USA, Dec. 2010. ⎯ 1st IEEE Int’l Workshop on Indoor and Outdoor Femto Cells (IOFC), Tokyo,

Japan, Sept. 2009. ⎯ IEEE Global Telecomm. Conf. (GLOBECOM’09), Honolulu, HI, USA, Nov.

2009. ⎯ IEEE Int’l Conf. in Communications (ICC’08), Beijing, China, May 2008. ⎯ IEEE Wireless Communications & Networking Conference (WCNC’07), Hong

Kong, China, March 2007. ⎯ IEEE Radio & Wireless Symp. (RWS’07), Long Beach, CA, USA, Jan. 2007. ⎯ Int’l Workshop on Wireless Ad-hoc & Sensor Networks (IWWAN’06), New York

City, NY, USA, May 2006. ⎯ IEEE Global Telecomm. Conf. (GLOBECOM’06), San Francisco, CA, USA,

Dec. 2006.

18

⎯ IEEE Radio & Wireless Symp. (RWS’06), San Diego, CA, USA, Jan. 2006. ⎯ Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’05),

Berlin, Germany, Sept. 2005. ⎯ 6th IEEE Int’l Workshop on Signal Processing Advances in Wireless Communications

(SPAWC’05), New York City, NY, USA, June 2005. ⎯ Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’04),

Barcelona, Spain, Sept. 2004. ⎯ IEEE Int’l Symp. on Spread Spectrum Techniques & Applications (ISSSTA’04),

Sydney, Australia, Sept. 2004. ⎯ IEEE Global Telecomm. Conf. (GLOBECOM’03), San Francisco, CA, Dec.

2003. ⎯ IST European Summit, Aveiro, Portugal, June, 2003. ⎯ IEEE Int’l Conf. on Communications (ICC’02), New York City, NY, Apr. 2002. ⎯ IEEE Global Telecomm. Conf. (GLOBECOM’00), San Francisco, CA, Nov.

2000.

• Steering & Advisory Committee member:

⎯ Int’l Workshop on Multiple Access Communications (MACOM).

⎯ Int’l Symposium on Applied Sciences in Biomedical & Communication Technologies (ISABEL).

⎯ Int’l Conf. on Recent Advances in Information Technology (RAIT-2012), Dhanbad, India, March 2012.

• Conference Session Organizer/Chair:

⎯ IEEE Int’l Conf. in Communications (ICC’11), Kyoto, Japan, June 2011. ⎯ Int’l Workshop on Multiple Access Communications (MACOM´10), Barcelona,

Spain, Sept. 2010.

⎯ IEEE Int’l Symp. on Information Theory (ISIT’10), Austin, TX, June 2010. ⎯ IEEE Communication Theory Workshop (CTW’10), Cancun, Mexico, May

2010. ⎯ European Wireless 2010, Lucca, Italy, April 2010. ⎯ Int’l Zürich Seminar (IZS’10), Zürich, Switzerland, March 2010. ⎯ Int’l Workshop on Computational Advances in Multi-Sensor Adaptive Processing

(CAMSAP'09), Aruba, Dec. 2009. Co-organizer and co-chair of a special invited session on “Adaptive Processing for Wireless Networks”.

⎯ IEEE Int’l Conf. in Communications (ICC’08), Beijing, China, May 2008. ⎯ 41st Asilomar Conf. on Signals, Systems & Computers, Pacific Grove, CA, Nov.

2007. Organizer and chair of a special invited session on “MIMO: Challenges & Opportunities”.

⎯ IEEE Int’l Conf. on Communications (ICC’06), Istanbul, Turkey, June 2006. ⎯ 6th IEEE Int’l Workshop on Signal Processing Advances in Wireless Communications

(SPAWC’05), New York City, USA, June 2005. Organizer and chair of a special invited session on “MIMO communication”.

⎯ IEEE Int’l Conf. on Communications (ICC’05), Seoul, Korea, May 2005. ⎯ Int’l Symp. on Personal, Indoor & Mobile Radio Communications (PIMRC’04),

Barcelona, Spain, Sept. 2004.

19

⎯ IEEE Int’l Symp. on Spread Spectrum Techniques & Applications (ISSSTA’04), Sydney, Australia, Sept. 2004.

⎯ IST European Summit, Aveiro, Portugal, June 2003. ⎯ IEEE Int’l Conf. on Communications (ICC’02), New York, NY, April 2002. ⎯ IST European Summit, Sitges, Spain, Sept. 2001. ⎯ IEEE Vehicular Technology Conference (VTC’01), Rhodes, Greece, May 2001. ⎯ IEEE Global Telecomm. Conf. (GLOBECOM’00), San Francisco, CA, Dec.

2000. ⎯ Conf. on Inform. Sciences & Systems (CISS’00), Princeton, NJ, March 2000.

• Advisor, Cambridge University Press editorial house, since 2005.

• Advisor, Prentice Hall editorial house, since 2009.

• Selection Committee Member, “la Caixa” Graduate Fellowship Program, 2010.

• Project Evaluator, European Commission IST 5th Framework Program in Mobile & Personal Communications Systems, Brussels, 2001.

UNIVERSITY COMMITTEE APPOINTMENTS

• Chair, Dept. of Information & Communication Technologies Graduate Studies Committee, UPF, since Sept. 2009.

• Vice-Chair, Dept. of Information & Communication Technologies, UPF, since July 2010.

• Academic Secretary, Dept. of Information & Communication Technologies, UPF, Sept. 2008 - June 2010.

• Member, Dept. of Information & Communication Technologies Faculty Committee, UPF, since July 2010.

• Member, UPF Graduate Studies Committee, since Sept. 2009.

• UPF Coordinator, Master ASMT (Advanced Sciences Modern Telecommunications), since Sept. 2008.

DOCTORAL COMMITTEES

• Cristina Cano, “A Low Power Listening with Wake Up After Transmissions MAC Protocol for WSNs,” Ph.D. Dissertation, Universitat Pompeu Fabra, Mar. 4th 2011.

• Ramya Bhagavatula, "Limited Feedback for Multicell Cooperative Systems," Ph.D. Dissertation, the University of Texas at Austin, USA, Nov. 5th 2010.

• Shakti Shenoy, “Efficient Communication over Wireless Channels: New Results in Equalization, Diversity and Interference Alignment,” Ph.D. Dissertation, Eurecom Institure, France, June 26th 2010.

20

• Sriram Sridharan, “Capacity of Interference Networks − Achievable Regions and Outer Bounds,” Ph.D. Dissertation, the University of Texas at Austin, USA, April 2010.

• Malte Schellmann, “Multiuser MIMO-OFDM in Practice: Enabling Spectrally Efficient Transmission over Time-varying Channels,” Ph.D. Dissertation, Technische Universität Berlin, Germany, May 2009.

• Nuria Garcia, “Radio Resource Management Strategies Based on Hopfield Neural Networks,” Ph.D. Dissertation, Universitat Pompeu Fabra, May 25th 2009.

• Jaume Barceló, “Carrier Sense Multiple Access with Enhanced Collision Avoidance,” Ph.D. Dissertation, Universitat Pompeu Fabra, Feb. 2009.

• Eduard Calvo, “Interference in Wireless Networks: Cancelation, Impact, Practical Management, and Complexity,” Ph.D. Dissertation, Universitat Politècnica de Catalunya, Feb. 2009.

• Héctor Carrasco Espinosa, “Contribución a las Técnicas de Diversidad en Transmisión para Sistemas de Comunicaciones Móviles de Tercera Generación,” Universitat Politècnica de Catalunya, Feb. 18th, 2008.

• Antoni Morell, “A Convex Decomposition Perspective on Dynamic Bandwidth Allocation and Applications,” Ph.D. Dissertation, Universitat Autònoma de Barcelona, 2008.

• Anna Sfairopoulou, “A Cross-layer Mechanism for Quality of Service Improvements in Voice over IP over Multi-rate Wireless LAN Networks,” Ph.D. Dissertation, Universitat Pompeu Fabra, 2008.

• Adrián Agustín de Dios, “Relay-assisted Transmission and Radio Resource Management for Wireless Communications,” Ph.D. Dissertation, Universitat Politècnica de Catalunya, 2008.

• Alberto Lopez-Toledo, “Statistical Signal Processing for Wireless Networks – Modeling, Analysis and Optimization,” Ph.D. Dissertation, Columbia University, USA, Aug. 6th, 2007.

• Amine Maaref, “Random Matrix Applications to Wireless MIMO Systems,” Ph.D. Dissertation, Institut National de la Recherche Scientifique (INRS), Université du Québec, Canada, June 18th, 2007.

• Kai Li, “Low-complexity Capacity-approaching Schemes for Wireless Systems,” Ph.D. Dissertation, Columbia University, USA, May 2nd, 2007.

• Chuxiang Li, “Advanced Signal Processing and Resource Scheduling in Space-time Communication Systems,” Ph.D. Dissertation, Columbia University, USA, Oct. 6th, 2006.

HOSTED RESEARCHERS

• Prof. Peter Smith, University of Canterbury (New Zealand), Dec. 2010 – Jan 2011.

21

• Dr. Thomas L. Marzetta, Bell Labs (Alcatel-Lucent, USA), Sept. 2009.

• Prof. Robert W. Heath Jr., The University of Texas at Austin (USA), May-July 2009.

• Prof. Nihar Jindal, University of Minnesota (USA), Oct. 2008 – Jan. 2009.

• Prof. Albert Guillèn-Fabregas, University of Cambridge (UK), Sept. 2008.

DEMONSTRATORS

Participated in the first demonstration of out-of-cell MIMO interference cancellation at the 2003 IST European Summit in Aveiro, Portugal, in June 2003. The demonstrator consisted of two commercial Lucent Technologies base stations, fitted for MIMO transmission using up to 4 antennas, and two mobile station prototypes equipped with 4 receive antennas each. The baseband processing boards on each of these prototypes featured custom-made MIMO ASIC chips. Live video was streamed from each base station down to a respective mobile, with cross-interference between the transmissions. At each mobile station, the MIMO ASIC cancelled the interference from the undesired base while detecting the signal from the serving base.

GENERALITIES

Nationalities: Spain, USA.

Languages: Catalan, Spanish, English, Italian, German.

BELL LABS TECHNICAL MEMORANDA

TR24 S. Venkatesan, A. Lozano and R. A. Valenzuela, “Network MIMO: Overcoming Intercell Interference in Indoor Wireless Systems,” Bell Labs Technical Memorandum, ITD-07-47889D, Sep. 25th, 2007.

TR23 A. Lozano, A. M. Tulino and S. Verdú, “Optimum Power Allocation for Multiuser OFDM with Arbitrary Signal Constellations,” Bell Labs Technical Memorandum, ITD-06-47086F, Aug. 7th, 2006.

TR22 A. Lozano, A. M. Tulino and S. Verdú, “Optimum Power Allocation for Parallel Gaussian Channels with Arbitrary Input Distributions,” Bell Labs Technical Memorandum, ITD-05-46167G, May 4th, 2005

TR21 A. Lozano et. al., “Key Technologies for Fourth-Generation Cellular Networks,” Bell Labs Technical Memorandum, ITD-04-45778J, Sept. 23nd, 2004.

TR20 A. Lozano, G. Alfano, A. M. Tulino and S. Verdú, “Mutual Information and Eigenvalue Distribution of MIMO Ricean Channels,” Bell Labs Technical Memorandum, ITD-04-45550L, Jul. 22nd, 2004.

TR19 A. Lozano, A. M. Tulino and S. Verdú, “MIMO Capacity with Channel State Information at the Transmitter,” Bell Labs Technical Memorandum, ITD-04-45549K, Jul. 22nd, 2004.

22

TR18 A. Lozano, A. M. Tulino and S. Verdú, “High-SNR Power Offset in Multi-Antenna Communication,” Bell Labs Technical Memorandum, ITD-04-45548J, Jul. 22nd, 2004.

TR17 A. Lozano, G. Alfano, A. M. Tulino and S. Verdú, “Capacity of MIMO Channels with One-sided Correlation,” Bell Labs Technical Memorandum, ITD-04-45547H, Jul. 22nd, 2004.

TR16 A. Lozano, A. M. Tulino and S. Verdú, “Capacity-Achieving Input Covariance for Single-user Multi-Antenna Channels,” Bell Labs Technical Memorandum, ITD-04-45193Y, Feb. 26th, 2004.

TR15 A. Lozano, A. M. Tulino and S. Verdú, “Capacity-Achieving Input Covariance for Single-user Multi-Antenna Channels,” Bell Labs Technical Memorandum, ITD-04-45193Y, Feb. 26th, 2004.

TR14 A. Lozano, A. M. Tulino and S. Verdú, “Multi-Antenna Capacity in the Low-Power Regime,” Bell Labs Technical Memorandum, ITD-02-43550M, Sept. 16th, 2002.

TR13 A. Lozano, A. M. Tulino and S. Verdú, “Capacity-Achieving Input Covariance for Single-user Multi-Antenna Channels,” Bell Labs Technical Memorandum, ITD-04-45193Y, Feb. 26th, 2004.

TR12 A. Lozano, “Enhancing UMTS High-Speed Downlink Packet Access with Dual- Antenna Terminals,” Bell Labs Technical Memorandum, ITD-02-42693F, Mar. 8th, 2002.

TR11 H. Zheng, A. Lozano and M. Haleem, “Multiple ARQ Processes for MIMO Systems,” Bell Labs Technical Memorandum, ITD-01-42001D, Oct. 9th, 2001.

TR10 A. Lozano, “Capacity-Approaching Rate Distribution for Layered Multi-Antenna Architectures,” Bell Labs Technical Memorandum, ITD-01-41790Z, Aug. 20th, 2001.

TR9 A. Lozano, “Unified Capacity Analysis for Mobile Data Communications Systems with Antenna Arrays,” Bell Labs Technical Memorandum, ITD-01-40799X, Feb. 14th, 2001.

TR8 S. T. Chung, A. Lozano and H. C. Huang, “Low Complexity Algorithm for Rate Quantization in Extended V-BLAST,” Bell Labs Technical Memorandum, ITD-00-40317X, Oct. 13th, 2000.

TR7 Q. Sun, A. Lozano and H. C. Huang, “Estimation of Continuous Fading BLAST Channels,” Bell Labs Technical Memorandum, ITD-00-40127Q, Sept. 14th, 2000.

TR6 S. T. Chung, A. Lozano and H. C. Huang, “Approaching Eigenmode BLAST Channel Capacity Using V-BLAST with Rate and Power Adaptation,” Bell Labs Technical Memorandum, ITD-00-40050G, Aug. 30th, 2000.

TR5 D. Chizhik, F. R. Farrokhi, J. Ling and A. Lozano, “Effect of Antenna Separation on Capacity of BLAST System in Correlated Channels,” Bell Labs Technical Memorandum, ITD-00-38894A, Feb. 9th, 2000.

23

TR4 F. R. Farrokhi, A. Lozano, G. J. Foschini and R. A. Valenzuela, “Very High Capacity Multiple-Access Wireless System Using Multiple Transmit and Receive Antennas,” Bell Labs Technical Memorandum, ITD-00-38618A, Dec. 2nd, 1999.

TR3 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “Link Spectral Efficiency of BLAST in Wireless Channels with Various Levels of Scattering,” Bell Labs Technical Memorandum, ITD-99-38444L, Dec. 2nd, 1999.

TR2 A. Lozano, F. R. Farrokhi and R. A. Valenzuela, “H-BLAST: A Near-Optimal Wireless Link Technique Adaptive to Scattering Conditions,” Bell Labs Technical Memorandum, ITD-99-38314V, Nov. 9th, 1999.

TR1 A. Lozano, C. Papadias, G. J. Foschini and R. A. Valenzuela, “An Optimal Space-Time BLAST Receiver for Wideband Wireless Communications,” Bell Labs Technical Memorandum, ITD-99-37905A, Aug. 31st, 1999.

Curriculum Vitae of Ueli Maurer(Last update: June 2011)

General Information

Personal Data:

Born May 26, 1960, in St. Gallen, Switzerland. Citizen of Switzerland.

Children: two adult daughters.

Languages: German (native), English (fluent), French (fluent), Italian (basics).

Hobbies: hanggliding, skiing, playing the violin, wines.

Home page: www.crypto.ethz.ch/∼maurer

Education:

1990 ETH Zurich: Dr. sc. techn. (Dissertation: “Provable security in cryptography”; advisor:Prof. J.L. Massey, coreferee: Dr. W. Diffie)

1985 ETH Zurich, Dept. of Electrical Engineering: Dipl. El. Ing. ETH (with honors).

1979 Kantonsschule St. Gallen (Gymnasium), Matura Typus C.

Employments:

2000–present Full Professor of Computer Science, ETH Zurich. Head of Research Group in Infor-mation Security and Cryptography (approx. 10 members).

1997–2000 Associate Professor of Computer Science, ETH Zurich.

1992–1997 Assistant Professor of Computer Science, ETH Zurich.

1990–1991 Research Associate (DIMACS Fellow), Dept. of Computer Science, Princeton Uni-versity, Princeton, NJ, USA.

1985–1990 Research and teaching assistant, Institute for Signal and Information Processing,Dept. of Electrical Engineering, ETH Zurich.

1981–1983 Part-time high-school teacher (mathematics), Kantonsschule St. Gallen, Switzerland.

1980–1984 Part-time teaching assistant, Institute for Mechanical Engineering, ETH Zurich.

Research Activities and Interests:

Theory: cryptography (all aspects), theoretical aspects of information security, information theory,design and analysis of algorithms, complexity theory, quantum information science, computationalnumber theory, computer science theory and discrete mathematics in general.

Applications: applications of cryptography in general, distributed systems and network security, in-formation and computer security, electronic commerce, digital payment systems, digital signatures,digital evidence, and public-key infrastructures (PKI), secure cooperation without mutual trust, e-voting, statistical randomness testing.

1

Awards and Distinctions:

Fellow of the IACR (International Association for Cryptologic Research), since 2008.

Member of the German Academy of Sciences (Leopoldina), since 2007.

Fellow of the IEEE (Institute of Electrical and Electronics Enginees), since 2003.

2000 Rademacher Lecturer, Dept. of Mathematics, University of Pennsylvania, Philadelphia.

ETH–Medal for Ph.D. thesis entitled “Provable Security in Cryptography”, 1991.

First prize winner at the IEEE 1986 Student Paper Contest (Paris).

ETH–Medal for the Diploma Thesis, 1985.

Award for best Diploma in Electrical Engineering, ETH Zurich, 1985.

Award for the best high school degree (Matura) of the year, Kantonsschule St.Gallen, 1979.

Academic and Scientific Professional Activities

Editorial Activities:

Editor-in-Chief, Journal of Cryptology, 2002–2010.

Editor-in-Chief (with David Basin), Springer Series in Inform. Security andCryptography (ISC), since 1999.

Journal of Cryptology: Associate Editor, 1990–91 and 1995–2001.

IEEE Trans. on Information Theory: Associate Editor for Complexity and Cryptography, 1991–94.

IEEE Journal on Selected Areas in Communications (JSAC), Guest Editor for Special Issue on NetworkSecurity (with S. Bellovin, S. Kent, and H. Orman), publication date Jan. 2000.

Editor of Advances in Cryptology – EUROCRYPT ’96, Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 1070, 1996.

Communications, Coding and Cryptography – Two sides of one tapestry, R.E. Blahut, D.J. Costello, U.M.Maurer and T. Mittelholzer (Eds.), The Kluwer International Series in Engineering and ComputerScience, Kluwer Academic Publishers, Boston, 1994.

Invited Speaker at Major Scientific Conferences:

TOSCA’11, Theory of Security and Applications, Saarbrucken, March 2011.

Trends in Theoretical Cryptography (TTC 2011), Beijing, Jan. 2011.

Financial Cryptography 2010, Tenerife, Spain, Jan. 2010.

CRYPTO’ 2009, Santa Barbara, Aug. 2009.

AfricaCrypt 2009, Gammarth, Tunesia, June 2009.

Network Coding Workshop 2009, Lausanne, Switzerland, June 2009.

SECRYPT 2008, Porto, July 2008.

3rd International Conference on Informations Theoretic Security (ICITS 2007), Madrid, May 2007.

10th IMA International Conference on Cryptography and Coding, Cirencester, England, Dec. 2005.

2004 International Symposium on Distributed Computing (DISC), Amsterdam, Oct. 2004.

2004 IEEE Intern. Symposium on Information Theory, Chicago, July 2004, invited plenary lecture.

2004 IEEE International Symposium on Information Theory, Chicago, July 2004, invited tutorial.

2004 ACM SIGMOD Conference, Paris, June 2004.

2

Quantum Information Processing (QIP ’04), Waterloo, Canada, Jan. 2004.

6th Information Security Conference (ISC ’03), Bristol, Oct. 2003.

Coding and Cryptography (WCC ’03), Paris, March 2003.

3rd IMACS Conference on Monte Carlo Methods (IMACS’01), Salzburg, Austria, Sept. 2001.

CRYPTO’99, Santa Barbara, Aug. 1999.

4th ACM Conf. on Computer and Communication Security, Zurich, April 1997, invited tutorial.

4th IMA Conference on Cryptography and Coding, Cirencester, England, Dec. 1993.

Invited Speaker at Conferences, Ph.D. Schools, andWorkshops:

Number Theory and Computational Cryptography (NTACC), Warsaw, Sept. 2010.

IEEE Information Theory Workshop (ITW 2010), Dublin, August 2010.

German Mathematical Society, Annual Meeting, March 2010.

9th International School on Foundations of SecurityAnalysis andDesign, Bertinoro, Italy, Sept. 2009.

2009 CanadianWorkshop on Information Theory, Ottawa, May 2009.

ECRYPT Doctoral School on Mathematical Foundations in Cryptography, Lausanne, Feb. 2009.

17th annual HP Colloquium on Information Security, University of London, Dec. 2006, keynotespeaker.

Bertinoro School on Cryptography and Number Theory, Italian institute of higher mathematics,Bertinoro, July 2005.

Workshop Mathematics of Cryptology, Lorentz Center, Leiden Univ., The Netherlands, Oct. 2003.

Algebra and Communications Workshop, EPFL, Lausanne, Jan. 2003.

Number-theoretic Cryptography Workshop, Mathematical Sciences Research Institute (MSRI),Berkeley, Oct. 2000.

Rademacher Lectures, Dept. of Mathematics, University of Pennsylvania, Philadelphia, Sept. 2000.

Schloss Dagstuhl Anniversary Conference (Informatics – 10 years back, 10 years ahead), Aug. 2000.

Informatik’99, Annual Conf. of the German Computer Science Ass. (GI), Paderborn, Oct. 1999.

1998 IEEE International Workshop on Information Theory, Killarney, Ireland, June 1998.

1997 IEEE International Workshop on Information Theory, Longyearbyen, Norway, July 1997.

Swiss Computer Science Conference, Zurich, Oct. 1996.

Symposium on Quantum Comm. and Cryptography, Broadway, England, March 1994.

1992 IEEE Internat. Workshop on Information Theory, Salvador, Brasil, June 1992.

1990 IEEE International Workshop on Inform. Theory, Veldhoven, The Netherlands, June 1990.

Invited talks at various workshops held in Schloss Dagstuhl, Luminy, Monte Verita, etc.

Chairman and Organizer of Scientific Conferences:

Public-Key Cryptography, Workshop at Schloss Dagstuhl, Sept. 2011, Co-chair.

ICALP 2011, Zurich, July 2011, Co-chair.

SEC 2011, Annual Conference of IFIP TC 11, Lucerne, June 2011, General Chair.

2010 Theory of Cryptography Conference (TCC), Zurich, Feb. 2010, General Chair.

2007 Dagstuhl Workshop on Cryptography, Schloss Dagstuhl, 2007, co-organizer.

3

Program Chair, Information Theory Workshop ITW05, Japan, Nov. 2005.

Annual Zurich Symposium on Privacy and Security, co-founder (in 1996) and co-organizer.

2002 Dagstuhl Workshop on Cryptography, Sept. 22–27, 2002, Schloss Dagstuhl, co-organizer.

2002 DIMACS Workshop on Secure Multi-Party Computation, May 15–17, 2002, Rutgers, NJ, co-organizer.

2002 IEEE International Symposium on Information Theory, July 1–5, 2002, Lausanne Switzerland,publicity chair.

Cryptographic Protocols (Workshop), Monte Verita, Switzerland, March 2001, chairman.

Cryptographic Protocols (Workshop), Monte Verita, Switzerland, March 1998, chairman.

1997 IEEE Information Theory Workshop, Longyearbyen, Norway, July 1997, co-organizer.

EUROCRYPT ’96, Zaragoza, Spain, May 1996, program chairman.

Communications, Coding and Cryptography, Monte Verita, Switzerland, 1994, co-chairman.

Member of Program Committees:

4th International Conference on Informations Theoretic Security (ICITS), Shizuoka, Japan, Dec. 2009.

5th Theory of Cryptography Conference (TCC), New York, March 2008.

2005 IEEE Information Theory Workshop, Awaji Island, Japan, Oct. 2005 (Program Chair).

2005 IEEE International Symposium on Information Theory, Adelaide, 2005.

11th ACM Conference on Computer and Commun. Security (CCS 2004), Washington, Oct. 2004.

2004 IEEE International Symp. on Inform. Theory and its Applications (ISITA), Parma, Oct. 2004.

Security in Communication Networks (SCN’04), Amalfi, Italy, Sept. 2004.

2004 IEEE International Symposium on Information Theory, Chicago, July 2004.

Public-Key Cryptography 2003, Florida.

2002 IEEE International Symposium on Information Theory, Lausanne, July 2002.

2001 IEEE International Symposium on Information Theory, Annapolis, July 2001.

RSA 2001, Research Track, San Francisco, April 2001.

Asiacrypt 2000, Kyoto, Japan, Dec. 2000.

SIS 2000 (Sicherheit in Informationssystemen), Zurich, Oct. 2000.

Financial Cryptography 2000, Anguila, Feb. 21–24, 2000.

2000 IEEE International Symposium on Information Theory, Sorrento, Italy, July 2000.

Asiacrypt ’99, Singapore, Nov. 1999.

Security in Communication Networks (SCN’99), Amalfi, Italy, Sept. 1999.

Fifth ACMConference on Computer and Communications Security, San Francisco, November 1998.

5th European Symposium on Research in Computer Security (ESORICS), Belgium, Sept. 1998.

CRYPTO ’98, Santa Barbara, USA, Aug. 1998.

SIS ’98 (Sicherheit in Informationssystemen), Stuttgart, March 1998.

ICICS ’97: International Conf. on Inform. and Communications Security, Nov. 1997, Beijing, China.

Commun. and Multimedia Security, Joint Working Conf. of IFIP TC-6 and TC-11, Athens, 1997.

1997 IEEE International Symposium on Information Theory,Ulm, Germany, June 1997.

Security in Communication Networks (SCN), Amalfi, Italy, Sept. 16–17, 1996.

4

SIS ’96 (Sicherheit in Informationssystemen), Vienna, March 21–22, 1996.

EUROCRYPT ’96, Zaragoza, Spain, May 1996.

EUROCRYPT ’95, Saint Malo, France, May 21–25, 1995.

EUROCRYPT ’94, Perugia, Italy, May 9–12, 1994.

SIS ’94 (Sicherheit in Informationssystemen), Zurich, March 10–11, 1994.

CRYPTO ’92, Santa Barbara, USA, Aug. 15–20, 1992.

CRYPTO ’91, Santa Barbara, USA, Aug. 11–15, 1991.

EUROCRYPT ’90, Aarhus, Denmark, May 21–24, 1990.

Other Professional Scientific Activities:

Member of the Steering Committee of Innovations in Computer Science conference series, since 2010.

Member of Awards Committee, IEEE Information Theory Society, since 2009.

Member of the Steering Committee of the Conference Information-theoretic Security, since 2005.

Member of the Scientific Board of the Swiss Academy of Engineering Sciences (SATW), 2000-2002.

Member of the Scientific Board for E-Government of the Canton of Zurich, since 2000.

Member of the Scientific Counsil of the Dept. of Computer Science, Ecole Normale Superieure, Paris,since 2000.

Member of Board of Directors, International Association for Crypyologic Research (IACR), since1997.

Member of the Steering Committee of the International Conference on Information and Communi-cations Security (ICICS), since 1999.

Member of the Scientific Advisory Committee, Centre for Applied Cryptographic Research, Univer-sity of Waterloo, since 1998.

Member of the Steering Committee of the biannual European Symsposium on Research in ComputerSecurity (ESORICS), 1996-1998.

Taught various shourt courses on information security and cryptography, in academic and non-academic environments.

Organizer of summer academy for the Schweizerische Studienstiftung (Maienfeld, 1996).

Co-founder and boardmember (1993–97) of the security interest group (Fachgruppe Security) of theSwiss Informaticians Society (SI).

Activities at ETH Zurich:

Supervised 17 Ph.D. theses and numerous Master’s theses.

Member of the Master’s admission committee, since 2008.

Head (Vorsteher) of the Institute for Theoretical Computer Science, 1996-97 and 2001–2004.

Member of Ph.D. Committee (Doktoratsausschuss), CS Department, since 2001, chairman 2001-2004.

Member of Teaching Committee (Studienkommission), CS Department, 1998–2004.

Chairperson for the promotion of computer science for female students,, since 2000.

Member of Faculty Committee of ETHZ (Ausschuss der Dozentenkommission), 1993–95.

Supervised 14 Ph.D. theses, 74 Diploma/Masters theses, and numerous semester project theses.

Coreferee for various Ph.D. theses at ETH and other universities.

5

Courses taught at ETH Zurich:

Discrete Mathematics and Logic (1st semester)

Cryptography (advanced focus course)

Information Security (advanced core course)

Discrete Mathematics (2nd semester)

Cryptographic Protocols (advanced course)

Algebra II (2nd semester)

Computer Science for Mechanical Engineers I (1st semester)

Theoretical Computer Science II (Computer Science curriculum, 4th semester)

Information and Communication (Computer Science curriculum, 3rd semester)

Applied Digital Information Theory I (EE curriculum, 7th semester)

Information Security and Cryptography (advanced course)

Public-Key Cryptography (advanced course)

Various research seminars and colloquia

Non-Academic Professional Activities

Consulting Activities:

Various consulting mandates at the management and the technical level in the following areas: secu-rity strategies, information and network security, cryptography, E-commerce and payment systems,E-government. Partial list of mandates:Swiss government (EJPD), Swiss Re, Union Bank of Switzerland (UBS); Credit Suisse; Swiss Bank Cooper-ation (SBC/SBV); Bank of International Settlement (BIS), Basel; Zurcher Kantonalbank (ZKB), Zurich; BankJulius Bar, Zurich; Glencore, Zug; Telekurs Payserv AG, Zurich; Swiss Federal Council (Bundesrat), Bern;Executive Board (Regierungsrat) of the Canton of Zurich; Swiss Federal Agency for Information Technology(BFI), Bern; Department of Justice, Canton of Zurich; PricewaterhouseCoopers, Zurich; Ascom, Bern; Bull(Switzerland) AG, Zurich; Integris Suisse AG, Urdorf; Itsec AG, Zurich; Swisskey AG, Zurich; Pretty GoodPrivacy, Inc., USA; Network Associates, Inc., USA; Omnisec AG, Dallikon, Switzerland; Cnlab AG, Rapper-swil, Switzerland; Utimaco, Zurich; Crypto AG, Steinhausen, Switzerland; Bossard AG, Zug, Switzerland;KEBA Electronic, Linz, Austria.

3 international patents, 1 patent pending.

Taught annual professional 4-day seminar on cryptography, since 1997.

Co-founder of Companies:

Seclutions AG, Zurich, a company producing high-security Web access products, 2002; renamed toVisonys in 2006 and sold to Phion in 2008.

NewValue AG, Zurich, a private-equity investment company focusing on ethically responsible in-vestments, 2000.

Cnlab Software AG, Rapperswil, a company producing cryptographic software, 1998.

Advanced Technology Group GmbH, Wil, a technical seminar company, 1997.

6

Member of Boards of Directors or Scientific Advisory Boards:

Tamedia AG, Zurich, Member of Board of Directors (2002-2008).

Seclutions AG, Zurich, Member of Board of Directors (2002–2005).

NewValue AG, Zurich, Member of Board of Directors (2000–2006).

PricewaterhouseCoopers AG, Zurich, Member of Scientific Advisory Board (since 1997).

Former mandates: Cnlab Software AG, Rapperswil, Switzerland (1998–2001); Zurich ManagementGroup AG, Zurich,(1998–2000); Integris (Schweiz) AG, Urdorf (since 1997–2002); Fin’Objects AG,Zurich (1997–99); Pretty Good Privacy (PGP), Inc., Redwood Shores, CA, USA (1996-1997).

7

List of Publications of Ueli Maurer(Last update: January 2010)

Editor of Books and Guest Editorships:

G. Hanaoka, H. Imai, U. Maurer, and Y. Zheng, (Eds.), Guest editors for IEEE Transactions on Informa-tion Theory, vol. 54, no. 6, Special Issue on Information-theoretic security, 2007.

D. Basin and U.M. Maurer, (Eds.), Springer Verlag Book Series Information Security and Cryptography(ISC).

Guest Editor for IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on NetworkSecurity (with S. Bellovin, S. Kent, and H. Orman), publication date Aug. 2000.

U.M. Maurer (Ed.), Advances in Cryptology – EUROCRYPT ’96, Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1070, 1996.

R. E. Blahut, D. J. Costello, U.M. Maurer, and T. Mittelholzer (Eds.), Communication and Cryptography– Two Sides of One Tapestry, Kluwer Academic Publishers, 1994.

Refereed Journals:

S. Dziembowsky and U. Maurer, The bare bounded-storage model: The tight bound on the storagerequirement for key agreement, IEEE Trans. on Information Theory, vol. 54, no. 6, pp. 2790–2792, 2008.

U. Maurer, R. Renner, and S. Wolf, Unbreakable keys from random noise, in: Security with Noisy Data,P. Tuyls et al. (eds.), Springer Verlag, pp. 21-44, 2007.

A. Bariska, R, Konig, U. Maurer, and R. Renner, Small accessible quantum information does not implysecurity, Physical Review Letters, vol. 98, no. 140502, April 2007.

U. Maurer, Secure multi-party computation made simple, Discrete Applied Mathematics, vol. 154,pp. 370–381, 2006.

R. Konig, U. Maurer, and R. Renner, On the power of quantum memory, IEEE Transactions on Informa-tion Theory, vol. 51, no. 7, pp. 2391–2401, 2005.

J. Considine, M. Fitzi, M. Franklin, L.A. Levin, U. Maurer, and D. Metcalf, Byzantine agreement givenpartial broadcast, Journal of Cryptology, vol. 18, no. 3, pp. 191–217, 2005.

M. Fitzi, J. Garay, U. Maurer, and R. Ostrovsky, Minimal complete primitives for secure multi-partycomputation, Journal of Cryptology, vol. 18, no. 1, pp. 37–61, 2005.

U. Maurer, New approaches to digital evidence, Proceedings of the IEEE, vol. 92, no. 6, pp. 933–947,June 2004 (invited).

S. Dziembowsky and U. Maurer, Optimal randomizer efficiency in the bounded-storage model, Jour-nal of Cryptology, vol. 17, no. 1, pp. 5–26, 2004.

U. Maurer, and S. Wolf, Secret key agreement over a non-authenticated channel – Part I: Definitionsand bounds, IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 822–831, 2003.

U. Maurer, and S. Wolf, Secret key agreement over a non-authenticated channel – Part II: The simu-latability condition, IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 832–838, 2003.

U. Maurer, and S. Wolf, Secret key agreement over a non-authenticated channel – Part III: Privacyamplification, IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 839–851, 2003.

1

M. Fitzi, N. Gisin, and U. Maurer, Quantum solution to the Byzantine agreement problem, PhysicalReview Letters, vol. 87, no. 21, Nov. 2001.

U. Maurer Cryptography 2000 ± 10, R. Wilhelm (Ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 2000, pp. 63–85, 2000 (invited).

U. Maurer, Authentication theory and hypothesis testing, IEEE Transactions on Information Theory,vol. 46, no. 4, pp. 1350–1356, June 2000.

M. Hirt and U. Maurer, Player simulation and general adversary structures in perfect multi-partycomputation, Journal of Cryptology, vol. 13, no. 1, pp. 31–60, 2000.

U. Maurer and S. Wolf, The Diffie-Hellman protocol, Designs, Codes and Cryptography, vol. 19, pp147–171, 2000.

R. Kohlas and U. Maurer, Reasoning about public-key certification: On bindings between entitiesand public keys, IEEE Journal on Selected Areas in Communications, vol. 18, no. 4, pp. 551–560, 2000.(Preliminary version in Proc. of Financial Cryptography ’99.)

U. Maurer and S. Wolf, The relationship between breaking the Diffie-Hellman protocol and comput-ing discrete logarithms, SIAM Journal on Computing, vol. 28, no. 5, pp. 1689–1721, 1999.

U. Maurer and S. Wolf, Unconditionally secure secret-key agreement and the intrinsic conditionalmutual information, IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, 1999.

J. Camenisch, U. Maurer and M. Stadler, Digital payment systems with passive anonymity-revokingtrustees, Journal of Computer Security, vol. 5, no. 1, pp. 69–89, 1997. (Preliminary version in Proc. ofESORICS’96.)

C. Cachin and U. Maurer, Linking information reconciliation and privacy amplification, Journal ofCryptology, vol. 10, no. 2, pp. 97–110, 1997.

U. Maurer and P.E. Schmid, A calculus for security bootstrapping in distributed systems, Journal ofComputer Security, vol. 4, no. 1, pp. 55–80, 1996. (Preliminary version in Proc. of ESORICS’94.)

U. Maurer and Y. Yacobi, A non-interactive public-key distribution system, Designs, Codes and Cryp-tography, vol. 9, no. 3, pp. 305–316, 1996.

U. Maurer, On the oracle complexity of factoring integers, Computational Complexity, vol. 5, pp. 237–247, 1996.

C.H. Bennett, G. Brassard, C. Crepeau, and U.Maurer, Generalized privacy amplification, IEEE Trans-actions on Information Theory, vol. 41, no. 6, pp. 1915–1923, 1995.

U. Maurer, Kryptologie: eine neuartige Anwendung der Mathematik, Elemente der Mathematik,Birkhauser Verlag, vol. 50, pp. 89–106, 1995.

U. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters, Jour-nal of Cryptology, vol. 8, no. 3, pp. 123–155, 1995.

U. Maurer, The strong secret key rate of discrete random triples, in Communication and Cryptography –Two Sides of One Tapestry, (R. Blahut et al., Eds.), Kluwer Academic Publishers, pp. 271–285, 1994.

U. Maurer, Secret key agreement by public discussion from common information, IEEE Transactionson Information Theory, vol. 39, pp. 733–742, 1993.

U. Maurer, Practical perfect cryptographic security, in: Advances in Computational Complexity Theory,AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 135–153, 1993.

U. Maurer and J.L. Massey, Cascade ciphers: the importance of being first, Journal of Cryptology, vol.6, no. 1, pp. 55–61, 1993.

2

U. Maurer, A universal statistical test for random bit generators, Journal of Cryptology, vol. 5, no. 2,pp. 89–105, 1992.

U. Maurer, Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Goodgraphs, Discrete Applied Mathematics, vol. 37, pp. 421–436, 1992.

U. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, Journal of Cryp-tology, vol. 5, no. 1, pp. 53–66, 1992.

U.Maurer and J.L.Massey, Local randomness in pseudo-random sequences, Journal of Cryptology, vol.4, no. 2, pp. 135–149, 1991.

U. Maurer and R. Viscardi, On the linear complexity and correlation immunity of the summationcipher, 1986 IEEE Student Papers, New York: IEEE Publication Service, pp. 160–168, 1987.

Proceedings of Refereed Conferences:

U. Maurer and S. Tessaro, A hardcore lemma for computational indistinguishability: Security am-plification for arbitrarily weak PRGs with optimal stretch, Advances in Cryptology – TCC 2010, D.Micciancio (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5978, pp. 237–254,2010.

P. Gazi and U. Maurer, Free-start distinguishing: Combining two types of indistinguishability am-plification, Proc. Int. Conf. on Information-theoretic Security (ICITS) 2009, K. Kurosawa (ed.), LectureNotes in Computer Science, Berlin: Springer-Verlag, 2010.

P. Gazi and U. Maurer, Cascade encryption revisited, Advances in Cryptology – Asiacrypt 2009, M.Matsui (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5912, pp. 37–51, 2009.

U. Maurer, Abstraction in cryptography, Advances in Cryptology – CRYPTO 2009, S. Halevi (ed.), Lec-ture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5677, p, 459, 2009.

U. Maurer and S. Tessaro, Computational indistinguishability amplification: Tight product theoremsfor system composition, Advances in Cryptology – CRYPTO 2009, S. Halevi (ed.), Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 5677, pp. 350–368, 2009.

U. Maurer, Unifying zero-knowledge proofs of knowledge, Advances in Cryptology – AFRICACRYPT2009, B. Preneel (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5580, pp. 272–286, 2009.

D. Aggarwal and U. Maurer, Breaking RSA generically is equivalent to factoring. Advances in Cryptol-ogy – EUROCRYPT 2009, A. Joux (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag,vol. 5479, pp. 36–53, 2009.

V. Zikas, S. Hauser, and U. Maurer, Realistic failures in secure multi-party computation, Theory ofCryptography – TCC 2009, O. Reingold (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5444, pp. 274–293, 2009.

R. Konig, U. Maurer, and S. Tessaro, Abstract storage devices, Proc. of SOFSEM 2009, M. Nielsen (ed.),Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5404, pp. 341–352, 2009.

U. Maurer, Random systems: Theory and applications, ICITS 2007, Y. Desmedt (ed.), Lecture Notesin Computer Science, Berlin: Springer-Verlag, vol. 4883, pp. 44–45, 2009.

M. Hirt, U. Maurer and V. Zikas, MPC vs. SFE: Unconditional and computational security. Advancesin Cryptology – Asiacrypt 2008, J. Pieprzyk (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 5350, pp. 1–18, 2008.

3

U. Maurer and S. Tessaro, Basing PRFs on constant-query weak PRFs: Minimizing assumptions forefficient symmetric cryptography. Advances in Cryptology – Asiacrypt 2008, J. Pieprzyk (ed.), LectureNotes in Computer Science, Berlin: Springer-Verlag, vol. 5350, pp. 161–178, 2008.

U. Maurer, Rethinking digital signatures. Proc. of SECRYPT 2008, INSTICC, pp. IS-31-IS33, 2008(invited).

Z. Beerliova-Trubiniova, M. Fitzi, M. Hirt, U. Maurer, and V. Zikas, MPC vs. SFE: Perfect securityin a unified corruption model. Theory of Cryptography – TCC 2008, R. Canetti (Ed.), Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 4948, pp. 231–250, 2008.

U. Maurer and D. Raub, Black-box extension fields. Advances in Cryptology – ASIACRYPT 2007, K.Kurosawa (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 4833, pp. 427–443,2007.

U.Maurer and S. Tessaro, Domain extension of public random functions: Beyond the birthday barrier.Advances in Cryptology – CRYPTO 2007, A. Menezes (ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 4622, pp. 187–204, 2007.

U. Maurer, K. Pietrzak, and R. Renner, Indistinguishability amplification. Advances in Cryptology –CRYPTO 2007, A. Menezes (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.4622, pp. 187–204, 2007.

U. Maurer and J. Sjodin, A fast and key-efficient reduction of chosen-ciphertext to known-plaintextsecurity. Advances in Cryptology – EUROCRYPT 2007, M. Naor (ed.), Lecture Notes in ComputerScience, Berlin: Springer-Verlag, vol. 4515, pp. 498–516, 2007.

U. Maurer, Y. Oswald, K. Pietrzak, and J. Sjodin, Luby-Rackoff ciphers with weak round functions.Advances in Cryptology – EUROCRYPT 2006, S. Vaudenay (ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 4004, pp. 391–408, 2006.

U. Maurer, Abstract models of computation in cryptography. Cryptography and Coding 2005, LectureNotes in Computer Science, Berlin: Springer-Verlag, vol. 3796, pp. 1–12, 2005 (invited).

U. Maurer and J. Sjodin, Domain expansion of MACs: Alternative uses of the FIL-MAC. Cryptographyand Coding 2005, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.3796, pp. 168–185,2005.

R. Konig and U.Maurer, Generalized strong extractors and deterministic privacy amplification. Cryp-tography and Coding 2005, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.3796,pp. 322–339, 2005.

U. Maurer and J. Sjodin, Arbitrary-length MACs based on FIL-MACs, Proc. ICALP 2005, LectureNotes in Computer Science, Berlin: Springer-Verlag, vol.3580, pp. 482–484, 2005.

E. Bangerter, J. Camenisch, and U. Maurer, Efficient proofs of knowledge of discrete logarithms andrepresentations in groups with hidden order, Proc. 8th International Workshop on Practice and Theoryin Public-Key Cryptography (PKC 2005), S. Vaudenay (Ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 3386, pp. 154–171, 2005.

U. Maurer, Towards a theory of consistency primitives, Proc. of 18th Int. Symp. on Distributed Comput-ing (DISC ’04), R. Guerraoui (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.3274, pp. 379–389, 2004 (invited).

T. Holenstein, U. Maurer, and J. Sjodin, Complete classification of bilinear hard-core functions Ad-vances in Cryptology – CRYPTO ’04, M. Franklin (Ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 3152, pp. 73–91, 2004.

U. Maurer, The role of cryptography in database security, Proc. 2004 ACM SIGMOD InternationalConference on Management of Data, G Weikum, et al. (Eds.), pp. 5–11, 2004 (invited).

4

S. Dziembowsky andU.Maurer, On generating the initial key in the bounded storagemodel,Advancesin Cryptology – EUROCRYPT 2004, C. Cachin and J. Camenisch (Eds.), Lecture Notes in ComputerScience, Berlin: Springer-Verlag, vol. 3027, pp. 126–137, 2004.

U. Maurer, R. Renner and C. Holenstein, Indifferentiability and the random oracle methodology, The-ory of Cryptography – TCC 2004, M. Naor (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 2951, pp. 21–39, 2004.

U. Maurer and K. Pietrzak, Composition of random systems: Sometimes two weak make on strong,Theory of Cryptography – TCC 2004, M. Naor (Ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 2951, pp. 410–427, 2004.

U. Maurer, Intrinsic limitations of digital signatures and how to cope with them, Proceedings of 6th Int.Conf. on Information Security (ISC ’03), C. Boyd andW.Mao (eds.), Lecture Notes in Computer Science,Springer-Verlag, vol. 2851, pp. 180–192, 2003 (invited).

U. Maurer and K. Pietrzak, The security of many-round Luby-Rackoff pseudo-random permutations,Advances in Cryptology – EUROCRYPT 2003, E. Biham (Ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 2656, pp. 544–561, 2003.

U. Maurer, Secure multi-party computation made simple, Security in Communication Networks(SCN’02), G. Persiano (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 2576,pp. 14–28, 2003 (invited).

S. Fehr and U. Maurer, Linear VSS and distributed commitment schemes based on secret sharing andpairwise checks, Advances in Cryptology – CRYPTO ’02, M. Yung (Ed.), Lecture Notes in ComputerScience, Berlin: Springer-Verlag, vol. 2442, pp. 565–580, 2002.

S. Dziembowsky and U. Maurer, Tight security proofs for the bounded-storage model, Proceedings ofthe 34th ACM Symposium on Theory of Computing (STOC), pp. 341–350, 2002.

U. Maurer, Indistinguishability of random systems, Advances in Cryptology – EUROCRYPT 2002, L.Knudsen (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 2332, pp. 110–132,2002.

M. Fitzi, N. Gisin, U. Maurer, and O. von Rotz, Unconditional Byzantine agreement and multi-partycomputation secure against dishonest minorities from scratch, Advances in Cryptology – EUROCRYPT2002, L. Knudsen (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 2332, pp.482–501, 2002.

M. Hirt and U. Maurer, Robustness for free in unconditional multi-party computation, Advances inCryptology – CRYPTO ’01, J. Kilian (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag,vol. 2139, pp. 101–118, 2001.

M. Fitzi, J. Garay, U. Maurer, and R. Ostrovsky, Minimal complete primitives for secure multi-partycomputation,Advances in Cryptology – CRYPTO ’01, J. Kilian (Ed.), LectureNotes in Computer Science,Berlin: Springer-Verlag, vol. 2139, pp. 80–100, 2001.

M. Hirt, U. Maurer, and B. Przydatek, Efficient secure multi-party computation, Advances in Cryptol-ogy – ASIACRYPT 2000, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1976, pp.143–161, 2000.

R. Cramer, I. Damgard, and U. Maurer, General secure multi-party computation from any linear se-cret sharing scheme, Advances in Cryptology – EUROCRYPT 2000, B. Preneel (Ed.), Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 1807, pp. 316–334, 2000.

U. Maurer, and S. Wolf, Information-theoretic key agreement: From weak to strong secrecy for free,Advances in Cryptology – EUROCRYPT 2000, B. Preneel (Ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1807, pp. 351–368, 2000.

M. Fitzi and U. Maurer, From partial consistency to global broadcast, Proceedings of the 32nd ACMSymposium on Theory of Computing (STOC), Portland, Oregon, May 21–23, pp. 494–503, 2000.

5

R. Kohlas and U. Maurer, Confidence valuation in a public-key infrastructure based on uncertainevidence, Proc. Third International Workshop on Practice and Theory in Public-Key Cryptography (PKC2000), H. Imai and Y. Zheng (Eds.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.1751, pp. 93–112, 2000.

M. Fitzi, M. Hirt, and U. Maurer, General adversaries in unconditional multi-party computation,Advances in Cryptology – ASIACRYPT ’99, K.Y. Lam et al. (Eds.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1716, pp. 232–246, 1999.

B. Altmann, M. Fitzi, and U. Maurer, Byzantine agreement secure against general adversaries in adual failure model, Proc. of 13th Int. Symp. on Distributed Computing (DISC ’99), P. Jayanti (Ed.),Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1693, pp. 123–137, 1999.

U. Maurer, Information-theoretic cryptography, Advances in Cryptology – CRYPTO ’99, M. Wiener(Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1666, pp. 47–64, 1999 (in-vited).

R. Kohlas and U. Maurer, Reasoning about public-key certification: On bindings between entities andpublic keys, Proc. of Financial Cryptography ’99, M. Franklin (Ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1648, pp. 86–103, 1999.

M. Fitzi and U.Maurer, Efficient Byzantine agreement secure against general adversaries, Proc. of 12thInt. Symp. on Distributed Computing (DISC ’98), S. Kutten (Ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1499, pp. 134–148, 1998.

M. Fitzi, M. Hirt, andU.Maurer, Trading correctness for privacy in unconditional multi-party compu-tation. Advances in Cryptology – CRYPTO ’98, H. Krawczyk (Ed.), Lecture Notes in Computer Science,Berlin: Springer-Verlag, vol. 1462, pp. 121–136, 1998.

U. Maurer and S. Wolf, Lower bounds for generic algorithms in groups, Advances in Cryptology –EUROCRYPT ’98, K. Nyberg (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol.1403, pp. 72–84, 1998.

M. Hirt and U. Maurer, Complete characterization of adversaries tolerable in secure multi-party com-putation, Proc. of the 16st Annual ACM Symposium on Principles of Distributed Computing (PODC), ACMPress, New York, pp. 25–34, 1997.

C. Cachin and U. Maurer, Unconditional security against memory-bounded adversaries, Advancesin Cryptology – CRYPTO ’97, B. Kaliski (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1294 pp. 292–306, 1997.

U. Maurer and S.Wolf, Privacy amplification secure against active adversaries,Advances in Cryptology– CRYPTO ’97, B. Kaliski (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1294,pp. 307–321, 1997.

U. Maurer, Information-theoretically secure secret-key agreement by NOT authenticated public dis-cussion, Advances in Cryptology – EUROCRYPT ’97, W. Fumy (Ed.), Lecture Notes in Computer Sci-ence, Berlin: Springer-Verlag, vol. 1233, pp. 209–225, 1997.

U. Maurer, Modelling a public-key infrastructure, Proc. 1996 European Symposium on Research in Com-puter Security (ESORICS’ 96), E. Bertino (Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1146, pp. 325–350, 1996.

J. Camenisch, U. Maurer and M. Stadler, Digital payment systems with passive anonymity-revokingtrustees, Proc. 1996 European Symposium on Research in Computer Security (ESORICS’ 96), E. Bertino(Ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1146, pp. 33–43, 1996.

U. Maurer and S. Wolf, Towards characterizing when information-theoretic secret key agreement ispossible, Advances in Cryptology – ASIACRYPT ’96, K. Kim and T. Matsumoto (Eds.), Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 1163, pp. 145–158, 1996.

6

D. Bleichenbacher and U. Maurer, On the efficiency of one-time digital signatures, Advances in Cryp-tology – ASIACRYPT ’96, K. Kim and T. Matsumoto (Eds.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 1163, pp. 196–209, 1996.

U. Maurer and S. Wolf, Diffie-Hellman oracles, Advances in Cryptology – CRYPTO ’96, N. Koblitz (Ed.),Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1109, pp. 268–282, 1996.

D. Bleichenbacher and U. Maurer, Optimal tree-based one-time digital signature schemes, Proc. 13thSymp. on Theoretical Aspects of Computer Science (STACS’96), C. Puech and R. Reischuk (Eds.), LectureNotes in Computer Science, Berlin: Springer-Verlag, vol. 1046, pp. 363–374, 1996.

U. Maurer, A unified and generalized treatment of authentication theory, Proc. 13th Symp. on The-oretical Aspects of Computer Science (STACS’96), C. Puech and R. Reischuk (Eds.), Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 1046, pp. 387–398, 1996.

U. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discretelogarithms, Advances in Cryptology – CRYPTO ’94, Y. Desmedt (Ed.), Lecture Notes in Computer Sci-ence, Berlin: Springer-Verlag, vol. 839, pp. 271–281, 1994.

D. Bleichenbacher and U. Maurer, Directed acyclic graphs, one-way functions and digital signatures,Advances in Cryptology – CRYPTO ’94, Y. Desmedt (Ed.), Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 839, pp. 75–82, 1994.

C. Cachin and U. Maurer, Linking information reconciliation and privacy amplification, Advances inCryptology – EUROCRYPT ’94, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 950,pp. 266–274, 1995.

U. Maurer and P. E. Schmid, A calculus for secure channel establishment in open networks, Proc. 1994European Symposium on Research in Computer Security (ESORICS’ 94), D. Gollmann (Ed.), Lecture Notesin Computer Science, Berlin: Springer-Verlag, vol. 875, pp. 175–192, 1994.

U.Maurer, The role of information theory in cryptography, Codes and Cyphers, Cryptography and CodingIV, P.G. Farrell (ed.), The Institute of Mathematics and its Applications, Southend-on-Sea, England,pp. 49–71, 1995 (invited).

U. Maurer, Protocols for secret key agreement by public discussion based on common information,Advances in Cryptology – CRYPTO ’92, Lecture Notes in Computer Science, Berlin: Springer-Verlag,vol. 740, pp. 461–470, 1993.

U. Maurer, Factoring with an oracle, Advances in Cryptology – EUROCRYPT ’92, Lecture Notes inComputer Science, Berlin: Springer-Verlag, vol. 658, pp. 429–436, 1992.

U. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutationgenerators, Advances in Cryptology – EUROCRYPT ’92, Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 658, pp. 239–255, 1992.

U. Maurer and Y. Yacobi, A remark on a non-interactive public-key distribution system, Advances inCryptology – EUROCRYPT ’92, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 658,pp. 458–460, 1992.

U. Maurer, Some number-theoretic conjectures and their relation to the generation of cryptographicprimes, in Cryptography and Coding II, (C. Mitchell, Ed.), pp. 173–191, Oxford University Press, 1992.

U. Maurer, Perfect cryptographic security from partially independent channels, Proceedings of the 23rdACM Symposium on Theory of Computing (STOC), New Orleans, May 6–8, pp. 561–572, 1991.

K. Koyama, U. Maurer, T. Okamoto, and S.A. Vanstone, New public-key schemes based on ellipticcurves over Zn, Advances in Cryptology – CRYPTO ’91, Lecture Notes in Computer Science, Berlin:Springer-Verlag, vol. 576, pp. 252–266, 1992.

7

U.Maurer, New approaches to the design of self-synchronizing stream ciphers, Advances in Cryptology– EUROCRYPT ’91, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 547, pp. 458–471, 1991.

U. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology – EURO-CRYPT ’91, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 547, pp. 498–507, 1991.

U. Maurer, A universal statistical test for random bit generators, Advances in Cryptology – CRYPTO’90, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 537, pp. 409–420, 1991.

U.Maurer, A provably-secure strongly-randomized cipher,Advances in Cryptology – EUROCRYPT ’90,Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 473, pp. 361–373, 1991.

U. Maurer and J.L. Massey, Perfect local randomness in pseudo-random sequences, Advances in Cryp-tology – CRYPTO ’89, Lecture Notes in Computer Science, vol. 435, Berlin: Springer-Verlag, pp. 100–112, 1990.

U. Maurer, Fast generation of RSA-moduli with almost maximal diversity, Advances in Cryptology –EUROCRYPT ’89, Lecture Notes in Computer Science, vol. 434, Berlin: Springer-Verlag, pp. 636–647,1990.

J.L. Massey, U. Maurer, and M. Wang, Non-expanding, key-minimal, robustly-perfect, linear andbilinear ciphers, Advances in Cryptology – EUROCRYPT ’87, Lecture Notes in Computer Science, vol.304, Berlin: Springer-Verlag, pp. 237–247, 1988.

Refereed Conferences with Published Abstracts:

R. Konig, U. Maurer, and R. Renner, Privacy amplification secure against an enemy with selectableknowledge, Proc. 2004 IEEE Symposium on Information Theory (Abstracts), Chicago, p. 231, June 2004.

R. Konig andU.Maurer, Extracting randomness from generalized symbol-fixing andMarkov sources,Proc. 2004 IEEE Symposium on Information Theory (Abstracts), Chicago, p. 232, June 2004.

U. Maurer and R. Renner, Generalized indistinguishability, Proc. 2002 IEEE Symposium on InformationTheory (Abstracts), Lausanne, Switzerland, p. 295, July 2002.

R. Renner and U. Maurer, About the mutual (conditional) information, Proc. 2002 IEEE Symposium onInformation Theory (Abstracts), Lausanne, Switzerland, p. 364, July 2002.

U. Maurer, A calculus of conditional independence and its applications in cryptography, Proc. 2000IEEE Symposium on Information Theory (Abstracts), Sorrento, Italy, p. 243, July 2000.

U. Maurer, and S. Wolf, From weak to strong information-theoretic key agreement, Proc. 2000 IEEESymposium on Information Theory, Sorrento, Italy, p. 18, July 2000.

M. Fitzi and U. Maurer, Global broadcast by broadcasts among subsets of players, Proc. 2000 IEEESymposium on Information Theory, Sorrento, Italy, p. 267, July 2000.

U. Maurer and S. Wolf, Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms, in Proc.1998 IEEE Symposium on Information Theory, (Abstracts), p. 327, Cambridge, USA, Aug. 1998.

U. Maurer, Information theory and multi-party computation, Proc. 1998 IEEE Information TheoryWorkshop, Killarney, Ireland, June 22–26, 1998, IEEE Catalog no. 98EX131, pp. 152–153.

U. Maurer, Coding theory and multi-party computation, Proc. 1997 IEEE Information Theory Work-shop, Longyearbyen, Norway, July 6–12, 1997, p. 47 (Abstract).

U. Maurer and S. Wolf, The intrinsic conditional mutual information and perfect secrecy, Proc. 1997IEEE Symposium on Information Theory, (Abstracts), Ulm, Germany, June 29–July 4, 1997.

8

C. Cachin and U. Maurer, Smoothing probability distributions and smooth entropy, Proc. 1997 IEEESymposium on Information Theory, (Abstracts), Ulm, Germany, June 29–July 4, 1997.

U. Maurer, New information-theoretic bounds in authentication theory, Proc. 1995 IEEE InternationalSymposium on Information Theory (Abstracts), p. 12, Whistler, Canada, Sep. 17–22, 1995.

C.H. Bennett, G. Brassard, C. Crepeau, and U. Maurer, Generalized privacy amplification, Proc. 1994IEEE International Symposium on Information Theory (Abstracts), p. 350, Trondheim, Norway, June 27–July 1, 1994.

M.J. Gander and U. Maurer, On the secret-key rate of binary random variables, Proc. 1994 IEEEInternational Symposium on Information Theory (Abstracts), p. 351, Trondheim, Norway, June 27–July 1,1994.

U. Maurer, Secret key agreement by public discussion based on common information, IEEE Informa-tion Theory Workshop, Salvador, Brasil, June 21–26, 1992.

U. Maurer, A new information-theoretic notion of cipher security and a provably-secure randomizedcipher, Proceedings of the 1990 IEEE International Workshop on Information Theory, Veldhoven, TheNetherlands, June 10–15, p. 38, 1990.

U. Maurer and J.L. Massey, Cascade ciphers: the importance of being first, Proc. 1990 IEEE Interna-tional Symposium on Information Theory (Abstracts), p. 118, San Diego, CA, Jan. 14–19, 1990.

Patents:

U. Maurer, “Digital declaration”, pending.

U. Maurer, “Cryptographic system allowing encrypted communication between users with a securemutual cipher key determined without user interaction”, European patent, U.S. Patent no. 5,150,411.

U. Maurer, “Public-key cryptographic systems using elliptic curves over rings”, European patent,U.S. Patent no. 5,146,500.

U. Maurer, “A cryptographic system based on information difference”, European patent, U.S. Patentno. 5,161,244.

9

Olgica Milenkovic

ECE DepartmentU of Illinois, Urbana-ChampaignCoordinated Science Laboratory 126(217) 244 7358milenkov@uiuc.edu

EDUCATION

Ph.D. in Electrical Engineering: Systems, Communications, May 2002University of Michigan, Ann Arbor, MichiganMajor Area: Communications; Minor Area: Signal Processing

Dissertation: Combinatorial Problems in Analysis of Algorithms and Coding TheoryDissertation Advisor: Professor Kevin J. Compton.Relevant courses: Digital Communication and Channel Coding Theory, Source Coding, Prob-ability and Random Processes, Estimation, Filtering and Detection, Digital Signal Processing, In-formation Theory.

M.S. in Mathematics, Sep. 2001University of Michigan, Ann Arbor, Michigan

Relevant courses: Real and Functional Analysis, Fourier Theory, Convexity, Duality and Opti-mization problems, Probability and Measure Theory, Graph theory, Advanced Combinatorial The-ory, Abstract Algebra, Elementary and Analytic Number Theory.

M.S. in Electrical Engineering, Dec. 1997University of Nis, Nis, Yugoslavia

Dissertation: Multidimensional Modulation Codes for Magnetic and Optical RecordingDissertation Advisor: Professor Bane Vasic (Currently at the University of Arizona, Tuc-son)Relevant courses: Analog and Digital Communication Channels, Coding for Storage Devices,Satellite Antennas and Systems, Microwave Theory, Acoustical Devices.

B.S. in Electrical Engineering, April 1994University of Nis, Nis, Yugoslavia

Dissertation: Channel Capacity of a New Class of Modulation CodesDissertation Advisor: Professor Bane Vasic (Currently at the University of Arizona, Tuc-son)

2 Olgica Milenkovic

INDUSTRY EXPERIENCE

Consultant, Bell-Labs, Lucent Technologies, May 2005-May 2006.

Discrete Mathematics and Computer Science (DIMACS) Visitor, May 2005-July 2005.

ACADEMIC EXPERIENCE

August 2010 - current: Associate Professor, University of Illinois, Urbana-Champaign.

August 2007 - August 2010: Assistant Professor, University of Illinois, Urbana-Champaign.

August 2006 - August 2007: Visiting Professor, Center for Information Theory and Applications,University of California, San Diego.

January 2006: Reappointed as Assistant Professor, University of Colorado, Boulder.

August 2002 - January 2006: Assistant Professor, ECE Department, University of Colorado, Boul-der.

• TEACHING:Noise and Random Processes, Fall 2002Source Coding, Spring 2003Information Theory and Coding, Fall 2003Theory and Practice of Error-Control Coding, Spring 2004Telecommunications I, Fall 2004Source Coding, Spring 2005Information Theory for Molecular Biology, Fall 2005(Development of class sponsored by the 2004 Bernard M. Gordon Prize awarded to Dr. F.Barnes, University of Colorado, Boulder)Theory and Practice of Error-Control Coding, Spring 2006Error-Control Coding, Fall 2007, UIUCSpecial topics in Information Theory for Molecular Biology, Spring 2008Detection and Estimation Theory, Fall 2009Probability Theory, Spring 2009, 2011• RESEARCH IN PROGRESS:

� Information Theory and Coding for Genetics:∗ Applying low-rank completion techniques to prediction of protein-protein interac-

tions and for enzymatic fingerprinting (in collaboration with N. Price, Molecular Bi-ology Dept, UIUC).

∗ Developing novel signal processing paradigms for insertion/deletion error correc-tion for next generation PacBio DNA sequencing devices (in collaboration with ColdSpring Harbor Lab).

∗ Developing new group testing paradigms for compressed genotyping (in collabora-tion with Y. Erlich, Cold Spring Harbor Lab).

3 Olgica Milenkovic

∗ Developing a theoretical framework for analyzing protein mass spectrometry data(in collaboration with A. Orlitsky, UCSD).

∗ Applied compressed sensing principles to the design of DNA microarrays. Prob-lems addressed include: non-trivial extensions of the compressed sensing paradigm tonon-linear detectors and underlying optimization problems; integrating DNA probeselection criteria into universal compressed sensing algorithms; devising a VLSI im-plementation of all-electronic DNA readers and decompressors;

∗ Low-complexity reconstruction algorithms for linear and non-linear compressedsensing. Problems addressed include: using belief-propagation and superimposedcoding techniques for developing structured compressed sensing matrices and achiev-ing linear time decompression algorithms. “Polynomial” and “Quantized” Com-pressed Sensing.

∗ Extended the paradigm of constrained coding for the purpose of enumeratingRNA/DNA folds. Developed a new approach to constrained coding based on the useof context-free grammars and the Delest-Viennot-Schutzenberger method.

∗ Constructed constant-composition codes resilient to unwanted hybridization for ap-plications in DNA computing. Mathematically analyzed DNA codes with predefinedfolding characteristics and cross-hybridization properties.

∗ Generalized the notion of reversal distance. Applied sequential decoding algorithmsfor computing cost-constrained reversal distance.

∗ Analyzed networks of gene interactions within a coding theoretic (density-evolution)framework. Applied factor-graph ideas on the study of gene regulatory networks;

∗ Developed new methods for joint quality- and error-control coding for DNA mi-croarrays.

∗ Investigated mathematical models for the error-control mechanism in DNA replica-tion, transcription and translation.

∗ Developed novel framework for investigating self-similarity properties of DNAcoding and non-coding regions based on wavelet and integer-to-integer wavelettransforms.

� Low-density parity-check codes:∗ Analyzed the error-floor phenomena and the relevant combinatorial notions of trap-

ping sets and pseudocodewords. Constructed new belief-propagation algorithms thatcombine data-fusion principles with code-design criteria.

∗ Devised new permutation decoding strategies. Related permutation decoding to theproblem of computing the stopping redundancy hierarchy of codes.

∗ Developed novel combinatorial constructions for iteratively decodable binary andnon-binary codes for channels such as the magnetic and optical recording channel,fading channels based on urn models.

∗ Constructed a new class of low-complexity decoding algorithms for non-binarycodes based on matrix field representations.

∗ Investigated the use of matroid theory for specifying the properties of code poly-topes.

� Non-extensive Entropy Measures with Applications to Biology and Physics: Gener-alized and analyzed non-extensive entropy measures for novel application in source and

4 Olgica Milenkovic

channel coding, complexity theory and quantum information theory.

April 1997 - May 2002: Graduate Student Research Assistant/Teaching AssistantThe University of Michigan, Ann Arbor, Michigan

• TEACHING:TA for graduate level Probability and Stochastic Processes course (EECS501).• RESEARCH:� Error-correcting coding: Analyzed average time performance of the A* maximum like-lihood decoding algorithm for linear block codes; analysis included developing simpli-fied probabilistic models for the search procedure and estimating average storage and timecomplexity using the theory of order statistics;Developed new techniques for analyzing the algebraic structure of a certain class of linearblock codes; used this new approach to compute the generalized Hamming weight distri-butions of a number of formally self-dual code, and to demonstrate the relationships whichexist among different invariants of the codes.� Quadratic assignment problems: Analyzed optimal and suboptimal methods for storageof two-dimensional, user specified, graphs; research included applications of combinato-rial optimization algorithms (such as the quadratic assignment problem) and analyzingproperties of certain space filling curves.� Analysis of algorithms: Developed a new class of probabilistic transforms for analyzingalgorithms in computer algebra;� Cryptography: Worked on analyzing a class of algorithms for solving the discrete log-arithm problem; mathematical tools used for approaching the problem included algebra(theory of finite fields), combinatorics and number theory.

September 1994 - April 1997: Teaching and Research AssistantUniversity of Nis, Serbia, Yugoslavia

• TEACHING:TA for undergraduate classes Basics of Electrical Engineering, Information Theory and Dig-ital Communications.• RESEARCH:� Coding for communication channels: Designed theoretical model for scramblers for un-equiprobable signaling, using various source compression algorithms;� Coding for special classes of multi-layer and multilevel optical and magnetic record-ing channels: Developed codes for the Electron Trapping Optical Memory (ETOM) systemsand multi-layer partial response communication channels; participated in the developmentof new methods for spectral analysis of multi-track codes, as well as methods for analyzingthe performance of the codes.

AWARDS

ISIT 2010 Best Student Paper Award.

DARPA Young Faculty Award, 2007.

NSF Career Awards, 2007.

5 Olgica Milenkovic

Honorable mentioning, Fifth International Workshop on Computational Systems Biology, WCSB2008, June 11-13, 2008 Leipzig, Germany (ranked third best paper of the conference).

Honorable mentioning, ICC Best Paper Awards, Istanbul, 2006.

Rackham Pre-Doctoral Fellowship, The University of Michigan, 2001-2002.

Fellowship of the Serbian Ministry of Science and Technology, Yugoslavia, 1994-1996.

Award for Best Graduation Thesis in Electrical Engineering at the University of Nis, Yugoslavia,1994.

Award for advanced graduation with outstanding academic performance, University of Nis, Yu-goslavia 1994.

Award for outstanding academic performance in 1991,1992,1993, University of Nis, Yugoslavia.

STUDENTS

– POST-DOC STUDENTS∗ Wei Dai, UIUC, from 2007-2010. Now with Imperial College, London.∗ Vitaly Skachek, UIUC, from 2011-2013.

– Ph.D. STUDENTS∗ Thorsten Hehn, (jointly advised by J. Huber, University of Erlangen).

Graduated: May 28th, 2009.Advising period: 2004-2009.Thesis title: Optimized Belief-Propagation Decoding for Low-Delay Applications inDigital Communications.Current employment: VolksWagen, Germany.

∗ Stefan Laendner, (jointly advised by J. Huber, University of Erlangen).Graduated: December 23rd, 2010.Advising period: 2003-2010. Thesis title: Investigation and Improvement of the ErrorFloor Behavior of LDPC Codes for the AWGN Channel Current employment: Frauern-hoffer Institute, Germany.

∗ Farzad Hassanzadeh (Farnaud).Expected graduation: August, 2011.Advising period: 2008-current.

∗ Amin Emad.Expected graduation: August, 2013.Advising period: 2010-current.

– MS STUDENTS∗ Vidya Kumar, M.S. Student (2003-2006)∗ David Leyba, M.S. Student (2004-2005)∗ Vijay Nagarajan, M.S. Student, Jointly Advised with Y. Liu (2002-2004)∗ Vin Pham Hoa, M.S. Student (2008-2010)

– STUDENT COLLABORATORS∗ Mona Sheikh, Visiting Ph.D. Student, Rice University.∗ Janis Dingel, Visiting Ph.D. Student, Technisches Universitat Munchen.

6 Olgica Milenkovic

BOOK CHAPTERS

1. B. Vasic, E. Kurtas, A. Kuznetsov and O. Milenkovic, Structured LDPC codes, CRC Coding and SignalProcessing for Magnetic Recording, CRC Press, Eds. B. Vasic and E. Kurtas, Chapter 38, pp. 1-21, 2004.

2. B. Vasic and O. Milenkovic, Detection for Multitrack Systems, CRC Coding and Signal Processing forMagnetic Recording, CRC Press, Eds. B. Vasic and E. Kurtas, Chapter 24, pp. 1-9, 2004.

3. O. Milenkovic, The Three Faces of DNA/RNA Sequence Hybridization, Systems Bioinformatics: An En-gineering Case-Based Approach, pp. 285-313, Editors G. Alterovitz and M. Ramoni, Artech House,2007.

4. O. Milenkovic, Data Processing and Storage in Cells: An Information-Theoretic Approach, in Advancesin Information Recording, Editors P. Siegel, E. Soljanin, A. van Wijngaarden, and B. Vasic, DIMACSSeries in Discrete Mathematics and Theoretical Computer Science, vol. 73, pp. 105-147, 2008.

JOURNAL PAPERS (SUBMITTED/IN PREPARATION)

1. W. Dai, E. Kerman, and O. Milenkovic, ”A Geometric Approach to Low-Rank Matrix Completion,”CoRR arXiv:1006.2086v1, In revision, IEEE Transactions on Information Theory, June 2010.

2. W. Dai, O. Milenkovic, and H. V. Pham, “Sublinear Compressive Sensing via Dense Belief Propaga-tion,” IEEE Transactions on Signal Processing, submitted, 2010.

3. F. Farnoud and O. Milenkovic, ”Sorting of Permutations by Cost-Constrained Transpositions,”CoRR arXiv:1007.4236, In revision, IEEE Transactions on Information Theory, July 2010.

JOURNAL PAPERS (ACCEPTED AND PUBLISHED)

All journal papers listed below were peer reviewed.

1. W. Dai, O. Milenkovic, and E. Kerman, ”Subspace Evolution and Transfer (SET) for Low-RankMatrix Completion,” CoRR arXiv:1006.2195v1, IEEE Transactions on Signal Processing, accepted, 2011.

2. W. Dai and O. Milenkovic, “A Comparative Study of Quantized Compressive Sensing Schemes,”CoRR abs/0901.0749, to appear, IEEE Trans. on Communications, 2011.

3. N. Alic, M. Karlsson, M. Skoeld, O. Milenkovic, P. A. Andrekson, and S. Radic, ”Joint Statisticsand MLSD in Filtered Incoherent High-Speed Fiber Optic Communications,” IEEE - OSA Journal onLightwave Technology, vol. 28, Issue 10, pp. 1564-1572, 2010.

4. A. McGregor and O. Milenkovic, “On the Hardness of Approximating Stopping and TrappingSets,” IEEE Trans. on Information Theory, vol. 56, no. 4, pp. 1640 - 1650, April 2010.

5. T. Hehn, J. Huber, O. Milenkovic, and S. Laendner, “Multiple-bases belief-propagation decoding ofhigh-density cyclic codes,” IEEE Trans. on Comm., vol. 58 , no. 1, pp. 1-8, January 2010.

6. J. Dingel and O. Milenkovic, “List-decoding Methods for Inferring Polynomials in Finite DynamicalGene Network Models,” Bioinformatics, doi: 10.1093/bioinformatics/btp281, 2009.

7. W. Dai and O. Milenkovic, “Weighted Superimposed Codes and Constrained Integer CompressedSensing,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2215-2230, May 2009.

7 Olgica Milenkovic

8. W. Dai and O. Milenkovic, “Subspace Pursuit for Compressive Sensing Signal Reconstruction,”IEEE Transaction on Information Theory, vol. 55, no. 5, pp. 2230-2250, May 2009.

9. W. Dai, M. Sheikh, O. Milenkovic, and R. Baraniuk, “Compressed Sensing DNA Microarrays,”EURASIP Journal on Bioinformatics and Systems Biology, Article ID 162824, 12 pages doi:10.1155/2009/162824,2009.

10. S. Laendner, T. Hehn, O. Milenkovic, and J. Huber, “The Trapping Redundancy of Linear BlockCodes”, IEEE Transaction on Information Theory, vol. 55, no. 1, pp. 53-63, January 2009.

11. T. Hehn, O. Milenkovic, S. Laendner, and J. Huber, “Permutation Decoding and the Stopping Re-dundancy Hierarchy of Cyclic and Extended Cyclic Codes,” IEEE Transaction on Information Theory,vol. 54, no. 12, pp. 5308-5331, December 2008.

12. O. Milenkovic, E. Soljanin, and P. Whiting, “On the Asymptotic Spectrum of Trapping Sets in Ran-dom, Regular and Irregular Code Ensembles,” IEEE Transaction on InformationTheory, Vol. 53, No. 1,pp. 39-55, January 2007.

13. S. Laendner and O. Milenkovic, “Codes Based on Latin Squares: Stopping Set, Trapping Set, andCycle-Length Distribution Analysis,” IEEE Transaction on Communications, Vol. 55, No. 2, pp. 303-312, February 2007.

14. V. Nagarajan, S. Laendner, O. Milenkovic, N. Jayakumar, and S. Khatri, “High-Throughput VLSIImplementations of Iterative Decoders and Related Code Construction Problems,” The Journal ofVLSI Signal Processing, Vol. 49, No. 1, pp. 185-206, May 2007.

15. O. Milenkovic, N. Kashyap, and D. Leyba, “Shortened Array Codes of Large Girth,” IEEE Transac-tions on Information Theory, Vol. 5, No. 8, pp. 3707-3722, August 2006.

16. O. Milenkovic and N. Kashyap, “On the Design of Codes for DNA Computing,” Lecture Notes inComputer Science 3969, pp. 100-119, Springer Verlag, Berlin-Heidelberg, 2006.

17. V. Kumar and O. Milenkovic, “Unequal Error Protection LDPC Codes based on Plotkin-Type Con-structions,” IEEE Transactions on Communications, Vol. 54, No. 6, pp. 994-1005, June 2006.

18. O. Milenkovic and K. Compton, “Average Case Analysis of Gosper’s Algorithm,” Algorithmica, Vol.43, No. 3, pp. 211-244, September 2005.

19. V. Kumar and O. Milenkovic, “On Graphical Representations of Algebraic Codes Suitable for Iter-ative Decoding,” IEEE Communications Letters, Vol. 9, No. 8, pp. 729-731, August 2005.

20. I. Djordjevic, O. Milenkovic, and B. Vasic, “Generalized LDPC Codes for Long-Haul Optical Com-munication Systems,” IEEE Journal of Lightwave Technology, Vol. 23, No. 5, pp. 1939-1946, May 2005.

21. O. Milenkovic, “Higher Weight and Coset Weight Enumerators of Formally Self Dual Codes,” De-signs, Codes and Cryptography, Vol. 35, No.1, pp. 89-101, April 2005.

22. O. Milenkovic, I. Djordjevic, and B. Vasic, “Block-Circulant Low-Density Parity-Check Codes forOptical Communication Systems,” IEEE Journal of Selected Topics in Quantum Electronics, Vol. 10, No.2, pp. 294-299, April 2004.

23. B. Vasic, O. Milenkovic, “Combinatorial Constructions of Low-Density Parity-Check Codes for It-erative Decoding,” IEEE Transactions on Information Theory, Vol. 50, No. 6, pp 1156-1176, June 2004.

8 Olgica Milenkovic

24. O. Milenkovic, K. Compton, “Probabilistic Transforms for Combinatorial Urn Models,” Combina-torics, Probability and Computing, pp. 645-675, Vol. 13, No. 4-5, July-September 2004.

25. O. Milenkovic, S. Coffey, K. Compton, “The Third Support Weight Enumerators of the [32,16,8]Doubly-Even, Self-Dual Codes,” IEEE Transactions on Information Theory, Vol. 49, No. 3, pp. 740-747,March 2003.

26. O. Milenkovic, B. Vasic, “Permutation (d,k) Codes: Efficient Enumerative Coding and PhraseLength Distribution Shaping”, IEEE Transactions on Information Theory, Vol. 46, No. 7, pp. 2671-2675, Nov. 2000.

27. B. Vasic, S. McLaughlin, O. Milenkovic, “Shannon Capacity of M-ary Redundant Multitrack Run-length Limited Codes”, IEEE Transactions on Information Theory, Vol. 44, No. 2, pp. 766-774, March1998.

28. B. Vasic, O. Milenkovic, S. McLaughlin, “Power Spectral Density of Multitrack (0,G/I) codes,” IEEElectronics Letters, Vol. 33, No. 9, pp. 784-786, April 1997.

29. B. Vasic, O. Milenkovic, S. McLaughlin, “Scrambling for Unequiprobable Signaling,” IEE ElectronicsLetters, Vol. 32, No. 17, pp. 1551-1552, Aug. 1996.

CONFERENCE PAPERS

Peer reviewed conference papers (only international conferences are listed. List of papers presentedat local conferences available upon request). Papers arranged by area.

Compressive Sampling (9 papers)

W. Dai, D. Sejdinovic, and bf O. Milenkovic, “Compressive Sensing for Gaussian Dynamic Signals,”accepted for presentation at SPARS 2011, Edinburgh, Scotland, 2011.

W. Dai and bf O. Milenkovic, “Algorithmic Solutions for Quantized Compressive Sensing,” Pro-ceedings of SampTA 2011, Singapore, 2011.

W. Dai, D. Sejdinovic and bf O. Milenkovic, “Gaussian Dynamic Compressive Sensing,” Proceedingsof SampTA 2011, Singapore, 2011.

V.P. Hoa, W. Dai, and bf O. Milenkovic, “Compressive List-Support Recovery for Colluder Identifi-cation”, Proceedings of ICASSP, Texas, 2010.

W. Dai, H. Vin Pham, and O. Milenkovic, ”Distortion-Rate Functions for Compressive Sensing,”Proceedings of the ISIT’2009, Seul, Korea, 2009.

H. V. Pham, W. Dai, and O. Milenkovic, ”Sublinear Complexity Reconstruction Compressive Sens-ing via Belief Propagation,” Proceedings of the ISIT’2009, Seul, Korea, 2009.

W. Dai, H. Pham, O. Milenkovic, Distortion-Rate Functions for Quantized Compressive Sensing,Proceedings of the ITW’2009, Volos, Greece, 2009.

W. Dai and O. Milenkovic, “Sparse Weighted Euclidean Superimposed Coding for Integer Com-pressed Sensing” Proceedings of the CISS, Princeton, 2008.

9 Olgica Milenkovic

W. Dai and O. Milenkovic, “Weighted Euclidean Superimposed Codes for Integer CompressedSensing,” accepted for presentation at ITW’08, Porto, Portugal, 2008.

Low-Rank Matrix Completion (2 papers)

W. Dai and O. Milenkovic, “SET - an algorithm for consistent matrix completion,” Proceedings ofthe ICASSP 2010, Dallas, TX, http://arxiv.org/abs/0909.2705.

W. Dai, E. Kerman and O. Milenkovic, ’Low-Rank Matrix Completion with Geometric PerformanceGuarantees,” accepted for presentation at ICASSP’2011, Prague, Czech Republic, 2011.

Information and Coding Theory in Bioinformatics (14 papers)

A. Emad, W. Dai and O. Milenkovic, “Protein-Protein Interaction Prediction using Non-Linear Ma-trix Completion Methods, to be presented at RECOMB2011, Vancouver, Canada, March 2011.

W. Dai, O. Milenkovic, and Prasad Santhanam, ”Inferring Protein-Protein Interactions via Low-Rank Matrix Completion,” Proceedings of the ICNAAM, International Conference on Numerical Analysisand Applied Mathematics, Rhodes, Greece, September 2010.

J. Dingel, and O. Milenkovic, “Inferring Algebraic Gene Networks using Local-Decoding ,”Proceed-ings of the BIBE’08 Workshop on Systems Biology and Medicine, Philadelphia, November 2008.

W. Dai, M. Sheikh, O. Milenkovic, and R. Baraniuk, “New Probe Design Algorithms for Compres-sive Sensing DNA Microarrays,” Proceedings of the IEEE Conference on Bioinformatics and Biomedicine,BIBM, 2008.

J. Dingel and O. Milenkovic, “A List-Decoding Approach for Inferring the Dynamics of Gene Reg-ulatory Networks,” Proceedings of the International Symposium on Information Theory, ISIT’08,Toronto, Canada, 2008.

M. Sheikh, S. Sarvotham, Olgica Milenkovic, and R. Baraniuk, “DNA array decoding from non-linear measurements by belief propagation,” Proceedings of the IEEE Workshop on Statistical SignalProcessing (SSP), Madison, Wisconsin, August 2007.

D. Huang and O. Milenkovic, “Superimposed coding for iterative detection of DNA microarrayspot failures,” Proceedings of the IEEE Genetic Signal Processing and Statistics (GENSIPS) conference,2008.

J. Dingel and O. Milenkovic, “Decoding the dynamics of gene regulatory networks under a dynam-ics model,” Proceedings of the Fifth International Workshop on Computational Systems Biology, Leipzig,Germany, 2008 (voted one of top three papers at the conference).

O. Milenkovic, “Constrained Coding via Context-Free Grammars with Applications to RNA Se-quence Analysis,” Proceedings of the ISIT’2007.

O. Milenkovic and N. Kashyap, “Construction of DNA Codes which Avoid Secondary Structures,”Proceedings of the IEEE International Symposium on Information Theory 2005 (5 pages), Adelaide, Aus-tralia, September 2005.

10 Olgica Milenkovic

O. Milenkovic, N. Kashyap, and B. Vasic, “Coding for DNA Computers Controlling Gene Expres-sion Levels,” Invited paper, IEEE Conference on Decision and Control, CDC’2005, (6 pages) Seville, Spain,December 2005.

S. Chilappagari, O. Milenkovic, and B. Vasic, “Compression of DNA Sequences using Fractal Gram-mars and Integer Wavelet Transforms,” Proceedings of the Genetic Signal Processing Symposium (GEN-SIPS), (2 pages) Rhode Island.

O. Milenkovic and N. Kashyap, “Constructions of Codes for DNA Computing,” Proceedings of theWorkshop on Coding and Cryptography, WCC’05, pp. 204-214, Bergen, Norway, March 2005.

O. Milenkovic and B. Vasic, “Information Theory Problems in Genetics,” Proceedings of the IEEE In-formation Theory Workshop, ITW’2004, pp. 60-64, San Antonio, October 2004.

LDPC Codes and Iterative Decoding (18 papers)

S. Laendner, O. Milenkovic, and J. Huber, “Characterization of Small Trapping Sets in LDPC Codesfrom Steiner Triple Systems,” Proceedings of the 6th International Symposium on Turbo Codes andIterative Information Processing, Brest, France, September 2010.

T. Hehn, S. Laendner, O. Milenkovic, and J. Huber, ”Dense Error Correction via AutomorphismGroup Decoding,” HDD Workshop, Tel Aviv, February 2010.

W. Dai and O. Milenkovic, “Iterative Subspace Pursuit Decoding of Euclidean SuperimposedCodes,” Proceedings of the TURBO CODING 2008 Symposium, Lausanne, September 2008.

A. McGregor and O. Milenkovic, “On the Hardness of Approximating Stopping and TrappingSets,” Proceedings of the ITW’08, Lake Tahoe, 2007.

T. Hehn, S. Laendner, O. Milenkovic, and J. Huber, “The Stopping Redundancy Hierarchy of CyclicCodes”, presented at the 44th Allerton Conference 2006 (regular paper), September 2006.

S. Laendner, T. Hehn, O. Milenkovic, and J. Huber, “When Does one Parity-Check Equation Mat-ter?,” Proceedings of the Globecom 2006, San Fracisco, 2006.

O. Milenkovic, E. Soljanin, and P. Whiting, “Stopping and Trapping Sets in Generalized CoveringArrays,” Proceedings of the CISS’2006, March 2006.

O. Milenkovic, E. Soljanin, and P. Whiting, “Trapping Sets in Irregular LDPC Code Ensembles,”Proceedings of the ICC’2006, (6 pages), December 2005 (the paper received honorable mentioning asthe runner up for the best paper award).

O. Milenkovic, E. Soljanin and P. Whiting, “Asymptotic Distributions of Combinatorial Config-urations in Random Regular LDPC Code Ensembles,” presented at the 43rd Allerton Conference onCommunications, Control and Computing (long paper), September-October 2005.

S. Laendner and O. Milenkovic, “Algorithmic and Combinatorial Analysis of Trapping Sets inStructured LDPC Codes,” Proceedings of the 2005 International Conference on Wireless Networks, Com-munications and Mobile Computing, WirelessCom 2005, (6 pages) Maui, Hawaii, June 2005.

V. Kumar and O. Milenkovic, “On Representations of Algebraic Codes Suitable for Iterative De-coding,” Proceedings of the 39th Conference on Information Sciences and Systems, CISS’2005, pp. 41,Baltimore, March 2005.

11 Olgica Milenkovic

I. B. Djordjevic, O. Milenkovic, and B. Vasic, “Generalized Low-Density Parity-Check Codes forLong-Haul High-Speed Optical Communication,” Proceedings of the Optical Fiber Communication Con-ference and Exposition and The National Fiber Optic Engineers Conference, OFC’2005, OThW6, (2 pages),Washington D.C., March 2005.

V. Kumar and O. Milenkovic, “Unequal Error Protection LDPC Codes Based on Plotkin-Type Con-structions,” Proceedings of the IEEE Global Telecommunications Conference, Globecom 2004, CT15-2, pp.493-497, Dallas, Texas, December 2004.

D. Leyba, O. Milenkovic, D. Bennet, and N. Kashyap, “New Partition Regular Sequences and Gen-eralized Array Codes of Large Girth,” Proceedings of the 42nd Annual Conference on Communications,Control and Computing, pp. 240-249, Allerton, IL, October 2004.

V. Kumar, O. Milenkovic, and B. Vasic, “Structured LDPC Codes over GF (2m) and Compan-ion Matrix Based Decoding,” Proceedings of the IEEE International Symposium on Information Theory,ISIT’2004, p. 226, Chicago, June-July 2004.

O. Milenkovic, V. Kumar, and B. Vasic, “Companion Matrix Based Decoding” presented at IEEECTW’2004, Capri (no Proceedings published).

O. Milenkovic and S. Laendner, “Analysis of the Cycle Structure of LDPC Codes Based on LatinSquares,” Proceedings of the IEEE International Conference on Communications ICC’2004, CT15-5, pp.777-781, Paris, France, June 2004.

O. Milenkovic, K. Prakash, and B. Vasic, “Regular and Irregular LDPC Codes Based on Cycle-Invariant Difference Sets,” Proceedings of the 41st Annual Allerton Conference on Communication, Con-trol and Computing, pp. 1700-1701, October 2003.

Algebraic Error-Control Coding (9 papers)

F. Farnoud and O. Milenkovic, ”Polarization coding for parallel channels,” Information TheoryWorkshop, ITA 2011, San Diego, CA.

W. Dai and O. Milenkovic, “Weighted `1 Superimposed Codes,” accepted for presentation, CodingTheory Days in Saint Petersburg, October 2008.

C. Lott, O. Milenkovic, and E. Soljanin, “Hybrid ARQ: theory, state of the art and future directions,”Proceedings of the ITW’07, Bergen, Norway, 2007.

T. Hehn, O. Milenkovic, S. Laendner, and J. Huber, “Iterative Permutation Decoding and the Stop-ping Redundancy Hierarchy of Codes,” Proceedings of the ISIT, Nice, France, 2007.

T. Hehn, S. Laendner, J. Huber, and O. Milenkovic, “Multiple Bases Decoding of Algebraic Codes,”Proceedings of the ISIT, Nice, France, 2007.

V. Kumar and O. Milenkovic, “Improved Distance Bounds for Recursive Decoding of Reed-MullerCodes,” Proceedings of the Eighth International IEEE Symposium on Communication Theory and Applica-tions 2005, pp. 326-331, St. Martin’s College, Ambleside, UK, July 2005.

O. Milenkovic and B. Vasic, “Asymptotic Analysis of A* Maximum Likelihood Decoding with Reli-ability Reordering,” Proceedings of the Information Theory Workshop, ITW’2003, pp. 316-319, Sorbone,Paris, April 2003.

12 Olgica Milenkovic

O. Milenkovic and K. Compton, “A Method for Reducing the Number of Unknown Coefficients ofGeneralized Hamming Weight Enumerators,” Proceedings of the 2002 IEEE International Symposiumon Information Theory, p. 234, Lauzanne, Switzerland, July 2002.

O. Milenkovic, “On the Generalized Hamming Weight Enumerators and Coset Weight Distribu-tions of Even, Isodual Codes ,” Proceedings of the 2001 IEEE International Symposium on InformationTheory, p. 62, Washington D.C., USA, June 2001.

Constrained Coding (5 papers)

O. Milenkovic and B. Vasic “Power spectral density of multitrack (O,G/I) codes,” Proceedings of theIEEE Information Theory Symposium, Ulm, Germany, p. 142, July 1997.

B. Vasic and O. Milenkovic, “Cyclic Two-dimensional IT Reducing Codes,” Proceedings of the IEEEInformation Theory Symposium, Ulm, Germany, p. 414, July 1997.

S. McLaughlin, O. Milenkovic, and B. Vasic, “Channel Capacity of M-ary Multitrack RunlengthLimited Channels ,” Proceedings of the IEEE Information Theory Symposium, Ulm, Germany, p. 139,July 1997.

O. Milenkovic, B. Vasic, and S. Denic, “Novel M-ary (d,k) Codes,” accepted for publication in theProceedings of the Canadian Workshop on Information Theory, Toronto, Canada, June 1997.

B.Vasic, O. Milenkovic, D.Vasic, “Channel Capacities and Spectra of Maxentropic (O,G/I) Matched-Spectral-Null Sequences,” Proceedings of the IEEE IT Workshop, (1 page) Rydzyna, Poland, 1995.

Information Theory (4 papers)

F. Farnaoud, O. Milenkovic, and P. N. Santhanam, ”Small-Sample Distribution Estimation in thePresence of Sticky Channel Errors,” Proceedings of the ISIT’2009, Seul, Korea.

S. Denic, C. Charalambous, S. Djouadi, and O. Milenkovic, “Capacity of MIMO Gaussian Chan-nels with H∞ Normed Channel Uncertainties,” Proceedings of the Canadian Workshop on InformationTheory, pp. 315-318, Montreal, Canada, 2005.

O. Milenkovic and S. Denic, “Characterization of Generalized Tsallis Entropies,” Proceedings of theCanadian Workshop on Information Theory, pp. 20-23, Montreal, Canada 2005.

V. Nagarajan and O. Milenkovic, “Structured LDPC Codes over Polya Urn Model Channels,” Pro-ceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, IEEE CCECE’2004,V1-0541, pp. 543-546, Niagara Falls, May 2004.

Theoretical Computer Science (4 papers)

F. Farnaoud and O. Milenkovic, “Sorting of Permutations by Cost-Constrained Transpositions,”accepted for presentation at ISIT’2011, Saint Petersburg, Russia.

13 Olgica Milenkovic

F. Farnoud, C-Y. Chen, O. Milenkovic, Navin Kashyap, “A graphical model for computing the min-imum cost transposition distance,” Proceedings of the ITW 2010 (Information Theory Workshop),Dublin 2010.

J. Acharya, Hirakendu Das, O. Milenkovic, Alon Orlitsky, and Shengjun Pan, ”On Reconstructinga Sequence from its Subsequence Compositions,” Proceedings of the ISIT’2010, Austin, Texas, 2010(Best Student Paper Award).

O. Milenkovic, “Analysis of Combinatorial Bin Models with Application in Coding Theory,” Pro-ceedings of the IEEE International Symposium on Information Theory, ISIT’2004, p. 273, Chicago, June-July 2004.

VLSI Implementations of Signal Processing Algorithms (1 paper)

V. Nagarajan, N. Jayakumar, S. Khatri and O. Milenkovic, “High Throughput VLSI Implementa-tions of Iterative Decoders and Related Code Construction Problems,” Proceedings of the IEEE GlobalTelecommunications Conference, Globecom 2004, CT11-8 (5 pages), Dallas, Texas, December 2004.

Invited Conference Papers:

F. Farnoud and O. Milenkovic,“Polarization Coding for Parallel Channels,” ITA Workshop, SanDiego, February 2011.

J. Acharya, H. Das, O. Milenkovic, A. Orlitsky, and S. Pan,“Reconstructing Sequences from Traces,”Algebraic Geometry with a view towards applications Workshop (Solving Polynomial Equations),the Mittag-Leffler Institute, Stockholm, February 2011.

O. Milenkovic, Search Methodologies Workshop, Bielefeld Center for Interdisciplinary Research,October 2010.

F. Farnoud, Olgica Milenkovic, and Navin Kashyap, “A Graphical Model for Computing the Mini-mum Cost Transposition Distance,” Proceedings of the ITW 2010, Dublin, Ireland, September 2010.

3. V. P. Hoa, W. Dai, and O. Milenkovic, Performance bounds of list colluder identification algorithmsvia compressive sensing, ITA Workshop, San Diego, 2010.

4. W. Dai and O. Milenkovic, Consistent matrix completion and optimization on manifolds, ITA Work-shop, San Diego, 2010.

5. O. Milenkovic, Approximate inference in presence of experimental errors, Workshop on GenomicError Correction, Cergy-Pontoise, France, 2009.

6. O. Milenkovic, Compressive Sensing in Neuroscience and Molecular Biology, Engineering Principlesin Biological Systems, Welcome Trust Conference Center, Hinxton, Cambridge, UK, October 2009.

7. O. Milenkovic, Information-Theoretic Methods for Reverse Engineering of the Topology and Dy-namics of Gene Regulatory Networks, Algebraic Methods in Systems Biology and Statistics TransitionWorkshop, Statistical and Applied Mathematical Sciences Institute (SAMSI), Duke University, NC2009.

14 Olgica Milenkovic

8. O. Milenkovic, TBA, Permanents and Modeling Probability Distributions, American Institute of Math-ematics (AIM), Palo Alto, CA September 2009.

9. O. Milenkovic, Sub-linear compressive sensing and support weight enumerators of codes: a ma-troid theory approach, Applications of Matroid Theory and Combinatorial Optimization to Informationand Coding Theory Workshop, Banff International Research Station for Mathematical Innovation andDiscovery (BIRS), August 2009.

10. O. Milenkovic, Iterative algorithms for low-rank matrix completion, Dagstuhl Workshop on SearchMethodologies, July 2009, Germany.

11. N. P. Santhanam, J. Dingel, and O. Milenkovic, Information Theoretic Modeling of Gene Interaction,ITW’2009, Volos, Greece.

12. O. Milenkovic, “Information-Theoretic Methods for Reverse Engineering of Gene Regulatory Net-works,” (Tutorial), GENSIPS’2009, May 2009.

13. W. Dai and O. Milenkovic, Weighted Superimposed Codes and Constrained Integer CompressedSensing, DIMACS/DyDAn Workshop on Streaming, Coding, and Compressive Sensing: UnifyingTheory and Common Applications to Sparse Signal/Data Analysis and Processing, March 2009.

14. F. Farnoud, O. Milenkovic, N. P. Santhanam, “Unraveling Sticky Channels,” ITA Workshop, 2009San Diego, CA February, 2009.

15. W. Dai, V. Pham Hoa, and O. Milenkovic, “Sub-linear Compressive Sensing Reconstruction via ListBelief-Propagation Decoding,” ITA Workshop, 2009 San Diego, CA February 2009.

16. W. Dai, H. Vinh Pham, and O. Milenkovic, “Distortion-Rate Functions for Quantized CompressiveSensing,” ITA Workshop, 2009 San Diego, CA February 2009.

17. H. Das, O. Milenkovic, and A. Orlitsky, “Order from Disorder,” ITA Workshop Open Problem Ses-sion, 2009 San Diego, CA, February 2009.

18. O. Milenkovic, ”Sparse Information Processing in Life Sciences,” Beyond Shannon’s InformationTheory Workshop Venice, Italy December 2008.

19. W. Dai and O. Milenkovic, “Low Complexity Comressive Sensing Reconstruction Algorithms,”Special Session “Algorithmic Probability and Combinatorics,” American Mathematical Society(AMS) Meeting, October 4-5, Vancouver, Canada.

20. O. Milenkovic, “Group Testing for DNA Microarray Designs,” Schloss Dagstuhl Seminar on GroupTesting in the Life Sciences, July 2008.

21. J. Dingel, O. Milenkovic, and A. Ashikhmin, “List Decoding of Reed-Muller Codes with Applica-tions in Bioinformatics,” Mathematical Theory of Networks and Systems, July 2008.

22. J. Dingel and O. Milenkovic, ”Reverse Engineering of Gene Regulatory Networks via Iterative ListDecoding,” Proceedings of the ITW’08, Porto, Portugal, 2008.

23. W. Dai, N. Kiyavash, and O. Milenkovic, “Spherical Codes for Sparse Digital Fingerprinting,”Spring Central Meeting of the American Mathematical Society, AMS’08, Special Session on AlgebraicAspects of Coding Theory, Bloomington, IN, April 2008.

15 Olgica Milenkovic

24. W. Dai and O. Milenkovic, “Constrained Compressed Sensing via Superimposed Coding,” pre-sented at the Third Information Theory and Applications Workshop, ITA’08, San Diego, CA, 2008.

25. J. Dingel and O. Milenkovic, ”Reverse Engineering of Gene Regulatory Networks via Iterative ListDecoding,” presented at the Third Information Theory and Applications Worksho, ITA’08, San Diego,CA, 2008.

26. W. Dai and O. Milenkovic, “Coding-Theoretic Problems in Genetics: Superimposed Codes for Com-pressed Sensing DNA Microarrays,” Oberwolfach Workshop on Coding Theory, December 2007.

27. O. Milenkovic, E. Soljanin, and P. Whiting, “Asymptotic Enumeration of Trapping Sets in RandomTanner Graph Ensembles,” Regional American Mathematical Society Meeting, Special Session on Algo-rithmic Probability and Combinatorics, AMS’07, Chicago, October 2007.

28. O. Milenkovic, R. Baraniuk, T. Simunic-Rosing, “Compressed Sensing Meets Bioinformatics: ANew DNA Microarray Architecture,” Information Theory and Applications Workshop, San Diego, Jan-uary, 2007.

29. O. Milenkovic, “On the Generalized Reversal Distance,” American Mathematical Society Meeting,New Orleans, January 2007.

30. O. Milenkovic and E. Soljanin, “Enumerating RNA Secondary Structures: A Constrained CodingApproach,” Asilomar Conference on Signals, Systems and Communication, October 2006.

31. O. Milenkovic, “Enumerating RNA Motifs,” Allerton Conference on Communication, Control and Com-puting, September 2006.

32. O. Milenkovic, “Error and Quality Control Coding for DNA Microarrays,” Information Theory Work-shop organized as part of the Inauguration Ceremony of the Jacobs School of Engineering Center for Informa-tion Theory and its Applications, San Diego, February 2006.

33. O. Milenkovic, “Constrained and Error-Control Coding for DNA Computers,” Workshop on Statis-tical Physics and Coding, Santa Fe, January 2005 (joint work with N. Kashyap).

34. O. Milenkovic, “Problems in Combinatorial and Number Theory Arising in the Construction ofLDPC Codes,” American Mathematical Society Meeting, Evanston, Illinois, October 2004.

35. O. Milenkovic and B. Vasic, “How DNA Stores Information and Efficient DNA Storage,” DIMACSWorkshop on Theoretical Advances In Information Recording, March 2004.

36. O. Milenkovic and K. Compton, “Average Case Analysis of Gosper’s Algorithm,” American Mathe-matical Society Meeting, Bloomington, Indiana, April 2003.

37. K. Compton and O. Milenkovic, “Probabilistic transforms in the analysis of algorithms,” Eight Sem-inar on Analysis of Algorithms, Strobl, Austria, June 2002.

38. K. Compton and O. Milenkovic, “An Analysis Inspired by Gosper’s Algorithm,” Seventh Seminaron Analysis of Algorithms, Tatihou, France, July 2001.

16 Olgica Milenkovic

CONFERENCE PAPERS (SUBMITTED)

A. Emad and O. Milenkovic, “Information Theoretic Bounds for Tensor Rank Minimization overFinite Fields,” submitted, March 2011.

REMARK: Some of the listed publications can be found on IEEEexplorer, under Milenkovic O,Milenkovic G (typo) and Olgica M (typo).

INVITED TALKS

List contains Invited Talks and Seminar Talks at UIUC and CU.

1. O. Milenkovic, Low-rank completion with applications in Bioinformatics and Imaging, Johns Hopkins,March, 2011.

2. O. Milenkovic, Sorting Permutations by Cost-Constrained Compositions, Harvard, March, 2011.

3. O. Milenkovic, Sorting Permutations by Cost-Constrained Compositions, MIT, November, 2010.

4. O. Milenkovic, Reconstructing Strings using Multiset Traces, UCLA, October 2010.

5. O. Milenkovic, Low-Rank Matrix Completion for Inferring Protein-Protein Interactions, King’s CollegeLondon, September 2010.

6. O. Milenkovic, Sorting by Cost-Constrained Transpositions, University of Bristol, UK, August, 2010.

7. O. Milenkovic, Sorting by Cost-Constrained Transpositions, University of California, San Diego, July2010.

8. O. Milenkovic, Low-Rank Matrix Completion for Inferring Protein-Protein Interactions, University ofCalifornia, Berkeley, April, 2010.

9. O. Milenkovic, Low-Rank Matrix Completion, EPFL, July 2009.

10. O. Milenkovic, On the interplay between coding theory and compressed sensing, Applied MathematicsSeminar, Princeton University, March 2009.

11. O. Milenkovic, Good-Turing Estimation in the Presence of Repetition Errors, Mathematical Biology Sem-inar, UIUC, February 2009.

12. O. Milenkovic, Rate-Distortion Functions for Compressive Sensing, DSP Seminar, February 2009.

13. O. Milenkovic, On the Interplay between Coding Theory and Compressive Sensing, University CollegeCork, Electrical Engineering Department, Ireland, January 2009 (a joint work with Wei Dai).

14. O. Milenkovic, Hardness of Approximation and New Automorphism Group Decoding Algorithms, Com-puter Science Theory Seminar, UIUC, November 2008.

15. O. Milenkovic, Superimposed Coding for Integer Compressed Sensing, Operations Research Depart-ment, UIUC, September 2008.

16. O. Milenkovic, An Algebraic Approach to Reverse Engineering of Gene Regulatory Networks, Departmentof Mathematics Seminar, Georgia Tech, June 2008.

17 Olgica Milenkovic

17. O. Milenkovic, Superimposed Codes in Bioinformatics, Technisches Universitaet, Munchen, May 2008.

18. O. Milenkovic, On the Interplay between Coding Theory and Compressive Sensing, DPS Seminar,March 2008 (a joint work with Wei Dai).

19. O. Milenkovic, The Stopping Redundancy Hierarchy and Automorphism Group Decoding of Cyclic Codes,ECE Seminar, University of California, Irvine, April 2007.

20. O. Milenkovic, Coding Theoretic Problems in Genetic Data Acquisition, Modelling and Analysis, ECESeminar, University of Illinois, Urbana-Champaign, April 2007.

21. O. Milenkovic, Average Case Analysis of Gosper’s Algorithm for Indefinite Summation of HypergeometricTerms, STAR Theoretical Computer Science Seminar, University of California, San Diego, March2007.

22. O. Milenkovic, Probabilistic Transforms for Combinatorial Urn Models, University of Southern Califor-nia, Los Angeles, March 2007.

23. O. Milenkovic, Compressed Sensing DNA Microarrays, University of Washington, Seattle, March 2007.

24. O. Milenkovic, Iterative Automorphism Group Decoding on Redundant Tanner Graphs, Hewlett PackardResearch Labs, December 2006.

25. O. Milenkovic, Probabilistic Transforms for Analyzing Binning Schemes, University of California,Berkeley, December 2006 (a joint work with K. Compton, University of Michigan, Ann Arbor).

26. O. Milenkovic, Error-Control and Constrained Coding Solutions for DNA Microarrays and Aptamer ArrayDesigns, University of Southern California ECE Seminar, November 2006.

27. O. Milenkovic, Enumerating RNA Shape Motifs, Department of Electrical Engineering and ComputerScience, University of Michigan, Ann Arbor, October 2006.

28. O. Milenkovic, The Three Faces of Hybridization, Engineering Department Colloquium, University ofErlangen, June 2006.

29. O. Milenkovic, Two Problems in Analysis of Algorithms, Department of Mathematics Seminar, Queen’sUniversity, March 2006.

30. O. Milenkovic, Linear Programming Decoding, Code Polytopes and Minimal Codewords, Kempner Collo-quium, Department of Mathematics, University of Colorado, Boulder, November 2005 (a joint workwith N. Kashyap, Emina Soljanin and Phil Whiting).

31. O. Milenkovic, Minimal Codewords, Code Polytopes and the Complexity of LP Decoding, Los AlamosNational Laboratory, November 2005.

32. O. Milenkovic, Gosper’s Algorithm and Probabilistic Analysis of Urn Models, Murray Hill MathematicsResearch Colloquium and Seminar, Bell Labs, Lucent Technologies, June 2005 (a joint work with K.Compton).

33. O. Milenkovic, On the Analysis and Application of LDPC Codes, Colorado Center for InformationStorage Seminar, Boulder, March 2005.

34. O. Milenkovic, Error-Control and Constrained Coding for DNA Computers, ECE Department Seminar,University of Colorado, Boulder, March 2005 (a joint work with N. Kashyap).

18 Olgica Milenkovic

35. O. Milenkovic, Constrained and Error-Control Coding for DNA Computers, Communications and Sig-nal Processing Laboratory Seminar, University of Maryland, Washington D.C., March 2005 (a jointwork with N. Kashyap).

36. O. Milenkovic, Applications of Information Theory in Genetics, Program in Applied Mathematics Col-loquium, University of Arizona, Tucson, November 19, 2004 (a joint work with B. Vasic).

37. O. Milenkovic, On the Information Storage Mechanism of DNA, ECE Department Seminar, Universityof Colorado, Boulder, April 2004.

FUNDED PROJECTS

1. (Active) NSF-STC, Information Theory Beyond Shannon, PI, co-PIs: Todd Coleman and P. R. Kumar,Total amount: 1.2M. Milenkovic: 320K.

2. (Active) AFRLDL-EBSAFOSR Proposal, recommended for funding, Compressive Sensing and Cod-ing for Complex Networks, PI, co-PI: Andjelija Nedich, UIUC. Total amount: 460K. Milenkovic:240K.

3. (Active) NSF (CCF 0729216) Collaborative Research: CCF - Design and Analysis of CompressedSensing DNA Microarrays, (PI), August 2008. Supplementary funding.Total amount: 200K.

4. (Active) NSF (CCF 0729216) Collaborative Research: CCF - Design and Analysis of CompressedSensing DNA Microarrays, (PI), February 2007. Co-PIs: Richard Baraniuk (Rice University), EleazarEskin (UCLA), Alon Orlitsky and Tajana Simunic (UCSD). Total amount: 1.5 million $. Milenkovic:300K $.

5. (Active) NSF - Career (CCF 0644427): Coding Theoretic Problems in Genetic Data Acquisition, Mod-elling, and Analysis, (PI), March 2007 - March 2011. Milenkovic (sole PI): 400K $.

6. DARPA Young Investigator Award: Belief Propagation Algorithms for Compressed Biosensing, (PI),December 2006. Milenkovic (sole PI): 150K $.

7. NSF (CNS 0454404) CRI: Wireless Internet Building Blocks for Research, Policy, and Education (Co-PI), August 2005 - August 2008. PI: Dirk Grunwald. co-PIs:

8. NSF (CCF 0514875) Collaborative Research: Constrained and Error-Control Coding for DNA Com-puters (PI), August 2005 - August 2006.

8. Colorado Center for Information Storage: Construction and Analysis of Generalized LDPC Codesfor Storage and Optical Communication Systems (PI).

Ensured the Lincoln Lab Fellowship for David Leyba, September 2004 - September 2005; Ensured re-search fellowship from Erlangen University for Stefan Laendner, September 2005; Received supportfor developing an interdisciplinary class in information theory and biology from the Bernard Gor-don Price awarded to Dr. Frank Barns, 2004.

PROFESSIONAL ASSOCIATIONS

Associate Editor for IEEE Transactions on Communication, 2007.

19 Olgica Milenkovic

Guest Editor in Chief for the special issue of the IEEE Transactions on Information Theory on Applica-tions of Information Theory to Molecular Biology and Neuroscience.

Associate Editor for IEEE Transactions on Signal Processing, 2009.

Member of the Institute of Electrical and Electronics Engineers (IEEE) and the American Mathemat-ical Society (AMS)

Reviewer for SIAM Journal on Discrete Mathematics, IEEE Transactions on Information Theory, IEEETransactions on Communication Theory, IEEE Communication Letters, ISIT, ICC etc.

Session Chair, 42nd Allerton Conference on Communications, Control and Computing, 2003.

Session Chair, Global Communications Conference - Globecom, Dallas, TX, 2005.

Book Proposal Review, Prentice Hall, 2007.

Session Chair, 44th Allerton Conference on Communications, Control and Computing, 2006.

Session Chair, ISIT’07, Nice, France, 2007.

Session organizer, 40th Asilomar Conference on Signals, Systems and Computers, Communications andNetworking Track, 2006.

Session Chair, Second Annual ITA Workshop, San Diego, CA, 2007.

Session Organizer/Session Chair, Third Annual ITA Workshop, San Diego, CA, 2008.

Session Chair, American Mathematical Society (AMS) Meeting, Bloomington, Indiana, 2008.

Session organizer, Intermag 2007.

Book Reviewer, Prentice Hall 2007.

Technical Program Committee Member, IEEE International Conference on Communication, Istanbul,Turkey, 2006.

Technical Program Committee Member, IEEE Information Theory Workshop, Lake Tahoe, 2007.

Technical Program Committee Member, IEEE Wireless Communications and Networking Conference,Las Vegas, 2008.

Technical Program Committee Member, IEEE Information Theory Workshop, Portugal, 2008.

Technical Program Committee Member, Globecom, New Orleans, 2008.

Technical Program Committee Member, ICC, Dresden, Germany, 2009.

Technical Program Committee Member, IEEE Information Theory Workshop, Volos, Greece, 2009.

Session organizer (Biology), IEEE Information Theory Workshop, Volos, Greece, 2009.

Track Chair for ”Engineering Models in Bio-Medicine”, IEEE Conference on Bioinformatics andBioengineering (BIBE) 2008.

Technical Program Committee Member, ISIT’2009, Seul, Korea.

20 Olgica Milenkovic

Technical Program Committee Member, Information Theory and Statistical Learning, ITSL’2008, LasVegas, Nevada, 2008.

Committee member, 2007 Best paper in Signal Processing and Coding for Data Storage.

External Reviewer for the Senior Lecture Promotion Committee, University of Cork, Ireland.

External Examiner, University College of Cork, Ireland.

DIMACS (Discrete Mathematics and Computer Science) Workshop Organizer, Topic: DIMACS/DyDAnWorkshop on Streaming, Coding, and Compressive Sensing: Unifying Theory and Common Appli-cations to Sparse Signal/Data Analysis and Processing, March 2009.

Allerton Conference 2008 Session Organizer: Compressive sensing and Novel Directions in Opti-mization Theory, Coding Theory I and II, Emerging Applications of Information Theory.

Session chair, ITA 2009, San Diego California.

Co-Organizer, ITA Mini Workshop on Information theory in viral evolution modeling, 2008/2009,San Diego California (jointly with S. McLaughlin, P. Tetali, and A. Orlitsky).

Invitee and Session Lead, “Information Theory Beyond Shannon”, Venice, Italy, December 2008.

Chair, poster session on Identification and Classification of Genomic Structure, GENSIPS’2009.

Co-Organizer, Workshop on Genomic Error Correction, Cergy-Pontoise, France, June 2009 (jointlywith D. Leclerque and B. Vasic).

Technical Programm Committee Member, ISIT’2010, Austin, Texas.

Technical Programm Committee Member, ITW’2010, Cairo, Egypt, 2010.

Allerton Conference Session Organizer (four sessions), 2009.

Allerton Conference Session Organizer (seven sessions), 2010.

Technical Programm Committee Member, ISIT’2011, Saint Petersburg, Russia.

Technical Programm Committee Member, Globecom’2011, Dallas, Texas.

Technical Programm Committee Co-Chair, ISIT’2014, Honolulu, Hawaii.

Special Session Organizer, Information Theory Workshop (ITW), Paraty, Brazil, 2011.

Associate Editor for Coding Theory, IEEE Transactions on Information Theory, August 2011-2014.

Workshop Co-Organizer, IMA Workshop on Group Testing in Life Sciences, Minnesotta, 2012.

NSF Panel Member.

21 Olgica Milenkovic

INTERNAL SERVICE

Graduate Admission Committee, 2007/2008,2008/2009

Graduate Recruiting Committee, 2008/2009

Graduate Fellowship Committee, 2007/2008

SURGE Fellowship Interviewer.

Staff Award Committee.

Thesis/Prelim Exam Committee member, UIUC.

ECE Department Hiring Committee, UIUC, 2010-2011.

Informatics PhD Programm Committee, UIUC, 2011.

Adam Davison Smithhttp://www.cse.psu.edu/˜asmith

RESEARCH INTERESTS

Cryptography, Data Privacy, Quantum Computing, Theoretical Computer Science.

EDUCATION

� Ph.D. in Computer Science — Massachusetts Institute of Technology September 2004Thesis: Maintaining Secrecy when Information Leakage is Unavoidable

� S.M. in Computer Science — Massachusetts Institute of Technology September 2001Thesis: Multi-party Quantum Computation

� B.Sc. in Mathematics and Computer Science — McGill University June 1999Joint Honours, Governor General’s Medal

EMPLOYMENT

� Associate Professor, Pennsylvania State University July 2010–present� Assistant Professor, Pennsylvania State University January 2007–June 2010� Visiting Scientist, Institute for Pure and Applied Mathematics, UCLA Fall 2006� Visiting Scientist, Massachusetts Institute of Technology Spring 2006� Post-doctoral Fellow, Weizmann Institute of Science, Israel September 2004–August 2006� Graduate Research Assistant, Massachusetts Institute of Technology 1999–2004� Research Intern, Microsoft Research Summer 2002–Summer 2003� Research Intern, Telcordia Technologies Summer 2000� Research Assistant, McGill University Summer 1998–Summer 1999

AWARDS & SCHOLARSHIPS

� US Presidential Early Career Award for Scientists and Engineers (PECASE), 2009.� US National Science Foundation CAREER Award, 2008.� Runner-up, 2006 Privacy-Enabling Technology Award for the paper “Calibrating Noise to Sensitivity in

Private Data Analysis”.� Microsoft Graduate Fellowship, 2003-2004.� NTT Entrance Fellowship, Massachusetts Institute of Technology, 1999-2000.� 1999 Governor General’s Bronze Medal (best cumulative GPA in Faculty of Science), McGill University.� Scholarships while at McGill University: 1999 Edward Rosenthall Mathematics Prize, 1998 SHL Sys-

temhouse President’s Award, 1998 and 1997 Corporate Software & Technology Scholarships, 1998 H.J.Brennan Mathematics Scholarship, 1997 Edward Beatty Memorial Mathematics Scholarship, 1996 Ed-wards Woods Entrance Scholarship.

1

TEACHING EXPERIENCE

Instructor for

� Algorithms and Data Structures (undergraduate), Penn State Spring 2007, Fall 2009� Cryptography (graduate), Penn State Fall 2007, Spring 2009, Spring 2011� Analysis of Algorithms (graduate), Penn State Fall 2008, Fall 2010� Theoretical Computer Science Seminar, Penn State Spring 2008, Spring 2009� Privacy in Statistical Databases, Penn State Fall 2007, Spring 2010� Privacy in Statistical Databases, Weizmann Institute of Science Spring 2005

Teaching Assistant for

� Cryptography, Massachusetts Institute of Technology Fall 2000� Advanced Calculus, Algebra, Programming Languages, McGill University Fall 1997–Spring 1999

STUDENT ADVISING

� Srivatsava Ranjit Ganta (co-advised with Raj Acharya), Ph.D. October 2008.� Laxman Vembar, M.S. September 2008.� Ashwinkumar Gopalrathnam, M.S. (Electrical Engineering) September 2008.� Abhradeep Guha Thakurta, Ph.D. expected May 2012.

PROFESSIONAL ACTIVITIES

� Conference organization

– Organizer, Workshop on Statistical and Learning-Theoretic Challenges in Data Privacy, Institute forPure and Applied Mathematics, UCLA, February 2010.

� Program committee chair for

– Information-theoretic Security (ICITS) 2012, Montreal, Canada, August 2012.

� Program committee member for

– Foundations of Computer Science (FOCS) 2011, Palm Springs, CA, October 2011.– Crypto 2011, Santa Barbara, CA, August 2011.– Information-theoretic Security (ICITS) 2011, Amsterdam, The Netherlands, May 2011.– Privacy-Enhancing Technologies (PETS) 2011, Waterloo, Canada, July 2011.– IEEE Security and Privacy 2010, Oakland, CA, May 2010.– Theory of Cryptography Conference (TCC) 2010, Zurich, Switzerland, February 2010.– Crypto 2009, Santa Barbara, CA, August 2009.– Cryptography and Network Security 2009, Santa Barbara, CA, August 2009.– ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2009.– SCN 2008, Amalfi, Italy, September 2008.– Crypto 2008, Santa Barbara, CA, August 2008.– RSA Conference, Cryptographer’s Track (CT-RSA) 2008, San Francisco, CA, February 2008.– Crypto 2007, Santa Barbara, CA, August 2007.– ACM Conference on Electronic Commerce (EC) 2007, San Diego, CA, June 2007.

2

– RSA Conference, Cryptographer’s Track (CT-RSA) 2007, San Francisco, CA, February 2007.– Formal and Computational Cryptography Workshop (FCC) 2006, Venice, Italy, June 2006.– Theory of Cryptography Conference (TCC) 2006, New York, NY, March 2006.– Crypto 2005, Santa Barbara, CA, August 2005.

� Associate editor, Journal of Privacy and Confidentiality.� Reviewer for several journals and conferences: Journal of the ACM, Journal of Cryptology, SIAM Journal

on Computing, SIAM Journal on Discrete Mathematics, Journal of Quantum Information and Computing,Journal of Privacy Technology, ACM Transactions on Algorithms, Physics Letters A, IEEE Transactionson Information Theory, FOCS, STOC, Crypto, Eurocrypt, SODA, TCC, Random.

EXTERNAL FUNDING

� US National Science Foundation Award #0941553. CDI Type II: Integrating Computational and Statisti-cal Approaches to Data Privacy, co-PI, Fall 2010–2014, $2,000,000.

� US National Science Foundation Award #0747294. CAREER: Rigorous Foundations for Data Privacy,PI, Fall 2008–2013, $400,000. Received PECASE, 2009.

� US National Science Foundation Award #0729171. TF: Algorithmic and Learning-Theoretic Aspects ofData Privacy, PI, Fall 2007–2010, $277,000.

� U.S Army Research Laboratory Collaborative Technology Alliance Award. Quality-of Information-Aware Networks for Tactical Applications (QUANTA), co-PI, Fall 2009–2014, $16,755,800.

PUBLICATIONS IN REFEREED JOURNALS (Note: By default, authors are listed in alphabetical order. Paperswhere the author order is based on contribution are marked with ∗.)

� S. P. Kasiviswanathan, H. Lee, K. Nissim, S. Raskhodnikova and A. Smith. What Can We Learn Pri-vately? Accepted to SIAM Journal on Computing, 2009.

� S. Raskhodnikova, D. Ron, A. Shpilka and A. Smith. Strong Lower Bounds for Approximating Distribu-tion Support Size and the Distinct Elements Problem. SIAM Journal on Computing, Vol. 39, No. 3, pp.813–842, 2009.

� M. Naor, G. Segev and A. Smith. Tight Bounds for Unconditional Authentication Protocols in the ManualChannel and Shared Key Models. IEEE Transactions on Information Theory, Vol. 54, No. 6, pp. 2408-2425, 2008.

� Y. Dodis, R. Ostrovsky, L. Reyzin and A. Smith. Fuzzy Extractors: How to Generate Strong Keys fromBiometrics and Other Noisy Data. SIAM Journal on Computing, Vol. 38, No. 1, 2008.

� J. Katz, J. S. Shin, A. Smith. Parallel and Concurrent Security of the HB and HB+ Protocols. Journal ofCryptology, Vol. 23, No. 3, p. 402–421, 2010.

� * M. Tomamichel, R. Renner, C. Schaffner, A. Smith. Leftover Hashing Against Quantum Side Informa-tion. Accepted to IEEE Transactions on Information Theory, 2011.

PUBLICATIONS IN REFEREED CONFERENCES (Note: By default, authors are listed in alphabetical order.Papers where the author order is based on contribution are marked with ∗.)

� S. Hallgren, A. Smith, F. Song. Classical Cryptographic Protocols in a Quantum World. In Advances inCryptology—CRYPTO 2011, p. 295–313, August 2011.

3

� V. Karwa, S. Raskhodnikova, A. Smith, G. Yaroslavtsev. Private Analysis of Graph Structure. In 37thInternational Conference on Very Large Databases (PVLDB), August 2011.

� A. Smith. Privacy-preserving Statistical Estimation with Optimal Convergence Rates. In 43nd AnnualACM Symposium on the Theory of Computing (STOC), June 2010.

� V. Guruswami, A. Smith. Codes for Computationally Simple Channels: Explicit Constructions withOptimal Rate. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), p. 723–732, October 2010.

� E. Kiltz, A. O’Neill, A. Smith. Instantiability of RSA-OAEP under Chosen-Plaintext Attack. In Advancesin Cryptology—CRYPTO 2010, p. 295–313, August 2010.

� R. Bhaskar, S. Laxman, A. Smith, A. G. Thakurta. Discovering Frequent Patterns in Sensitive Data. In16th ACM SIGKDD Symp. Knowledge Discovery and Data Mining (KDD), p. 503–512, July 2010.

� S. Kasiviswanathan, M. Rudelson, A. Smith, J. Ullman. The Price of Privately Releasing ContingencyTables and the Spectra of Random Matrices with Correlated Rows. In 42nd Annual ACM Symposium onthe Theory of Computing (STOC), p. 775–784, June 2010.

� Y. Dodis, J. Katz, A. Smith and S. Walfish. Composability and On-Line Deniability of Authentication.In Theory of Cryptography Conference (TCC), p. 146–162, March 2009.

� S. P. Kasiviswanathan, H. Lee, K. Nissim, S. Raskhodnikova and A. Smith. What Can We Learn Pri-vately? In 48th Annual Symposium on Foundations of Computer Science (FOCS), p. 531–540, October2008.

� I. Damgard, Y. Ishai, M. Krøigaard, J. B. Nielsen, A. Smith: Scalable Multiparty Computation withNearly Optimal Work and Resilience. In Advances in Cryptology — CRYPTO 2008, p. 241–261, August2008.

� S. R. Ganta, S. P. Kasiviswanathan and A. Smith. Composition Attacks and Auxiliary Information inData Privacy. In 14th ACM International Conference on Knowledge Discovery and Data Mining (KDD),p. 531–540, August 2008.

� V. Goyal, P. Mohassel and A. Smith. Efficient Two- and Multi-party Computation Protocols for CovertAdversaries. In Advances in Cryptology — EUROCRYPT 2008, p. 289-306, April 2008.

� ∗ W. Enck, K. Butler, T. Richardson, P. McDaniel and A. Smith. Defending Against Attacks on MainMemory Persistence. In 24th Annual Computer Security Applications Conference (ACSAC), p. 65–74,December 2008.

� S. Raskhodnikova, D. Ron, A. Shpilka and A. Smith. Strong Lower Bounds for Approximating Distri-bution Support Size and the Distinct Elements Problem. In 47th Annual Symposium on Foundations ofComputer Science (FOCS), p. 559–569, October 2007.

� S. Raskhodnikova, D. Ron, R. Rubinfeld and A. Smith. Sublinear Algorithms for Approximating StringCompressibility. In 11th International Workshop on Randomization and Computation (RANDOM), Au-gust 2007.

� K. Nissim, S. Raskhodnikova and A. Smith. Smooth Sensitivity and Sampling in Private Data Analysis.In 39th Annual ACM Symposium on Theory of Computing (STOC), June 2007, pp. 75-84.

� A. Smith. Scrambling Errors Using Few Random Bits: Optimal Information Reconciliation and BetterPrivate Codes. In 18th Annual ACM Symposium on Discrete Algorithms (SODA), January 2007, pp. 472–479.

� M. Ben-Or, C. Crpeau, D. Gottesman, A. Hassidim, and A. Smith. Secure Multiparty Quantum Computa-tion with (Only) a Strict Honest Majority. In 47th Annual IEEE Symposium on Foundations of ComputerScience (FOCS), October 2006, pp. 249–260.

4

� M. Naor, G. Segev and A. Smith. Tight Bounds for Unconditional Authentication Protocols in the ManualChannel and Shared Key Models. In Advances in Cryptology — CRYPTO 2006, August 2006, SpringerLNCS 4117, pp. 214–231.

� Y. Dodis, J. Katz, L. Reyzin and A. Smith. Robust Fuzzy Extractors and Authenticated Key Agreementfrom Close Secrets. In Advances in Cryptology — CRYPTO 2006, August 2006, Springer LNCS 4117,pp. 232–250.

� C. Dwork, F. McSherry, K. Nissim and A. Smith. Calibrating Noise to Sensitivity in Private Data Analy-sis. In Theory of Cryptography 2006, March 2006, Springer LNCS 3876, pp. 265–284.

� X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky and A. Smith. Secure Remote Authentication Using Biomet-rics. In Advances in Cryptology — EUROCRYPT 2005, May 2005, Springer LNCS 3494, pp. 147–163.

� S. Chawla, C. Dwork, F. McSherry, A. Smith and H. Wee. Toward Privacy in Public Databases. In Theoryof Cryptography Conference (TCC), Cambridge, MA, February 2005, Springer LNCS 3378, pp. 363–385.

� C. Crepeau, D. Gottesman and A. Smith. Approximate Quantum Error-Correcting Codes and Secret-Sharing Schemes. In Advances in Cryptology — EUROCRYPT 2005, Springer LNCS 3494, May 2005,pp. 285–301.

� Y. Dodis and A. Smith. Correcting Errors Without Leaking Partial Information. In 37th Annual ACMSymposium on Theory of Computing (STOC), May 2005, pp. 654-663.

� Y. Dodis and A. Smith. Entropic Security and the Encryption of High Entropy Messages. In Theory ofCryptography 2005, Cambridge, MA, February 2005, Springer LNCS 3378, pp. 556–577.

� A. Ambainis and A. Smith. Small Pseudo-Random Families of Matrices: Derandomizing ApproximateQuantum Encryption. In 8th International Workshop on Randomization and Computation (RANDOM),August 2004, Springer LNCS 3122, pp. 249–260.

� Y. Dodis, L. Reyzin and A. Smith. Fuzzy Extractors: How to Generate Strong Keys from Biometrics andOther Noisy Data. In Advances in Cryptology — EUROCRYPT 2004, May 2004, Springer LNCS 3027,pp. 523–540. Updated version available as IACR Eprint 2003/235.

� C. Dwork, R. Shaltiel, A. Smith and L. Trevisan. List-Decoding of Linear Functions and Analysis ofa Two-Round Zero-Knowledge Argument. In Theory of Cryptography 2004, February 2004, SpringerLNCS 2951, pp. 101–120.

� R. Ostrovsky, C. Rackoff and A. Smith. Efficient Consistency Proofs for General Queries on a CommittedDatabase. In 31st International Colloquium on Automata, Languages and Complexity (ICALP), Turku,Finland, July 2004, Springer LNCS 3142, pp. 1041–1053.

� J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-party Computation with a DishonestMajority. In Advances in Cryptology — EUROCRYPT 2003, May 2003, Springer LNCS 2656, pp. 578-595.

� C. Peikert, A. Shelat and A. Smith. Lower Bounds for Collusion-Secure Fingerprinting. In 14th AnnualACM Symposium on Discrete Algorithms (SODA), January 2003, pp. 472–479.

� A. Ambainis, A. Smith and K. Yang. Extracting Quantum Entanglement. In 17th Annual IEEE Confer-ence on Computational Complexity (CCC), May 2002, pp. 103–112.

� H. Barnum, C. Crepeau, D. Gottesman, A. Smith and A. Tapp. Authentication of Quantum Messages. In42nd Annual Symposium on Foundations of Computer Science (FOCS), November 2002, pp. 449–458.

� M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein and A. Smith. Detectable Byzantine Agreement SecureAgainst Faulty Majorities. In 21st Annual ACM Symposium on Principles of Distributed Computing(PODC), July 2002, pp. 118–126.

5

� C. Crepeau, D. Gottesman and A. Smith. Secure Multi-party Quantum Computation. In 34th AnnualACM Symposium on Theory of Computing (STOC), May 2002, pp. 643–652.

� G. Di Crescenzo, J. Katz, R. Ostrovsky and A. Smith. Efficient and Non-interactive Non-malleable Com-mitment. In Advances in Cryptology — EUROCRYPT 2001, May 2001, Springer LNCS 2045, pp. 40–59.Also available as IACR Eprint 2001/032.

� Y. Dodis, A. Sahai and A. Smith. On Perfect and Adaptive Security in Exposure-Resilient Cryptography.In Advances in Cryptology — EUROCRYPT 2001, May 2001, Springer LNCS 2045, pp. 301–324.

� M. Liskov, A. Lysyanskaya, S. Micali, L. Reyzin and A. Smith. Mutually Independent Commitments. InAdvances in Cryptology — ASIACRYPT 2001, December 2001, Springer LNCS 2248, pp. 385–401.

NON-REFEREED INVITED PAPERS

� A. Smith. What Can Cryptography Do for Coding Theory? In International Conference on Cryptographyand Network Security (CANS), December 2009.

� A. Smith. Integrating Differential Privacy with Statistical Theory. In International Conference onInformation-theoretic Security (ICITS), December 2009.

BOOK CHAPTERS

� Y. Dodis, L. Reyzin and A. Smith. Fuzzy Extractors. In P. Tuyls, editor, Security with Noisy Data,Springer-Verlag, 2008.

TALKS AND PRESENTATIONS

Invited Conference (Plenary) Presentations:

� Cryptology and Network Security Conference 2009, Kanazawa, Japan, December 2009.� International Conference on Information-Theoretic Security 2009, Shizuoka, Japan, December 2009.

Invited Tutorials:

� Pinning Down Privacy- DIMACS Workshop on Data Privacy, Rutgers University, February 2008.

Invited Seminar and Workshop Presentations:

� Integrating Differential Privacy with Statistical Theory- Computer Science Colloquium, Cornell University, Ithaca, NY, September 2011.- Department of Statistics Colloquium, Carnegie-Mellon University, Pittsburgh, PA, March 2010.- Computer Science Colloquium, University of Massachusetts at Amherst, March 2010.- Eastern Great Lakes Workshop on Theoretical Computer Science, Buffalo, NY, October 2009.

� Codes for Computationally Simple Channels- Information Theory Workshop (ITW), Dublin, Ireland, September 2010.

� Lower Bounds on Data Privacy- Algorithms & Combinatorics Seminar, Carnegie Mellon University, September 2009.

6

� Pinning Down Privacy- Steklov Institute, Saint-Petersburg, Russia, June 2009. - DIMACS Workshop on Internet Privacy: Fa-cilitating Seamless Data Movement with Appropriate Controls, Rutgers University, September 2008.- Google Research, New York, NY, March 2008.- Department of Statistics Colloquium, Penn State, January 2008.- Workshop on Data Privacy, Weizmann Institute of Science, Israel, July 2006.

� What Can We Learn Privately?- MIT Cryptography and Information Security Seminar, February 2008.- Microsoft-CMU Mindswap on Data Privacy, Pittsburgh, PA, October 2007.

� Calibrating Noise to Sensitivity in Private Data Analysis- C.S.-Statistics Workshop on Privacy and Confidentiality, Bertinoro, Italy, July 2005.- Tel Aviv University, Israel, January 2006.- Simon Fraser University, Canada, February 2006.- Federal Institute of Technology (ETH), Zurich, Switzerland, March 2006.- Harvard University, March 2006.- Massachusetts Institute of Technology, March 2006.- California Institute of Technology, December 2006.- Penn State University, January 2007.- Carnegie Mellon University, April 2007.

� Cryptography with Quantum Data- IPAM Workshop on Foundations of Zero-Knowledge and Multi-party Computation, UCLA, November2006.- Perimeter Institute for Theoretical Physics, Canada, June 2007.

� Interaction and Local Storage in Private Data Analysis- IPAM Workshop on Locally Decodable Codes and Privacy-Preserving Data Mining, UCLA, October2006.

� Cryptography with Noisy Secrets- Microsoft Research SVC, Mountain View, CA, May 2005.- University of British Columbia, Canada, February 2006.- Penn State University, February 2006.- Bell Labs (Lucent Technologies), NJ, March 2006.- University of Waterloo, Canada, March 2006.- University of Michigan, Ann Arbor, March 2006.- SRI (Stanford Research Institute) International, Menlo Park, CA, March 2006.

� Evolving Notions of Security for Quantum Protocols (tutorial presentation)- Classical and Quantum Information Security Workshop, Pasadena, CA, December 2005.

� Correcting Errors without Leaking Partial Information- Haifa University, Haifa, Israel, March 2005.- Technion (Israel Institute of Technology), Haifa, Israel, March 2005.- Weizmann Institute of Science, Rehovot, Israel, April 2005.- Princeton University, May 2005.

� Toward Privacy in Public Databases- Workshop on Secure Multiparty Protocols, Amsterdam, The Netherlands, October 2004.- Ben-Gurion University, Israel, November 2004.- Tel-Aviv University, Israel, November 2004.

7

- Hebrew University of Jerusalem, Israel, January 2005.- Boston University, February 2005.- New York University, February 2005.

� Fuzzy Extractors: Generating Strong Keys from Biometric Data- University of Waterloo, Canada, February 2004.- Toyota Technological Institute, Chicago, IL, March 2004.- Intel Research, Berkeley, CA, March 2004.- University of Victoria, Canada, March 2004.- DIMACS Workshop on Data Privacy, March 2004.- Tel-Aviv University, Israel, April 2004.- University of Montreal, Canada, May 2004.- University of Toronto, Canada, May 2004.- Bar-Ilan University, Israel, March 2005.

� Secrecy of High-Entropy Sources — Protecting All Partial Information- MIT Cryptography and Information Security Seminar, September 2003.- McGill University, October 2003.- Weizmann Institute of Science, Israel, November 2003.- Hebrew University of Jerusalem, Israel, November 2003.- Tel-Aviv University, Israel, November 2003.

� Round Efficiency of Multi-party Computation with a Dishonest Majority- Massachusetts Institute of Technology, December 2002.

� List-Decoding and Two-Round Zero-Knowledge- Microsoft Research SVC, Mountain View, CA, August 2002.

� Detectable Byzantine Agreement Secure Against a Faulty Majority- Microsoft Research SVC, Mountain View, CA, July 2002.

� Secure Multi-party Quantum Computation,- Workshop on Quantum Cryptography, NEC Research, Princeton, NJ, December 1999.- Quantum Information Processing, Yorktown Heights, NY, January 2002.- Barbados Workshop on Quantum Cryptography, Barbados, May 2002.

� Efficient and Non-Interactive Non-Malleable Commitment- McGill University, December 2001.

� Range Queries on a Committed Database- Telcordia Technologies, NJ, August 2000.

� On Perfect and Adaptive Security in Exposure-Resilient Cryptography.- Telcordia Technologies, NJ, July 2000.

� Quantum and Classical Secret-Sharing- Massachusetts Institute of Technology, December 1999.

Conference Presentations:

� Privacy-preserving Statistical Estimators with Optimal Convergence Rates- STOC 2011, San Jose, CA, 2011.

� Codes for Computationally Simple Channels- FOCS 2010, Las Vegas, NV, 2010.

� Integrating Differential Privacy with Statistical Theory- American Statistical Association Joint Statistical Meetings, Washington, DC, 2009.

8

� Strong Lower Bounds for Distribution Support Size and String Compressibility- IEEE Symposium on the Foundations of Computer Science (FOCS) 2007, Providence, RI, October 2007.

� Scrambling Adversarial Errors Using Few Random Bits- ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, January 2007.

� Calibrating Noise to Sensitivity in Private Data Analysis- Theory of Cryptography Conference (TCC) 2006, New York, NY, March 2006.

� Correcting Errors without Leaking Partial Information- ACM Symposium on the Theory of Computing (STOC), Baltimore, MD, May 2005.

� Entropic Security and the Encryption of High Entropy Messages- Theory of Cryptography Conference (TCC) 2005, Cambridge, MA, February 2005.

� Small Pseudo-Random Families of Matrices and Approximate Quantum Encryption- 8th International Workshop on Randomization and Computation (RANDOM), August 2004.

� List-Decoding of Linear Codes and Two-Round Zero-Knowledge Arguments- Theory of Cryptography Conference (TCC) 2004, Cambridge, MA, February 2004.

� Round Efficiency of Multi-party Computation with a Dishonest Majority- Advances in Cryptology — Eurocrypt 2003, May 2003.

� Detectable Byzantine Agreement Secure Against a Faulty Majority- ACM Symposium on the Principles of Distributed Computing (PODC), July 2002.

� Secure Multi-party Quantum Computation,- ACM Symposium on the Theory of Computing (STOC), May 2002.

� On Perfect and Adaptive Security in Exposure-Resilient Cryptography- Advances in Cryptology — Eurocrypt 2001, May 2001.

9