Issue 113 of the Bulletin of the EATCS is now available on line abd be downloaded as a single PDF file. As usual, the bulletin is freely accessible for everyone.
In the current issue, you will find very interesting survey articles on, for instance, the complexity of valued constraint satisfaction, kernelization and contextual semantics. I strongly recommend the first installment of the Concurrency Column edited by Nobuko Yoshida on recreational formal methods. The piece by Frits Vaandrager and Freek Verbeek tells us how to design vacuum cleaning trajectories using Uppaal, SAT solvers and theorem provers.
I hope that you will enjoy this issue of the BEATCS. At the EATCS general assembly, which will be held at ICALP 2014 in Copenhagen, we will discuss the developments of the BEATCS. Your input to the discussion is very valuable.
Sunday, June 29, 2014
Sunday, June 15, 2014
Sad news: Berthold Vöcking passed away
Berthold Vöcking, who was a professor for Algorithms and Complexity at RWTH Aachen, passed away on 11th June after a long illness. He was only 47.
Berthold was a leading figure in algorithmics research in Europe, was an invited speaker at ICALP 2012 and was one of the authors of the best paper for Track C at this year's ICALP, where we will remember him during the award session.
Our thoughts go to his family.
Addendum: For some information on Berthold's work, do read Sad News: Berthold Vöcking by Michael Mitzenmacher's blog.
Berthold was a leading figure in algorithmics research in Europe, was an invited speaker at ICALP 2012 and was one of the authors of the best paper for Track C at this year's ICALP, where we will remember him during the award session.
Our thoughts go to his family.
Addendum: For some information on Berthold's work, do read Sad News: Berthold Vöcking by Michael Mitzenmacher's blog.
Monday, June 09, 2014
Another computer scientist becomes rector of an Italian university
I just heard that Michele Bugliesi has been elected as the new rector of the Universita' Ca' Foscari in Venice. (Italian speaking readers may wish to look here for details.) Michele is yet another (theoretical) computer scientist who becomes rector of an Italian university. This is a sign of recognition for our discipline as a whole, as well as for the Italian computer science community.
I am sure that Michele will do a great job and I wish him the best of luck in his new, and challenging, role.
I am sure that Michele will do a great job and I wish him the best of luck in his new, and challenging, role.
Wednesday, June 04, 2014
Call for guest posts from ICALP 2014
If you are going to ICALP 2014 and you are willing to contribute guests posts on that conference on this blog, drop me a line. It would be good to have reports on the three tracks, on the invited talks and on the award-related events, as well as on the conference as a whole.
Tuesday, June 03, 2014
Helga Guðmundsdóttir lands one of Google’s 2014 Anita Borg Scholarships
My colleagues and I at the School of Computer Science at Reykjavik University are thrilled by the recent news that Helga Guðmundsdóttir, one of our master students and one of the very best BSc students we have ever had, has been selected as one of Google’s 2014 Anita Borg Scholarship recipients. Congratulations to Helga for this achievement!
Apart from being an outstanding student, who has already done some research in algorithms for wireless networks and has had successful internships at the Fraunhofer Center for Experimental Software Engineering (University of Maryland) and Cornell University, Helga is also a role model for our female students and fantastic ambassador for computer science. She is one of the founders of /sys/tur, the association of female computer scientists at Reykjavik University. I was amazed by how active the association is in promoting computer science at all our outreach events.
I don't need to look at my crystal ball to forecast a bright future for Helga and that she will go from strength to strength whatever she decides to do.
Apart from being an outstanding student, who has already done some research in algorithms for wireless networks and has had successful internships at the Fraunhofer Center for Experimental Software Engineering (University of Maryland) and Cornell University, Helga is also a role model for our female students and fantastic ambassador for computer science. She is one of the founders of /sys/tur, the association of female computer scientists at Reykjavik University. I was amazed by how active the association is in promoting computer science at all our outreach events.
I don't need to look at my crystal ball to forecast a bright future for Helga and that she will go from strength to strength whatever she decides to do.
Saturday, May 31, 2014
PhD positions in Computer Science at IMT Lucca (Italy)
As readers of this blog might have noticed already, IMT Lucca is one of the institutions in Italy that is close to my heart. I am therefore happy to advertise their ongoing call for applications for their PhD positions in Computer Science. Do encourage your students to apply: the terms of employment for PhD students are excellent and so are the facilities. The town of Lucca is lovely and has a very high quality of life. IMT is still relatively small, but it is a very ambitious graduate school.
If your students or you are interested, IMT will be holding a (free) interactive webinar on June 11 for any students interested in the program.
=========================================================
PhD
positions in Computer Science at IMT Lucca (Italy)
-
Deadline July 14, 2014 -
=========================================================
The
Institute for Advanced Studies IMT Lucca - Italy
(
announces multiple PhD scholarships (appx. €13,600/year),
that also include accommodation and full board.
Deadline
for application is July 14th, 2014 at 18:00 Italian time.
IMT
Lucca (Italy) is a research university within the Italian public
higher education system. IMT's mission is to establish itself as a
research center that promotes cutting-edge research in key areas,
structuring its PhD program in close connection with research, to
attract top students, researchers and scholars through competitive
international selections, and to contribute to technological
innovation, economic growth and social development.
The
three year doctoral program, which is taught entirely in English, is
articulated in curricula. The 8 curricula currently offered are
field-specific, although in many instances they share a common
scientific background. The
curriculum in Computer Science is coordinated by Rocco De Nicola and
focuses on key aspects of current research in the theory and
applications of informatics, such as open-endedness, autonomy,
security, concurrency, cost-effectiveness, quality of services, and
dependability.
The
main goal of the curriculum is to develop models, algorithms, and
verification methods for modern distributed systems. The doctoral
students enrolled in this curriculum will carry out cutting-edge
research on the fundamentals and applications of architectures and
languages for modern distributed systems, including global and cloud
computing systems, web systems and services, and mobile systems. They
will also acquire professional skills in the application of computer
technologies to massively distributed systems, working in close
collaboration with the SysMA research unit of IMT
(http://sysma.lab.imtlucca.it/).
Graduates from the curriculum are qualified to work in universities,
public and industrial research centers, and to take on professional
roles and high-profile tasks and responsibilities in both private
companies and public institutions.
PhD
students, besides receiving a research scholarship, are offered
on-campus housing on a newly restored and fully integrated San
Francesco Complex in the historical center of the beautiful Tuscan
city of Lucca, and daily access to the canteen. Students also get the
opportunity to spend research periods abroad during the program, with
the possibility of receiving additional financing through the
Erasmus+ program.
Please
note that students who are expected to obtain the required degree by
October 31, 2014 will also be considered; they must still apply by
July 14. Further details, along with online the application form, can
be found at:
Be
sure to sign up for our free interactive webinar
(http://brightrecruits.com/webinars/)
scheduled for June 11th
2014.
Thursday, May 08, 2014
Best paper awards at ICALP 2014
The EATCS is proud to announce that the program committees of the three tracks of ICALP 2014 have selected the following papers for the best paper awards:
The best student paper awards are given to papers that are solely authored by students. This year these awards will go to:
Congratulations to the award recipients and many thanks to the PC chairs and their PCs for their sterling work!
It is interesting to see that the best papers for 2014 are all from Europe, whereas two of the three best student papers are from the US. Having worked in Northern Europe for the best part of 20 years, I am happy to see that the best papers for Track A have Scandinavian authors.
I hope that you will enjoy reading the award-receiving papers.
Track A:
Andreas Björklund and Thore Husfeldt, Shortest Two Disjoint Paths in Polynomial Time
Track B:
Joel Ouaknine and James Worrell. Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
Track C:
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden and Berthold Voecking, Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
Track A:
Sune K. Jakobsen, Information Theoretical Cryptogenography
Track B:
Michael Wehar, Hardness Results for Intersection Non-Emptiness
Track C:
It is interesting to see that the best papers for 2014 are all from Europe, whereas two of the three best student papers are from the US. Having worked in Northern Europe for the best part of 20 years, I am happy to see that the best papers for Track A have Scandinavian authors.
I hope that you will enjoy reading the award-receiving papers.
Monday, May 05, 2014
CCC: request for volunteers, sponsoring & organizational meeting
Dieter van Melkebeek asked me to post the following message. See also here I encourage the members of the CCC community to reply by May 8.
As you may know, after a discussion period and a recent poll (see http://
(i) enough people are willing to make a commitment and help with this endeavor, and
(ii) we can gather the required startup funds.
VOLUNTEERING
Among other things we need volunteers for the following:
- setting up the conference: creating a non-profit organization, other potential legal issues, insurance, banking, sponsoring, proceedings, registration, record keeping;
- serving on the executive committee of the independent conference;
- local organization for conferences in the near future.
If you are willing to help, please let us know and be as specific as possible.
START-UP FUNDS
We'd like to get an idea of how much funding we'd be able to collect. We're considering two types:
- Funds that would be used to bootstrap the conference and are intended to be returned within three years. If you would be willing to contribute to this fund, please tell us how much.
- Permanent donations. If you know of contacts for possible donors (labs, institutions), please let us know.
ORGANIZATIONAL MEETING
If we decide to become independent, we'd set up an organizational meeting the day before and/or after CCC'14 in Vancouver, i.e., Tuesday 6/10 and/or Saturday 6/14. If you are volunteering as above, please include in your response the following:
- Would you be able to attend on Tuesday 6/10: Y/N
- Would you be able to attend on Saturday 6/14: Y/N
Please send your response by May 8 to dieter@cs.wisc.edu.
Thanks for your consideration!
As you may know, after a discussion period and a recent poll (see http://
(i) enough people are willing to make a commitment and help with this endeavor, and
(ii) we can gather the required startup funds.
VOLUNTEERING
Among other things we need volunteers for the following:
- setting up the conference: creating a non-profit organization, other potential legal issues, insurance, banking, sponsoring, proceedings, registration, record keeping;
- serving on the executive committee of the independent conference;
- local organization for conferences in the near future.
If you are willing to help, please let us know and be as specific as possible.
START-UP FUNDS
We'd like to get an idea of how much funding we'd be able to collect. We're considering two types:
- Funds that would be used to bootstrap the conference and are intended to be returned within three years. If you would be willing to contribute to this fund, please tell us how much.
- Permanent donations. If you know of contacts for possible donors (labs, institutions), please let us know.
ORGANIZATIONAL MEETING
If we decide to become independent, we'd set up an organizational meeting the day before and/or after CCC'14 in Vancouver, i.e., Tuesday 6/10 and/or Saturday 6/14. If you are volunteering as above, please include in your response the following:
- Would you be able to attend on Tuesday 6/10: Y/N
- Would you be able to attend on Saturday 6/14: Y/N
Please send your response by May 8 to dieter@cs.wisc.edu.
Thanks for your consideration!
PhD Scholarships at the Gran Sasso Science Institute
The Gran Sasso Science Institute is a new international PhD school and a centre for advanced studies in
physics, mathematics, computer science and social sciences. It is located in L'Aquila (Abruzzo, Italy) and enrolled its first bunch of PhD students this autumn. The first group of PhD students includes eight students in computer science and eight in mathematics. The institute has just advertised ten PhD fellowships, which might be of interest to your students or you. Please advertise them as you see fit.
The institute's organization mirrors the one of other international PhD schools in Italy and has strong ties with IMT Lucca. In particular, PhD students at GSSI receive a PhD stipend, free lodging and food vouchers and pay no tuition fees.
I arrived here on Thursday night to deliver a course. My first impression is positive: the staff at the institute are friendly and ready to assist guest professors and students, and the facilities seem good. I will try to write more on GSSI at a later time.
As an expat from Abruzzo myself (albeit from Pescara, a rival city of L'Aquila since it became the prominent centre in the region), I am happy to give my tiny contribution to the development of the GSSI, which I hope will become a permanent institute after the ministerial evaluation in three years' time.
------------ CALL for PhD Applications ----------------------------
The institute's organization mirrors the one of other international PhD schools in Italy and has strong ties with IMT Lucca. In particular, PhD students at GSSI receive a PhD stipend, free lodging and food vouchers and pay no tuition fees.
I arrived here on Thursday night to deliver a course. My first impression is positive: the staff at the institute are friendly and ready to assist guest professors and students, and the facilities seem good. I will try to write more on GSSI at a later time.
As an expat from Abruzzo myself (albeit from Pescara, a rival city of L'Aquila since it became the prominent centre in the region), I am happy to give my tiny contribution to the development of the GSSI, which I hope will become a permanent institute after the ministerial evaluation in three years' time.
------------ CALL for PhD Applications ----------------------------
10 fellowships at
GSSI L'AQUILA Italy, for the PhD program in
Computer
Science
In collaboration with IMT - Institute for Advanced Studies - Lucca
In collaboration with IMT - Institute for Advanced Studies - Lucca
Core Topics:
- Foundations of (Modern) Networks,
- Specification and Analysis of Concurrent Reactive Systems,
- Software Systems and Services.
- Foundations of (Modern) Networks,
- Specification and Analysis of Concurrent Reactive Systems,
- Software Systems and Services.
Download the call
for applications at
GSSI awards scholarships for 3
years.
The yearly amount of the
scholarship is of € 16.159,91 gross
Facilities and benefits
All PhD students will
receive free accommodation, tuition fees waived, free
luncheon vouchers.
Friday, May 02, 2014
Gödel Prize 2014 to Ronald Fagin, Amnon Lotem, and Moni Naor for Optimal Aggregation Algorithms for Middleware
Ronald Fagin, Amnon Lotem, and Moni Naor will receive the 2014 Gödel Prize for their paper Optimal Aggregation Algorithms for Middleware (http://researcher.watson.ibm.com/researcher/files/us-fagin/jcss03.pdf),
which introduced the powerful “threshold algorithm” that is widely used
in applications and systems that demand optimal results for gathering
multi-sourced information. The award, which recognizes outstanding
papers in theoretical computer science, is presented by the European
Association for Theoretical Computer Science (EATCS) and ACM’s Special
Interest Group on Algorithms and Computation Theory (SIGACT). The
ceremony takes place at the International Colloquium on Automata,
Languages, and Programming (ICALP) http://icalp2014.itu.dk/ July 7-11, in Copenhagen, Denmark.
The prize-winning paper provides a framework to design and analyze
algorithms where aggregation of information from multiple data sources
is needed, such as in information retrieval and machine learning. In
these situations, the threshold algorithm offers a very efficient method
for producing a single unified list of the “top k” results from the
combined data sources. The threshold algorithm’s elegant mathematical
properties and simplicity are particularly suitable for use in
middleware, software that is often used to augment computer operating
systems that support complex, distributed applications. The authors
also introduced the notion of instance optimality, an extremely strong
guarantee of performance, and showed that the threshold algorithm is
instance optimal. The paper’s groundbreaking results have built a
foundation for much follow-on research.
Congratulations to the award recipients and many thanks to the Gödel Prize Committee for this year!
Saturday, April 19, 2014
ACM SIGLOG chartered
After a journey of many years, ACM SIGLOG is now officially chartered and will play an important role in spreading the gospel of the intimate connections between logic and computation and in their further developments. Congratulations to all the people who worked very hard over the last seven years to make this happen!
Prakash Panangaden is the first SIGLOG chair and together with his team is working on getting the web site up and running and the SIGLOG Newsletter in shape for the first issue.
As a member of the research community and as current president of the European Association for Theoretical Computer Science, I wish SIGLOG the best of luck and look forward to a fruitful cooperation between the EATCS and SIGLOG.
For the moment I would like to encourage my readers to join SIGLOG officially.
The link is:
https://campus.acm.org/
One can join SIGLOG without joining the ACM.
Prakash Panangaden is the first SIGLOG chair and together with his team is working on getting the web site up and running and the SIGLOG Newsletter in shape for the first issue.
As a member of the research community and as current president of the European Association for Theoretical Computer Science, I wish SIGLOG the best of luck and look forward to a fruitful cooperation between the EATCS and SIGLOG.
For the moment I would like to encourage my readers to join SIGLOG officially.
The link is:
https://campus.acm.org/
One can join SIGLOG without joining the ACM.
Wednesday, April 16, 2014
Accepted papers for ICALP 2014
The list of accepted papers for ICALP 2014 is now available here. The PC chairs told me that the quality of the submissions was very good and the scientific programme for the conference looks mouth-watering. Apart from the contributed papers and the excellent invited speakers, there will also be three award presentations. The conference dinner also promises to be a cultural highlight and the Copenhagen Jazz Festival will be in full swing.
There is going to be a lot going on in Copenhagen for TCS buffs this summer, which makes it one of the two places to be. (The other is Vienna.)
I hope to see many of you at what will be a memorable ICALP. Thanks to Thore Husfeldt and his team for all the sterling work they are doing!
There is going to be a lot going on in Copenhagen for TCS buffs this summer, which makes it one of the two places to be. (The other is Vienna.)
I hope to see many of you at what will be a memorable ICALP. Thanks to Thore Husfeldt and his team for all the sterling work they are doing!
Monday, April 14, 2014
First EATCS Young Researcher School on Automata, Logic and Games
In the year 2013, the European Association for Theoretical Computer Science (EATCS) established a series of Young Researcher Schools on TCS topics. The first such school is devoted Automata, Logic and Games, and it will be held in Telc, Czech Republic, from July 27 to August 1, 2014.
The programme consists of five Basic Tutorials (four hours each) devoted to fundamental subjects, and eight Advanced Lectures (2 hours each) focussed on recent results and specific topics.
Basic Tutorials
---------------
- Probabilistic Model-Checking
Christel Baier (Dresden)
- Logic and Databases
Phokion G. Kolaitis (Santa Cruz)
- Games and Synthesis
Nir Piterman (Leicester)
- Logic and Automata
Wolfgang Thomas (Aachen)
- Timed Automata
Wang Yi (Uppsala)
Advanced Lectures
-----------------
- The Unbounding Quantifier
Mikolaj Bojanczyk (Warsaw)
- Robustness in Timed Systems
Patricia Bouyer-Decitre (Cachan)
- A Logic-Based Approach to Cloud Computing
Jan Van den Bussche (Hasselt)
- Regular Automata and Monadic Theory
Didier Caucal (Paris)
- Stochastic model checking - A continuous time perspective
Holger Hermanns (Saarbruecken)
- Synthesis of Recursive Programs
Martin Lange (Kassel)
- Infinite-State Probabilistic Systems
Richard Mayr (Edinburgh)
- Prophetic Automata
Thomas Wilke (Kiel)
Basic Tutorials
---------------
- Probabilistic Model-Checking
Christel Baier (Dresden)
- Logic and Databases
Phokion G. Kolaitis (Santa Cruz)
- Games and Synthesis
Nir Piterman (Leicester)
- Logic and Automata
Wolfgang Thomas (Aachen)
- Timed Automata
Wang Yi (Uppsala)
Advanced Lectures
-----------------
- The Unbounding Quantifier
Mikolaj Bojanczyk (Warsaw)
- Robustness in Timed Systems
Patricia Bouyer-Decitre (Cachan)
- A Logic-Based Approach to Cloud Computing
Jan Van den Bussche (Hasselt)
- Regular Automata and Monadic Theory
Didier Caucal (Paris)
- Stochastic model checking - A continuous time perspective
Holger Hermanns (Saarbruecken)
- Synthesis of Recursive Programs
Martin Lange (Kassel)
- Infinite-State Probabilistic Systems
Richard Mayr (Edinburgh)
- Prophetic Automata
Thomas Wilke (Kiel)
See http://eatcs-school.fi.muni.
Friday, April 11, 2014
Adam W. Marcus, Daniel A. Spielman and Nikhil Srivastava to receive the Pólya Prize 2014
According to the web site for the prize, Adam W. Marcus, Daniel A. Spielman and Nikhil Srivastava will receive the Pólya Prize 2014.
The George Pólya Prize, established in 1969, is given every two years, alternately in two categories: (1) for a notable application of combinatorial theory; (2) for a notable contribution in another area of interest to George Pólya such as approximation theory, complex analysis, number theory, orthogonal polynomials, probability theory, or mathematical discovery and learning.
There does not seem to be a press release on the SIAM web site, but this should not prevent us from congratulating Adam, Dan and Nikhil for receiving this award. Congrats!
The George Pólya Prize, established in 1969, is given every two years, alternately in two categories: (1) for a notable application of combinatorial theory; (2) for a notable contribution in another area of interest to George Pólya such as approximation theory, complex analysis, number theory, orthogonal polynomials, probability theory, or mathematical discovery and learning.
There does not seem to be a press release on the SIAM web site, but this should not prevent us from congratulating Adam, Dan and Nikhil for receiving this award. Congrats!
Sunday, March 23, 2014
Contemplate Ltd
These are days in which one of the outcomes of the work academics do, and one of the measures of its impact, is commercial exploitation of research and development carried out within the four walls of the "Ivory Tower". Universities the world over have different approaches towards commercial exploitation of research funding and IP rights and mine is no exception, apart from being a bit late in this game.
A discussion of IP policy issues might be the topic for a future post. Here I will just limit myself to pointing out an excellent example of a spin-off company from the University of Edinburgh, Contemplate Ltd, whose CTO and founder is Don Sannella. (Disclaimer: I have absolutely no connection with Contemplate myself!)
Contemplate was founded to commercialise research on static analysis done at the University of Edinburgh. Its product, ThreadSafe, pinpoints and helps to diagnose the most common and pernicious Java concurrency bugs. Concurrency is essential for high performance and low latency, but concurrent programming is hard to do right and therefore the use of automatic analysis tools should play an important role in the development of parallel software.
ThreadSafe is available as an easy-to-use Eclipse plug-in, which relates bug reports directly to the source code, and also as a SonarQube plugin (for team working). Also, by the end of March, as a command-line tool which generates an HTML report (for use with build tools).
This InfoQ article shows ThreadSafe in action finding concurrency errors in open source applications including Apache JMeter and K9Mail that are not caught by any other Java static analysis tool.
Free two-week trials are available from www.contemplateltd.com/
If you develop concurrent software with Java, I encourage you to try the tool.
A discussion of IP policy issues might be the topic for a future post. Here I will just limit myself to pointing out an excellent example of a spin-off company from the University of Edinburgh, Contemplate Ltd, whose CTO and founder is Don Sannella. (Disclaimer: I have absolutely no connection with Contemplate myself!)
Contemplate was founded to commercialise research on static analysis done at the University of Edinburgh. Its product, ThreadSafe, pinpoints and helps to diagnose the most common and pernicious Java concurrency bugs. Concurrency is essential for high performance and low latency, but concurrent programming is hard to do right and therefore the use of automatic analysis tools should play an important role in the development of parallel software.
ThreadSafe is available as an easy-to-use Eclipse plug-in, which relates bug reports directly to the source code, and also as a SonarQube plugin (for team working). Also, by the end of March, as a command-line tool which generates an HTML report (for use with build tools).
This InfoQ article shows ThreadSafe in action finding concurrency errors in open source applications including Apache JMeter and K9Mail that are not caught by any other Java static analysis tool.
Free two-week trials are available from www.contemplateltd.com/
If you develop concurrent software with Java, I encourage you to try the tool.
Saturday, March 15, 2014
EATCS-IPEC Nerode Prize 2014
The EATCS and IPEC are proud to announce that the Nerode Prize 2014 for outstanding papers in the area of multivariate algorithmics will be awarded to the following two papers:
- "On problems without polynomial kernels", Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin, Journal of Computer and System Sciences, 2009 and
- "Infeasibility of instance compression and succinct PCPs for NP", Lance Fortnow, Rahul Santhanam, Journal of Computer and System Sciences, 2011.
Congratulations to all the award recipients!
The presentation of the prize will take
place at IPEC 2014, which this year will be organized as part of ALGO
2014 (Wroclaw, Poland, 10-12 September 2014).
The Prize is named in honour of Anil Nerode, in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory.
The Nerode Prize 2014 Committee consists of Georg Gottlob (University of Oxford, UK), Jan Arne Telle (University of Bergen, Norway), and Peter Widmayer (ETH Zurich, Switzerland; chair).
The Prize is named in honour of Anil Nerode, in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory.
The Nerode Prize 2014 Committee consists of Georg Gottlob (University of Oxford, UK), Jan Arne Telle (University of Bergen, Norway), and Peter Widmayer (ETH Zurich, Switzerland; chair).
Thursday, March 13, 2014
ACM TALG Editor-in-Chief Search: Call for Nominations
Anne Condon asked me to distribute this call. Do consider nominating colleagues for this prestigious position.
Nominations are now open for the next editor-in-chief of the ACM Transactions on Algorithms. ACM TALG (web page: http://talg.acm.org/) publishes original research of the highest quality dealing with algorithms. It is a peer-reviewed journal, appearing quarterly. Specific areas of computation covered by the journal are listed at http://talg.acm.org/Aims.html.
We are looking for a well-established person with a strong record of research achievements and service, and with a vision for the future of the field. The term of appointment is three years, to begin late summer 2014, with the possibility of renewal for a second term. The editor-in-chief is responsible for faithfully executing the editorial charter of the journal yet should be proactive in
adapting the journal and its charter to changes in the field. A description of the duties of the EiC and evaluation criteria can be found at h ttp://www.acm.org/publications/policies/evaluation.
Professor Valerie King of the University of Victoria, Victoria, BC, Canada is Chair of the Search Committee. All nominees, including self-nominees, should send a CV and a Vision Statement for TALG (at least one page), with subject header “EiC nomination” to: val@uvic.ca
The deadline for nominations is Friday, May 16, 2014 at 11:59 p.m. (PST).
Nominations are now open for the next editor-in-chief of the ACM Transactions on Algorithms. ACM TALG (web page: http://talg.acm.org/) publishes original research of the highest quality dealing with algorithms. It is a peer-reviewed journal, appearing quarterly. Specific areas of computation covered by the journal are listed at http://talg.acm.org/Aims.html.
We are looking for a well-established person with a strong record of research achievements and service, and with a vision for the future of the field. The term of appointment is three years, to begin late summer 2014, with the possibility of renewal for a second term. The editor-in-chief is responsible for faithfully executing the editorial charter of the journal yet should be proactive in
adapting the journal and its charter to changes in the field. A description of the duties of the EiC and evaluation criteria can be found at h ttp://www.acm.org/publications/policies/evaluation.
Professor Valerie King of the University of Victoria, Victoria, BC, Canada is Chair of the Search Committee. All nominees, including self-nominees, should send a CV and a Vision Statement for TALG (at least one page), with subject header “EiC nomination” to: val@uvic.ca
The deadline for nominations is Friday, May 16, 2014 at 11:59 p.m. (PST).
Wednesday, March 12, 2014
February issue of the BEATCS on line
The 112nd issue of the EATCS Bulletin, is now available online for everyone at http://www.eatcs.org/beatcs/
If you prefer, you can download a pdf with the printed version of the bulletin from http://www.eatcs.org/images/
Thanks to Efi and Ioannis from our secretary office in Greece for all the work they have done on this issue and to the colleagues who contributed pieces to this issue of the BEATCS.
Readers of TCS blogs might notice that this issue of the BEATCS includes revised versions of two essays by Sanjeev Arora and Boaz Barak that had appeared earlier in Windows on Theory. Thanks to both Boaz and Sanjeev for agreeing to publish their pieces in the BEATCS!
The EATCS Bulletin has been open access for a few years now and we are happy to make it accessible also to interested readers who are not members of the association.
As you can read in my Letter from the President published in this issue, the EATCS has been taking several steps in support of young researchers, in addition to the instruments we had already in place. If you'd like to support these initiatives and forthcoming ones, consider joining the EATCS. The membership fee for one year (two years for young researchers) is 30€ and we offer a joint membership discount with SIGACT.
If you prefer, you can download a pdf with the printed version of the bulletin from http://www.eatcs.org/images/
Thanks to Efi and Ioannis from our secretary office in Greece for all the work they have done on this issue and to the colleagues who contributed pieces to this issue of the BEATCS.
Readers of TCS blogs might notice that this issue of the BEATCS includes revised versions of two essays by Sanjeev Arora and Boaz Barak that had appeared earlier in Windows on Theory. Thanks to both Boaz and Sanjeev for agreeing to publish their pieces in the BEATCS!
The EATCS Bulletin has been open access for a few years now and we are happy to make it accessible also to interested readers who are not members of the association.
As you can read in my Letter from the President published in this issue, the EATCS has been taking several steps in support of young researchers, in addition to the instruments we had already in place. If you'd like to support these initiatives and forthcoming ones, consider joining the EATCS. The membership fee for one year (two years for young researchers) is 30€ and we offer a joint membership discount with SIGACT.
Tuesday, March 11, 2014
9th SCANDINAVIAN LOGIC SYMPOSIUM: Call for submissions
Various topics in logic in computer science are of interest for this meeting. Consider submitting an abstract!
9th SCANDINAVIAN LOGIC SYMPOSIUM
25-27 August 2014, University of Tampere, Finland
http://www.sis.uta.fi/SLS2014/
SECOND ANNOUNCEMENT AND CALL FOR SUBMISSIONS
The 9th Scandinavian Logic Symposium will be held at the Museum Centre
Vapriikki in Tampere, Finland, during 25-27 August 2014 under the auspices
of the Scandinavian Logic Society (SLS, http://scandinavianlogic.org/)
As with previous editions of the Symposium, its primary aims are to
reflect the current activities in logic in the Nordic countries and to
provide a local meeting forum for their logical communities, broadly
conceived. Besides, it invites and warmly welcomes participation of
logicians from all over the world.
SCOPE AND TOPICS
The scope of SLS 2014 is broad, ranging over the whole areas of
Mathematical and Philosophical Logic, as well as Logical Methods in
Computer Science, Artificial Intelligence, Linguistics, etc. Major
topics include (but are not limited to): Proof Theory, Constructivism,
Model Theory, Set Theory, Computability Theory, Algebra and Logic,
Categorical Logic, Logic and Computer Science, Logic and Linguistics,
Logic in AI and Multi-Agent Systems, Logics of Games, Modal and other
non-classical Logics, Philosophical Logic.
INVITED SPEAKERS:
Mai Gehrke (LIAFA, Paris)
Volker Halbach (University of Oxford)
Asger Törnquist (University of Copenhagen)
Jouko Väänänen (University of Helsinki and University of Amsterdam)
Thomas Ågotnes (University of Bergen)
PROGRAM COMMITTEE
Co-chairs: Sara Negri (University of Helsinki)
and Valentin Goranko (Technical University of Denmark)
Members:
Luca Aceto (Reykjavik University)
Lars Birkedal (Aarhus University)
Patrick Blackburn (Roskilde University)
Patricia Blanchette (University of Notre Dame, US)
Thierry Coquand (University of Gothenburg)
Ali Enayat (University of Gothenburg)
Øystein Linnebo (University of Oslo and Birkbeck College London)
Kerkko Luosto (University of Tampere)
Dag Normann (University of Oslo)
Gabriel Sandu (University of Helsinki)
Arild Waaler (University of Oslo)
Dag Westerståhl (University of Stockholm)
ORGANISING COMMITTEE
Chair: Lauri Hella (University of Tampere)
Members:
Kerkko Luosto (University of Tampere)
Antti Kuusisto (University of Wroclaw)
Jonni Virtema (University of Tampere)
Jevgeni Haigora (University of Tampere)
SUBMISSIONS
Abstracts of contributed talks, in PDF format, not exceeding one A4
(11pt) page, should be submitted by April 25, 2014, through
EasyChair: https://www.easychair.org/
Abstracts should be typeset following the format of a LaTeX style
file that will be posted on the conference website on March 16.
IMPORTANT DATES:
Submission deadline: April 25, 2014
Notification: May 16, 2014
Final programme: July 25, 2014
LOCATION
Museum Centre Vapriikki is situated on the banks of the Tammmerkoski
rapids.
It is within a walking distance from the center of Tampere and the railway
station.
ACCOMMODATION
There are several hotels within a walking distance from the conference
venue. The organizers will provide a list of some alternatives on the
conference website.
REGISTRATION
Details concerning registration will be posted soon on the conference
website.
ENQUIRIES: Write email to scandinavianlogicsymposium@
9th SCANDINAVIAN LOGIC SYMPOSIUM
25-27 August 2014, University of Tampere, Finland
http://www.sis.uta.fi/SLS2014/
SECOND ANNOUNCEMENT AND CALL FOR SUBMISSIONS
The 9th Scandinavian Logic Symposium will be held at the Museum Centre
Vapriikki in Tampere, Finland, during 25-27 August 2014 under the auspices
of the Scandinavian Logic Society (SLS, http://scandinavianlogic.org/)
As with previous editions of the Symposium, its primary aims are to
reflect the current activities in logic in the Nordic countries and to
provide a local meeting forum for their logical communities, broadly
conceived. Besides, it invites and warmly welcomes participation of
logicians from all over the world.
SCOPE AND TOPICS
The scope of SLS 2014 is broad, ranging over the whole areas of
Mathematical and Philosophical Logic, as well as Logical Methods in
Computer Science, Artificial Intelligence, Linguistics, etc. Major
topics include (but are not limited to): Proof Theory, Constructivism,
Model Theory, Set Theory, Computability Theory, Algebra and Logic,
Categorical Logic, Logic and Computer Science, Logic and Linguistics,
Logic in AI and Multi-Agent Systems, Logics of Games, Modal and other
non-classical Logics, Philosophical Logic.
INVITED SPEAKERS:
Mai Gehrke (LIAFA, Paris)
Volker Halbach (University of Oxford)
Asger Törnquist (University of Copenhagen)
Jouko Väänänen (University of Helsinki and University of Amsterdam)
Thomas Ågotnes (University of Bergen)
PROGRAM COMMITTEE
Co-chairs: Sara Negri (University of Helsinki)
and Valentin Goranko (Technical University of Denmark)
Members:
Luca Aceto (Reykjavik University)
Lars Birkedal (Aarhus University)
Patrick Blackburn (Roskilde University)
Patricia Blanchette (University of Notre Dame, US)
Thierry Coquand (University of Gothenburg)
Ali Enayat (University of Gothenburg)
Øystein Linnebo (University of Oslo and Birkbeck College London)
Kerkko Luosto (University of Tampere)
Dag Normann (University of Oslo)
Gabriel Sandu (University of Helsinki)
Arild Waaler (University of Oslo)
Dag Westerståhl (University of Stockholm)
ORGANISING COMMITTEE
Chair: Lauri Hella (University of Tampere)
Members:
Kerkko Luosto (University of Tampere)
Antti Kuusisto (University of Wroclaw)
Jonni Virtema (University of Tampere)
Jevgeni Haigora (University of Tampere)
SUBMISSIONS
Abstracts of contributed talks, in PDF format, not exceeding one A4
(11pt) page, should be submitted by April 25, 2014, through
EasyChair: https://www.easychair.org/
Abstracts should be typeset following the format of a LaTeX style
file that will be posted on the conference website on March 16.
IMPORTANT DATES:
Submission deadline: April 25, 2014
Notification: May 16, 2014
Final programme: July 25, 2014
LOCATION
Museum Centre Vapriikki is situated on the banks of the Tammmerkoski
rapids.
It is within a walking distance from the center of Tampere and the railway
station.
ACCOMMODATION
There are several hotels within a walking distance from the conference
venue. The organizers will provide a list of some alternatives on the
conference website.
REGISTRATION
Details concerning registration will be posted soon on the conference
website.
ENQUIRIES: Write email to scandinavianlogicsymposium@
Friday, March 07, 2014
David Woodruff receives the Presburger Award 2014
The EATCS is proud to announce that the Presburger Award 2014 Committee has chosen David Woodruff (IBM Almaden Research Center) as the recipient of the Presburger Award 2014. Congratulations to David!
Since 2010, the Presburger Award has been given each year to a young
scientist (in exceptional cases to several young scientists) for
outstanding contributions in theoretical computer science, documented by
a published paper or a series of published papers. The award is named
after Mojzesz Presburger who accomplished his path-breaking work on
decidability of the theory of addition (which today is called Presburger
arithmetic) as a student in 1929. The Presburger Award 2014 is
sponsored by CWI Amsterdam and will be presented at ICALP 2014 in Copenhagen, Denmark.
David Woodruff, born in 1980, has made important contributions to the theory of data streams, both creating new algorithms, and demonstrating that certain algorithms cannot exist. His work has an impact on other fields, including compressed sensing, machine learning, and numerical linear algebra. In the area of data streams, he resolved the Distinct Elements Problem, simultaneously optimizing the amount of memory used, the time needed to process each new entity, and the time needed to report an estimate of the number of distinct elements in the stream. In the area of machine learning, he used his previous results on data streams to design sub-linear algorithms for linear classification and minimum enclosing ball problems. In numerical linear algebra, he developed the first algorithms for low rank approximation and regression that run in time proportional to the number of non-zero entries of the input matrix. His work also resulted in 17 patents related to data streams and their applications.
The 2014 Presburger Award Committee consisted of
David Woodruff, born in 1980, has made important contributions to the theory of data streams, both creating new algorithms, and demonstrating that certain algorithms cannot exist. His work has an impact on other fields, including compressed sensing, machine learning, and numerical linear algebra. In the area of data streams, he resolved the Distinct Elements Problem, simultaneously optimizing the amount of memory used, the time needed to process each new entity, and the time needed to report an estimate of the number of distinct elements in the stream. In the area of machine learning, he used his previous results on data streams to design sub-linear algorithms for linear classification and minimum enclosing ball problems. In numerical linear algebra, he developed the first algorithms for low rank approximation and regression that run in time proportional to the number of non-zero entries of the input matrix. His work also resulted in 17 patents related to data streams and their applications.
The 2014 Presburger Award Committee consisted of
| Antonin Kucera | Brno, chair |
| Claire Mathieu | ENS Paris |
| Peter Widmayer | Zurich |
Subscribe to:
Posts (Atom)