A General Collision-Avoiding Flocking Framework

Authors: Cucker, F., Dong, J.-G.

Source: IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 56(5):1124-1129 May, 2011

Avoiding Collisions in Flocks

Authors: Cucker, F., Dong, J.-G.

Source: IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 55(5):1238-1243 May, 2010

Emergent Behavior in Flocks

Authors: Cucker, F., Smale, S.

Source: IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 52(5):852-862 May, 2007

The Legacy of Turing in Numerical Analysis
Current trends in theory and practice of computer science; SOFSEM 2012

Authors: Cucker, F.

Source: LECTURE NOTES IN COMPUTER SCIENCE. (7147):1-13

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN081181675&indx=1&recIds=ETOCCN081181675

A note on parallel and alternating time
Algorithms and complexity for continuous problems: Issue dedicated to Professor Henryk Wozniakowski

Authors: Cucker, F., Briquel, I.

Source: JOURNAL OF COMPLEXITY. 23(NO 4/6):594-602

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN067015354&indx=1&recIds=ETOCCN067015354

Exotic Quantifiers, Complexity Classes, and Complete Problems
International colloquium on automata, languages and programming, ICALP 2007

Authors: Burgisser, P., Cucker, F.

Source: LECTURE NOTES IN COMPUTER SCIENCE. (4596):207-218

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN065035831&indx=1&recIds=ETOCCN065035831

The Complexity of Semilinear Problems in Succinct Representation
Fundamentals of computation theory: 15th International Symposium, FCT 2005

Authors: Burgisser, P., Cucker, F., de Naurois, P. J.

Source: LECTURE NOTES IN COMPUTER SCIENCE. (3623 2005.):479-490

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN056701823&indx=1&recIds=ETOCCN056701823

Condition Length and Complexity for the Solution of Polynomial Systems

Authors: Armentano, D., Beltrán, C., Bürgisser, P., Cucker, F., Shub, M.

Source: FOUNDATIONS OF COMPUTATIONAL MATHEMATICS. 16(6):1401-1422

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN380997070&indx=1&recIds=ETOCRN380997070

Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets
Theory of computing; STOC 36

Authors: Burgisser, P., Cucker, F.

Source: ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING. 36:475-485

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN053527241&indx=1&recIds=ETOCCN053527241

Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem
Learning theory and practice; methods, models and applications

Authors: Cucker, F., Smale, S.

Source: NATO SCIENCE SERIES SUB SERIES III COMPUTER AND SYSTEMS SCIENCES. 190:29-46

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN048176471&indx=1&recIds=ETOCCN048176471

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
Foundations of software science and computation structures; 6th international conference, FOSSACS 2003, held as part of the joint European Conferences on Theory and Practice of Software, ETAPS

Authors: Bournez, O., Cucker, F., de Naurois, P. J., Marion, J.-Y.

Source: LECTURE NOTES IN COMPUTER SCIENCE. :185-199

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN047472246&indx=1&recIds=ETOCCN047472246

Three lectures on real computation
Aspects of complexity:; minicourses in algorithmics, complexity and computational algebra

Authors: Cucker, F.

Source: DE GRUYTER SERIES IN LOGIC AND ITS APPLICATIONS. (4):29-50

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN057294862&indx=1&recIds=ETOCCN057294862

There Are No Sparse NP~W-Hard Sets
International symposium on mathematical foundations of computer science; Mathematical foundations of computer science 2001

Authors: Cucker, F., Grigoriev, D.

Source: LECTURE NOTES IN COMPUTER SCIENCE. :285-291

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN040586623&indx=1&recIds=ETOCCN040586623

Solving second-order conic systems with variable precision

Authors: Cucker, F., Peña, J., Roshchina, V.

Source: MATHEMATICAL PROGRAMMING. 150(2):217-250

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN369041507&indx=1&recIds=ETOCRN369041507

A Randomized Homotopy for the Hermitian Eigenpair Problem

Authors: Armentano, D., Cucker, F.

Source: FOUNDATIONS OF COMPUTATIONAL MATHEMATICS. 15(1):281-312

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN366337154&indx=1&recIds=ETOCRN366337154

Fast computation of zeros of polynomial systems with bounded degree under finite-precision

Authors: Briquel, I., Cucker, F., Pena, J., Roshchina, V.

Source: MATHEMATICS OF COMPUTATION. 83(287):1279-1318

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN353310080&indx=1&recIds=ETOCRN353310080

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

Authors: Bürgisser, P., Cucker, F., Lairez, P.

Source: Journal of the Association for Computing Machinery. 66(1):Article 5-Article 5

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN618938412&indx=1&recIds=ETOCRN618938412

On the Average Condition of Random Linear Programs

Authors: Cheung, D., Cucker, F.

Source: SIAM JOURNAL OF OPTIMIZATION. 23(2):799-810

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN338576169&indx=1&recIds=ETOCRN338576169

A numerical algorithm for zero counting. III: Randomization and condition

Authors: Cucker, F., Krick, T., Malajovich, G., Wschebor, M.

Source: ADVANCES IN APPLIED MATHEMATICS. 48(1):215-248

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN300981769&indx=1&recIds=ETOCRN300981769

On a problem posed by Steve Smale

Authors: Burgisser, P., Cucker, F.

Source: ANNALS OF MATHEMATICS. 174(3):1785-1836

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCRN305669116&indx=1&recIds=ETOCRN305669116