[Newsletter PoDM ] Principles of Data Management, Newsletter 27, March 2021
newsletter at databasetheory.org
newsletter at databasetheory.org
Fri Mar 5 09:21:53 UTC 2021
PoDM Newsletter 27, March 2021
The newsletter on Principles of Data Management from databasetheory.org
TABLE OF CONTENTS
CONFERENCE ANNOUNCEMENTS
ICDT 2021 IS COMING ONLINE
JOB ANNOUNCEMENTS
PHD POSITIONS, Berlin
AWARD ANNOUNCEMENTS
2021 ACM PODS ALBERTO O. MENDELZON TEST-OF-TIME AWARD
Announcement of the winners
ACKERMANN AWARD 2021 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
Call for nominations
VCLA INTERNATIONAL STUDENT AWARDS 2021
Preliminary information
---------------------------------------------------------------------
CONFERENCE ANNOUNCEMENTS
ICDT 2021 IS COMING ONLINE
* We remind you that ICDT 2021 is taking place online during March 23-26. In addition to the papers
selected by the ICDT PC, the program will include keynote speeches by Katja Hose, Pablo Barceló,
Felix Naumann, and Julia Stoyanovich, as well as an invited talk by Jerzy Marcinkowski.
* Registrants will get access to all “online” sessions of the event and maximum possible academic
and social engagement as well as access to all “offline” activities of the conference (videos on
youtube, proceedings, etc.) Details and registration at https://edbticdt2021.cs.ucy.ac.cy/
* Looking forward to meeting you online!
Demetris Zeinalipour and Panos K. Chrysanthis (EDBT/ICDT General Chairs)
Ke Yi (ICDT PC Chair)
---------------------------------------------------------------------
JOB ANNOUNCEMENTS
* PHD POSITIONS
* Berlin
* The Research Training Group (Graduiertenkolleg) FACETS OF COMPLEXITY (http://www.facetsofcomplexity.de/ ) funded by the German Science Foundation (DFG) offers up to 8 Ph.D. POSITIONS (75% E13 TV-L).
* Starting date: mid 2021. Duration: three years.
* Application deadline: March 22, 2021
* The scientific program includes Complexity of algorithms, Complexity of combinatorial structures, Complexity of geometric structures, and Complexity of graphs and networks.
* The program is a joint initiative of scientists at the three major Berlin universities Freie Universitaet Berlin (FU), Technische Universitaet Berlin (TU), and Humboldt-Universitaet zu Berlin (HU).
* The program of the Research Training Network includes a regular Monday afternoon colloquium, block courses, summer schools, research workshops, etc. - all this in a very lively Berlin discrete mathematics and algorithmics environment, which also includes the BERLIN MATHEMATICAL SCHOOL (http://www.math-berlin.de), the joint international graduate
program of the three major Berlin universities.
* We offer a family-friendly work environment, a strong mentoring and counseling program, as well as special programs for female scientists.
* The salary for this position on the official German TV-L Berliner Hochschulen salary scale (75% TVL 13) depends on age, marital status, children, and amounts to approximately 20,000 EUR net per annum.
* See the official announcement for more information, in particular
regarding the required application documents:
<http://www.facetsofcomplexity.de/news/up-to-8-phd-positions.html>
* Applications should be directed to the coordinator, Ita Brunke, Tel. +49 30-838 52683, <mailto:i.brunke at inf.fu-berlin.de?Subject=Ph.D.-Application-FACETS>.
* Questions can also be directed to the spokesman, Guenter Rote
<mailto:rote at inf.fu-berlin.de?Subject=Ph.D.-Position-FACETS>.
---------------------------------------------------------------------
AWARD ANNOUNCEMENTS
2021 ACM PODS ALBERTO O. MENDELZON TEST-OF-TIME AWARD
Announcement of the winners
* The ACM PODS Alberto O. Mendelzon Test-of-Time Award is awarded
every year to a paper or a small number of papers published in the
PODS proceedings ten years prior that had the most impact in terms of
research, methodology, or transfer to practice over the intervening
decade. The award was established in 2007 and was awarded for the
first time in 2008. More information about the award is available at
http://www.sigmod.org/the-pods-pages/acm-pods-alberto-o.-mendelzon-test-of-time-award
* It is our great pleasure to announce the winner of the 2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award:
* Hossein Jowhari, Mert Sağlam and Gábor Tardos: Tight bounds for Lp
samplers, finding duplicates in streams, and related problems
* CITATION: This paper addresses a question posed by Cormode et al. in VLDB 2005, namely whether a
uniform (or nearly uniform) sample can be maintained in a dynamically changing
database, where data items may be inserted and deleted, while using space much smaller
than the size of the database. More generally, it considers maintaining an Lp sample,
where an element must be sampled with probability proportional to w^p (possibly up to
some small relative error), where w is a weight that may change dynamically. In SODA
2010 Monemizadeh and Woodruff showed that it is possible to perform Lp sampling in a
stream using polylogarithmic space. The PODS 2011 paper of Jowhari, Sağlam and Tardos
essentially closes the problem by presenting algorithms with improved space usage, as
well as a matching lower bound showing that it is not possible to asymptotically
improve the upper bounds. The paper has had a considerable impact on the design of
algorithms in streaming and distributed models of computation, where Lp sampling has
become an essential part of the toolbox. The survey "Lp Samplers and Their
Applications" in ACM Computing Surveys (2019) presents a number of surprising
applications, for example in graph algorithms and in randomized numerical linear
algebra.
* The award will be presented to the authors during the 2021 ACM SIGMOD/PODS Conference.
* Congratulations to this year's winners!
* Angela Bonifati, Rasmus Pagh, Thomas Schwentick (chair)
ACM PODS Alberto O. Mendelzon Test-of-Time Award Committee for 2021
ACKERMANN AWARD 2021 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
Deadline: 1 July 2021
* INTRODUCTION
Nominations are now invited for the 2021 Ackermann Award.
* ELIGIBILITY
PhD dissertations in topics specified by the CSL and LICS
conferences, which were formally accepted as PhD theses at a
university or equivalent institution between 1 January 2019 and 31 December 2020
are eligible for nomination for the award.
* PRESENTATION OF THE AWARD
The 2021 Ackermann award will be presented to the recipient(s) at CSL
2022, the annual conference of the EACSL. The award consists of a certificate, an invitation to present
the thesis at the CSL conference, the publication of the laudatio in
the CSL proceedings, an invitation to the winner to publish the
thesis in the FoLLI subseries of Springer LNCS,
and financial support to attend the conference.
* JURY
The jury consists of:
* Christel Baier (TU Dresden);
* Michael Benedikt (Oxford University);
* Mikolaj Bojanczyk (University of Warsaw);
* Jean Goubault-Larrecq (ENS Paris-Saclay);
* Prakash Panangaden (McGill University);
* Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL;
* Thomas Schwentick (TU Dortmund) , the president of EACSL;
* Alexandra Silva, (University College London), ACM SigLog representative.
The jury is entitled to give the award to more (or less) than one dissertation in a year.
* WHAT TO SUBMIT
The candidate or his/her supervisor should submit
1. the thesis (ps or pdf file);
2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file); it is recommended to not squeeze as much
material as possible into these 20 pages, but rather to use them
for a gentle introduction and overview, stressing the novel results obtained
in the thesis and their impact;
3. a supporting letter by the PhD advisor and two supporting letters
by other senior researchers (in English);
supporting letters can also be sent directly to Thomas Schwentick
(thomas.schwentick at tu-dortmund.de);
4. a short CV of the candidate;
5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period.
* HOW TO SUBMIT
The submission should be sent by e-mail as attachments to the chairman
of the jury, Thomas Schwentick: thomas.schwentick at tu-dortmund.de, with
** Subject: Ackermann Award 2021 Submission
** Text: Name of candidate, list of attachments
The deadline for submission is 1 July 2021.
VCLA INTERNATIONAL STUDENT AWARDS 2021
Preliminary information
http://www.vcla.at/vcla-awards/
The VCLA Awards for outstanding Master and Bachelor Theses 2021 have been postponed.
The call will be announced in the coming weeks.
Eligibility for nomination: Bachelor and Master degrees conferred between 15.11.2019 and 31.12.2020 in the field s of Computational Logic, Databases, Artificial Intelligence, Verification, Algorithms and Computational Complexity, and Formal Methods.
Please send all inquiries to award (AT) logic-cs.at
-----------------------------------------------------------
The next issue of this newsletter is scheduled for early May 2021. Please
submit your announcements to newsletter-owner at databasetheory.org
until April 30. Please follow the formatting instructions at
databasetheory.org/newsletter.
Past issues of the newsletter can be found at databasetheory.org/newsletter.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 833 bytes
Desc: Message signed with OpenPGP
URL: <http://databasetheory.org/pipermail/newsletter/attachments/20210305/59f82482/attachment.sig>
More information about the newsletter
mailing list