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. VCLA International Student Awards (Robert Ganian)
2. Multiple Postdoctoral Programs at the Israeli center of
research excellence in Algorithms (Yossi Azar)
3. Last two weeks: FUTURE COMPUTING 2016 || March 20 - 24, 2016
- Rome, Italy (Cristina Pascual)
4. 15th International Symposium on Experimental Algorithms (SEA
2016): Call for Papers (Alexander S. Kulikov)
5. PostDoc / PhD Positions in Algorithms at Hasso Plattner
Institute Potsdam (Tobias Friedrich)
----------------------------------------------------------------------
Message: 1
Date: Wed, 11 Nov 2015 17:00:47 +0100
From: Robert Ganian <rganian@gmail.com>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] VCLA International Student Awards
Message-ID:
<CADesQ5HoNqvR01bK=LnhAjaCi2vQ8_kSz0Hx0ruMjuvTRP9e_Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The Vienna Center for Logic and Algorithms announces the 2015 edition of the
***** VCLA International Student Awards *****
and calls for the nomination of authors of outstanding scientific
works in the field of Logic and Computer Science, in the following two
categories:
* Outstanding Master Thesis Award
* Outstanding Undergraduate Research Award (Bachelors or equivalent)
In both categories, the work must make an original contribution to a research
field that can be classified as part of Logic in Computer Science, understood
broadly as the use of logic as a tool that enables computer programs to reason
about the world.
The main areas of interest are:
* Databases and Artificial Intelligence
* Verification
* Computational Logic
The committee will select a winner for each category.
The winners will be invited to Vienna to present their project and participate
in a festive award ceremony. Additionally, the Outstanding Master Thesis Award
category is accompanied by a prize of 1,200 Eur, and the Outstanding
Undergraduate Research Award by a prize of 800 Eur.
Important dates:
Nomination deadline *extended*: November 22, 2015 (AoE)
Notification of the committee's decision: early February 2016
Award ceremony: Spring 2016
For more information, please see http://logic-cs.at/award/award-call-2015/
------------------------------
Message: 2
Date: Wed, 11 Nov 2015 19:02:06 +0200
From: Yossi Azar <azar@tau.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Multiple Postdoctoral Programs at the Israeli center
of research excellence in Algorithms
Message-ID:
<20151111190206.Horde.8TvHYjs3Qx1WQ3SOJnQ21rA@webmail.tau.ac.il>
Content-Type: text/plain; charset=UTF-8; format=flowed; DelSp=Yes
Multiple Postdoctoral Programs at the Israeli center of
research excellence in Algorithms
------------------------------------
We are seeking excellent candidates for three postdoctoral programs:
1. I-CORE in Algorithms postdoctoral program
2. I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
I-CORE in Algorithms postdoctoral program
------------------------------------------
We are seeking excellent candidates for postdoctoral positions at the
I-CORE ALGO (Israeli center of research excellence in algorithms)
institutes. The positions are supported by the Israeli Science
Foundation (ISF).
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the Government of Israel and adopted by
Israel's Council of Higher Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The institutes participating in the center are:
* The Blavatnik School of Computer Science, Tel Aviv University
* The Rachel and Selim Benin School of Computer Science and
Engineering, The Hebrew University of Jerusalem,
* Faculty of Mathematics and Computer Science, Weizmann Institute of
Science.
Topics of interest include (but are not limited to): all variety of
algorithms (optimization, online, streaming, approximation,
randomized, geometric and more), cryptography, security and privacy,
algorithmic game theory, quantum computing, networking and distributed
computing, databases, machine learning and computer vision.
To apply please send the following to icorealgo@cs.tau.ac.il[1]
(deadline: 15/12/15)
* A CV of the applicant including the list of publications.
* A short research statement.
* The preferable I-CORE ALGO fellow to work with (if already known)
and institution in I-CORE ALGO. (There is a possibility of more than
one fellow and/or institution.)
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with
the subject line "<candidate_name>: recommendation". (It is the
applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
The deadline is 15th December 2015, 24:00 (at GMT+1)
I-CORE in Algorithms and the Simons Institute for the Theory of Computing
in Berkeley - a joint postdoctoral program
-------------------------------------------------------------------------------
------------------------------------
I-CORE Algo – Israeli Center of Research Excellence in algorithms, and
the Simons Institute for the Theory of Computing are seeking excellent
candidates for a joint postdoctoral program starting in the academic
year 2016-2017.
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the Government of Israel and adopted by
Israel's Council of Higher Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The members of the center are some of Israel's most
exceptional computer scientists, from The Blavatnik School of Computer
Science in Tel Aviv University, The Rachel and Selim Benin School of
Computer Science and Engineering in The Hebrew University of
Jerusalem, and the Faculty of Mathematics and Computer Science in
Weizmann Institute of Science.
The Simons Institute for the Theory of Computing is an exciting new
venue for collaborative research in theoretical computer science and
related fields. The Institute is housed in a dedicated building on the
UC Berkeley campus, and acts as a vibrant and welcoming environment
for visiting researchers. In each academic semester the activities of
the Institute are largely focused on specific research programs, each
of which attracts thirty to forty participants ranging from senior
scientists to graduate students. The Simons Institute for the Theory
of Computing was created in 2012 through a ten-year grant from the
Simons Foundation (more information can be found at:
http://simons.berkeley.edu/fellows2015).
The joint postdoctoral position would start in Fall 2016. The joint
post-doctoral fellow will first spend a semester (Fall 2016) at the
Simons Institute, and then will continue at the I-Core in Algorithms
for the remainder of the academic year. The topics of the research
programs for Fall 2016 in the Simons Institute are "Logical Structures
in Computation" and "Algorithms and Uncertainty". The topics of the
research programs for Spring 2017 in the Simons Institute are
"Foundations of Machine Learning" and "Pseudorandomness". The topics
of research in I-CORE in Algorithms include (but are not limited to):
all variety of algorithms (optimization, online, streaming,
approximation, randomized, geometric and more), cryptography, security
and privacy, algorithmic game theory, quantum computing, networking
and distributed computing, databases, machine learning and computer
vision. The research interests of potential candidates should match
the research interests of both institutions.
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
We particularly encourage applications from outstanding women and
minority candidates. In addition, the I-CORE in Algorithms would
provide some support to travel to and from Israel.
In some circumstances, the fellowship maybe be awarded for more than
one year, up to a maximum of two years.
APPLICATION INSTRUCTIONS
Each applicant should submit the following documents (as pdf files) in
a single email to icorealgo@cs.tau.ac.il[1].
- cover letter, including current institution and employment status,
(expected) date of PhD, and a statement indicating the Simons
Institute program (or programs) in which you wish to participate, and
why. For the I-CORE Algo please indicate which institute you would
like to perform the research at (can be more than one);
- curriculum vitae, including full list of publications;
- research statement;
- names and email addresses of at least three recommenders.
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with
the subject line "<candidate_name>: recommendation". (It is the
applicant's responsibility to ensure that the letters are sent; I-CORE
will not solicit letters directly.)
The deadline for receipt of all application materials, including
letters, is December 15, 2015.
Links:
------
[1]
https://webmail.tau.ac.il/horde/imp/message.php?mailbox=SU5CT1g&uid=1697376580#
------------------------------
Message: 3
Date: Thu, 12 Nov 2015 09:13:11 +0100
From: Cristina Pascual<cris.pascual.gonzalez@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Last two weeks: FUTURE COMPUTING 2016 || March 20 -
24, 2016 - Rome, Italy
Message-ID: <201511120813.tAC8DAmj005015@smtp.upv.es>
Content-Type: text/plain; charset=us-ascii
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to:
- FUTURE COMPUTING 2016, The Eighth International Conference on Future Computational Technologies and Applications
The submission deadline is November 24, 2015.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== FUTURE COMPUTING 2016 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
FUTURE COMPUTING 2016, The Eighth International Conference on Future Computational Technologies and Applications
General page: http://www.iaria.org/conferences2016/FUTURECOMPUTING16.html
Submission page: http://www.iaria.org/conferences2016/SubmitFUTURECOMPUTING16.html
Events schedule: March 20 - 24, 2016 - Rome, Italy
Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]
Proposals for:
- mini symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posed on www.iaria.org]
- panels: [slide-deck posed on www.iaria.org]
Submission deadline: November 24, 2015
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the editorial rules: http://www.iaria.org/editorialrules.html
FUTURE COMPUTING 2016 Topics (for topics and submission details: see CfP on the site)
Call for Papers: http://www.iaria.org/conferences2016/CfPFUTURECOMPUTING16.html
============================================================
Special sessions:
Special sessions on "Memristor-based Computation and Technologies"
Special sessions on "Quantum Computing"
General tracks
Computational intelligence strategies
Cognitive computing; Intelligent computation; Ambient computing; Unconventional computing; Indeterminist computing; Adaptive computation; Autonomic computation; Computation under uncertainty; Chaotic computation; Intentional computing; Anticipative computing; Evolutionary computing
Mechanism-oriented computing
Spatial computation; Elastic computing; Human-centered computing; Embedded computing; Entertainment computing; Time-sensitive/temporal computing; Soft computing (fuzzy logic, neural computing, evolutionary computation, machine learning, and probabilistic reasoning + belief networks, + chaos theory + learning theory)
Large-scale computing strategies
Distributed computing; Parallel computing; Macro- and micro-computing; Activity-based computing; Data intensive computing; Resource-constraint computing; Grid computing; Cloud computing; Cluster computing; On-demand computing; Ubiquitous/pervasive computing; Memristor Computing; Unconventional computing; Evolutionary computing
Computing technologies
Quantum computing; Optical computing; DNA (genetic) computing; Molecular computing; Reversible computing; Billiard Ball computing; Neuronal computing; Magnetic computing; Gloopware computing; Moldy computing; Water wave-based computing; Graphene-based computing
Quantum Computing
Quantum computing models; Quantum complexity theory; Qubits; Non-deterministic and Probabilistic Computers; Quantum algorithms; Quantum computational operations; Scalable quantum computing; Quantum teleportation; Quantum cryptography; Quantum simulation; Quantum decoherence; Quantum gravity; Physical implementation of quantum computers
Technology-oriented computing
Peer-to-Peer computing; Mobile computing; Sensor-based computing; Wireless computing; Trusted computing; Financial computing; Genetic computation
------------------------
FUTURE COMPUTING 2016 Committee: http://www.iaria.org/conferences2016/ComFUTURECOMPUTING16.html
========================
------------------------------
Message: 4
Date: Thu, 12 Nov 2015 11:58:24 +0300
From: "Alexander S. Kulikov" <kulikov@logic.pdmi.ras.ru>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 15th International Symposium on Experimental
Algorithms (SEA 2016): Call for Papers
Message-ID:
<CAKWj8b8KYSgTPPJU1ejoVz2PcAosHv=-5dqSrUpycrKOfdDLBw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
*******************************************************************************
Call for Papers
15th International Symposium on Experimental Algorithms (SEA 2016)
June 5-8, 2016, St. Petersburg, Russia
http://logic.pdmi.ras.ru/sea2016/
*******************************************************************************
SEA (Symposium on Experimental Algorithms), previously known as WEA
(Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and
engineering of algorithms, as well as in various aspects of
computational optimization and its applications.
The preceding symposia were held in Riga, Monte Verità, Rio de
Janeiro, Santorini, Menorca Island, Rome,
Cape Cod, Dortmund, Ischia Island, Crete, Bordeaux, Rome, Copenhagen
and Paris. SEA aims to attract papers
from both the CS and the OR/Mathematical Programming communities.
The main theme of the symposium is the role of experimentation and of
algorithm engineering techniques in
the design and evaluation of algorithms and data structures.
Submissions should present significant contributions
supported by experimental evaluation, methodological issues in the
design and interpretation of experiments,
the use of (meta-) heuristics, or application-driven case studies that
deepen the understanding of the complexity
of a problem.
IMPORTANT DATES
Times AoE (Anywhere on Earth):
Abstract submission: January 26, 2016.
Full paper submission: February 2, 2016.
Acceptance notification: March 11, 2016.
Camera-ready version: March 25, 2016.
Conference dates: June 5-8, 2016.
TOPICS
Contributions solicited cover a variety of topics including but not limited to:
Algorithm Engineering
Algorithmic Libraries
Algorithmic Mechanism Design
Analysis of Algorithms
Algorithms for Memory Hierarchies
Approximation Techniques
Bioinformatics
Branch-and-Bound Algorithms
Combinatorial and Irregular Problems
Combinatorial Structures and Graphs
Communication Networks
Complex Networks
Computational Geometry
Computational Learning Theory
Computational Optimization
Computer Systems
Cryptography and Security
Data Streams
Data Structures
Distributed and Parallel Algorithms
Evaluation of Algorithms for Realistic Environments
Experimental Techniques and Statistics
Graph Drawing
Heuristics for Combinatorial Optimization
Implementation, Testing, Evaluation and Fine-tuning
Information Retrieval
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Metaheuristic Methodologies
Multiple Criteria Decision Making
Network Analysis
Novel Applications of Algorithms in Other Disciplines
Online Problems
Parallel Algorithms and Computing
Railway Optimization using Algorithmic Methods
Randomized Techniques
Robotics
Semidefinite Programming
Simulation
Software Repositories and Platforms for using Algorithms
Telecommunications and Networking
World-Wide-Web Algorithms
INVITED SPEAKERS
To be announced
PROGRAM COMMITTEE
Ittai Abraham
Maxim Babenko
Daniel Bienstock
Daniel Delling
Paola Festa
Stefan Funke
Andrew V. Goldberg — chair
Dan Halperin
Michael Junger
Alberto Marchetti-Spaccamela
Petra Mutzel
Tomasz Radzik
Ilya Razenshteyn
Rajeev Raman
Mauricio G. C. Resende
Peter Sanders
David B. Shmoys
Daniele Vigo
Neal Young
ORGANIZERS
Steklov Institute of Mathematics at St. Petersburg of the Russian
Academy of Sciences
SUBMISSIONS
Authors are invited to submit an extended abstract or a full paper of
at most 12 pages, not including references,
in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
http://www.stage.sgw.springer.com/computer/lncs?SGWID=0-164-6-793341-0
Proofs and other material omitted due to space constraints are to be
put into a clearly marked appendix to be read
at discretion of the referees. Papers must present original (and not
previously published) research. Simultaneous
submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the
symposium will be published in Springer's LNCS series.
Submissions should be uploaded to the EasyChair Conference system:
https://easychair.org/conferences/?conf=sea2016
OTHER EVENTS IN ST. PETERSBURG
A Special Semester on Computational and Proof Complexity, April - June, 2016
* Workshop on Proof Complexity, May 17 - 20, 2016
* Workshop on Low-Depth Complexity, May 23 - 25, 2016
The 11th International Computer Science Symposium in Russia, June
9–13, 2016, St. Petersburg, Russia
FURTHER INFORMATION AND CONTACTS
Web: http://logic.pdmi.ras.ru/sea2016/
Email: sea2016info@gmail.com
------------------------------
Message: 5
Date: Thu, 12 Nov 2015 10:15:31 +0100
From: Tobias Friedrich <friedrich@hpi.de>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PostDoc / PhD Positions in Algorithms at Hasso
Plattner Institute Potsdam
Message-ID: <5F6A882C-14DD-4203-A3E7-7F2C96791062@hpi.de>
Content-Type: text/plain; charset=windows-1252
Applications are invited for a
Postdoctoral Researcher in Algorithms
and a
PhD student in Algorithms
at the recently founded research group Algorithm Engineering at the Hasso Plattner Institute (HPI) in Potsdam, Germany. The HPI is a unique research and teaching institute in Germany, which was founded in 1999 as an institute of the University of Potsdam. HPI carries out internationally acclaimed research and offers innovative academic majors in the field of IT Systems Engineering. The institute offers a vibrant scientific environment at the beautiful Campus Griebnitzsee, which is located at the border to Berlin.
All positions are full-time and can be started as soon as possible for the applicant. The postdoc salary is competitive and depends on the applicant's qualification. The contract for the postdoc will be limited to two years with the possibility of extension. Ph.D. students receive a competitive stipend and generous travel support.
Applicants should have a theoretical/mathematical background and an interest in at least one of the following topics:
— random structures and algorithms;
— theory of evolutionary algorithms and swarm intelligence;
— distributed and parallel computing;
— mathematical optimization;
— analysis of scale-free network models.
Postdoctoral researchers from other fields of theoretical computer science and discrete mathematics may apply as well, but should provide a one-page motivation letter detailing how they fit in the research profile of the group.
All applicants should have an excellent first academic degree in computer science, mathematics, or a related discipline. Applications should include a detailed CV, a copy of master (or PhD) thesis, a brief statement of research interests, and a list of publications (if applicable). Please also mention names and contact details of one or two references -- preferably one from the thesis advisor. Applicants interested in doing a PhD should also include a transcript with a list of courses and grades.
For further information, also on other offers, please refer to https://hpi.de/friedrich/offers. Applications must be sent via email, preferably as a single PDF, to jobs-friedrich@hpi.de. Application closing date is 15 January 2016; in exceptional cases a decision can be made earlier.
--
Prof. Dr. Tobias Friedrich
Algorithm Engineering Group
Hasso Plattner Institute
Prof.-Dr.-Helmert-Str. 2-3
14482 Potsdam / Germany
Tel.: +49 331 5509 410
E-Mail: friedrich@hpi.de
Office: office-friedrich@hpi.de
URL: https://hpi.de/friedrich
------------------------------
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 93, Issue 11
**************************************
No comments:
Post a Comment