http://www.cncsis.ro/PN2_res_umana_prem_articole.php Metodologia de premiere s-a modificat fata de anii precedenti, premiile acordandu-se in functie de clasificarea revistei dupa factorul de impact.

We study the geometric structure of the set of solutions of random $epsilon$-1-in-k SAT problem. For $l geq 1$, two satisfying assignments $A$ and $B$ are $l$-connected if there exists a sequence of satisfying assignments connecting them by changing at most $l$ bits at a time. We first identify a subregion of the satisfiable phase where the set of solutions provably forms one cluster. Next we provide a range of parameters $(c,epsilon)$ such that

"The use of citations to determine the quality of academic work in the hard sciences is to be abandoned in favour of peer review in the new system being designed to replace the research assessment exercise. However, information about the number of citations a scholar's work accrues could be provided to assessment panels to help "inform" their judgments in a range of subjects." Full text: http://www.timeshighereducation.co.uk/story.asp?sectioncode=26&storycode=407041&c=2

http://www.edge.org/3rd_culture/tapscott09/tapscott09_index.html

Conform http://www.alinagorghiu.ro/?p=604

http://www.dilemaveche.ro/index.php?cmd=sectiune&nr=277&s=12 Unul din articole e un interviu cu Roxana Bojariu, membru Ad Astra.

http://venturebeat.com/2009/06/05/rajeev-motwani-google-founders-professor-and-early-investor-dies/ Rajeev Motwani has received the 2001 Godel Prize, jointly awarded by ACM SIGACT and EATCS, for his work on the PCP theorem. He was the mentor of Google founders, Larry Page and Sergey Brin. He was (among many other things) the author of "Randomized Algorithms", a well-known textbook published by Cambridge University Press.

http://www.timeshighereducation.co.uk/story.asp?sectioncode=26&storycode=405789

http://www.acm.org/press-room/news-releases/goedel-prize-09/view

http://www.nytimes.com/2009/04/27/opinion/27taylor.html?emc=eta1