dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Postdoc position in SAT solving at KTH Royal Institute of
Technology (Jakob Nordström)
2. PhD position in SAT solving at KTH Royal Institute of
Technology (Jakob Nordström)
3. EUROCOMB 2017 - 2ND ANNOUNCEMENT (Michael Drmota)
----------------------------------------------------------------------
Message: 1
Date: Wed, 14 Dec 2016 22:28:50 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoc position in SAT solving at KTH Royal
Institute of Technology
Message-ID: <1481754531775.62521@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
The TCS Group at KTH Royal Institute of Technology invites applications for a postdoc position in computer science focused on SAT solving.
KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.
The postdoctoral researcher will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving.
The research project is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of two postdoctoral researchers and four PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.
Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.
This postdoc position is a full-time employed position for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.
The application deadline is January 15, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2016-0872-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .
------------------------------
Message: 2
Date: Wed, 14 Dec 2016 23:40:03 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD position in SAT solving at KTH Royal Institute
of Technology
Message-ID: <1481758804829.53302@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in computer science focused on SAT solving.
KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.
The PhD student will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving (basically 0/1 integer linear programming).
The research project is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of two postdoctoral researchers and four PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.
This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate is expected to start at the latest in August-September 2017, although this is to some extent negotiable. The position is fully funded and comes with a competitive salary.
The application deadline is January 15, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2016-0833-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .
------------------------------
Message: 3
Date: Thu, 15 Dec 2016 09:39:05 +0100
From: Michael Drmota <michael.drmota@tuwien.ac.at>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] EUROCOMB 2017 - 2ND ANNOUNCEMENT
Message-ID: <585256A9.8010907@tuwien.ac.at>
Content-Type: text/plain; charset="utf-8"; format=flowed
************************************************************
2nd ANNOUNCEMENT AND CALL FOR PAPERS
EUROPEAN CONFERENCE ON COMBINATORICS,
GRAPH THEORY AND APPLICATIONS
EUROCOMB 2017
http://www.dmg.tuwien.ac.at/eurocomb2017/
Vienna, August 28 - September 1, 2017
************************************************************
The conference Eurocomb 2017 will take place at the TU Wien (Vienna,
Austria)
from August 28 - September 1, 2017.
SCOPE.
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague),
EuroComb'05 (Berlin),
Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), Eurocomb'11 (Budapest),
Eurocomb'13 (Pisa),
and Eurocomb'15 (Bergen), this conference will cover the full range of
Combinatorics and Graph Theory
including applications in other areas of Mathematics, Computer Science
and Engineering.
Topics include, but are not limited to:
Algebraic Combinatorics
Combinatorial Geometry
Combinatorial Number Theory
Combinatorial Optimization
Designs and Configurations
Enumerative Combinatorics
Extremal Combinatorics
Graph Theory
Ordered Sets
Random Methods
Topological Combinatorics
IMPORTANT DATES:
Abstract Submission deadline : March 15th, 2017
Nomination for the European Prize in Combinatorics, April 15th, 2017
Abstract Acceptance: April 30th, 2017
Full paper deadline: May 27th, 2017
Early registration deadline: June 30, 2017
Conference: August 28 - September 1, 2017
ORGANIZATION:
The conference is organized in Vienna at the TU Wien, in collaboration
with the University of Vienna,
the TU Graz, and the Center for Discrete Mathematics, Theoretical
Computer Science
and Applications (DIMATIA) of Charles University.
CONFERENCE POSTER:
http://www.dmg.tuwien.ac.at/eurocomb2017/wp-content/uploads/2016/12/Eurocomb-Poster-1.pdf
CONTACT:
The organizing committee can be contacted at: michael.drmota@tuwien.ac.at
For up to date information consult the conference web site:
http://www.dmg.tuwien.ac.at/eurocomb2017/
INVITED SPEAKERS
Guillaume Chapuy, Université Paris Diderot
Julia Chuzhoy, University of Chicago
Irit Dinur, Weizmann Institute
Zoltan Füredi, Hungarian Acad. Sci
Yoshi Kohayakawa, Universidade de São Paulo
Andrew Suk, University of Illinois at Chicago
Endre Szemeredi, Alfréd Rényi Institute
Lauren Williams, University of California, Berkeley
Gerhard Wöginger, RWTH Aaachen
Paul Wollan, University of Rome
SUBMISSIONS
Submission should have: A title, a list of authors with affiliations,
and a brief abstract
(up to 5 pages in A4) describing recent original theoretical results or
applications of
Combinatorics and Graph Theory. They should be submitted as a pdf-file
using the interface provided at
https://easychair.org/conferences/?conf=eurocomb2017
by March 15th, 2017.
FULL PAPERS/POSTERS
Submission can be accepted either as a full paper or as poster. An
author for each accepted paper (as full or poster)
is required to register at the conference (at academic/speaker rate).
Authors of full papers will deliver a 20 min presentation of their results.
Authors of posters will deliver a 5 min presentation of their results
and participate in a poster session.
PROCEEDINGS
A proceedings book will be edited. The proceedings will include full
papers (5 pages limit) and poster papers (1 page limit).
JOURNAL SPECIAL ISSUE
It is planned to publish a special issue in a Combinatorics Journal that
will be devoted to selected papers contributed to the conference.
The usual high standards of the journals will be applied through a
strict and thorough refereeing process.
EUROPEAN PRIZE IN COMBINATORICS
Continuing with the tradition established at EuroComb'03 in Prague the
European Prize in Combinatorics
will be awarded during the conference EuroComb 2017. The prize is
established to recognize excellent
contributions in Combinatorics, Discrete Mathematics and their
Applications by young European researchers
(eligibility of EU) not older than 35. The prize carries a monetary
award of 2500 Euro.
The nomination letter including CV and the list of publications of the
nominee must be sent
to the organizers of EUROCOMB'17 before April 15, 2017. The nominations
will be evaluated by an
international jury. The award of 2500 EURO for 2017 is founded with
contributions
of DIMATIA, local organizers and Elsevier B.V.
Looking forward to see you in Vienna.
Michael Drmota and Jarik Nesetril
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 106, Issue 18
***************************************
No comments:
Post a Comment