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 Algorithms & Theory (Ah Bee)
2. BDA 2016 --- 2nd call for presentations (Yuval Emek)
3. Sao Paulo School on Algorithms, Combinatorics and
Optimization (2nd call) (Yoshiharu Kohayakawa)
4. INTECH 2016 (Sidda Chandrappa)
5. Ph.D. Student and Post Doc Positions (Kasper Green Larsen)
----------------------------------------------------------------------
Message: 1
Date: Tue, 15 Mar 2016 19:45:18 +0200
From: Ah Bee <dotjimdot@gmail.com>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoc position in Algorithms & Theory
Message-ID:
<CAMRWt10_38Pv427eKKVB2_=xoB4o1C_YZ9FbU6P=R6UCtx6y8g@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The Computer Science Institute of the University of Tartu, Estonia, is
seeking applicants for
1 Postdoc position in Theoretical Computer Science.
The applicant should have notable research accomplishments in the area
of randomized algorithms. We are particularly interested in candidates
who with expertise in distributed, sublinear time, or data stream
algorithms, or related areas.
Some details about the position:
Duration
1 to 2 years (not shorter than 1 year)
Salary
1600-1800 Euros (to be negotiated) after tax
( ~ 200% of Estonian average income)
Annual travel budget to spend at your own discretion (negotiated)
Relocation support up to 5000 Euros
Teaching
Possible, not required.
For informal inquiries, contact Dirk Oliver Theis (dotheis [at] ut
[dot] ee). Please include a (short) CV.
University, CS Institute, TCS group
--------------------------------------------------
* Venerable university, famous in the region, OK ranking
* very active, international CS institute
* working language is English
* large part of the faculty + most postdocs, PhD students
are expatriates
* in TCS, communication is entirely in English (~90% expats)
Tartu and Estonia
--------------------------
* Estonia is south of Finland, east of Sweden. :)
* no need to learn Estonian, the country is used to English
speakers.
* Tartu: student city packed with bars, restaurants,
and exchange students
* long warm summer evenings (that's why there are so many bars).
------------------------------
Message: 2
Date: Tue, 15 Mar 2016 21:36:25 +0200
From: Yuval Emek <yemek@ie.technion.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] BDA 2016 --- 2nd call for presentations
Message-ID:
<CAJfs=WxsiaiVuJSWMzGOJtzqP9muX8jgc4KMPWmqGW0uea09HA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
=======================================================
The 4th Workshop on Biological Distributed Algorithms (BDA 2016)
Co-located with PODC 2016. July 25, 2016 in Chicago, IL USA
http://www.snl.salk.edu/~navlakha/BDA2016/
=======================================================
We are excited to announce the 4th workshop on Biological Distributed
Algorithms (BDA). The aim of the workshop is to foster collaborative research
between biologists and distributed computing theory researchers, with the hope
of producing better understanding of the behavior of distributed biological
systems, as well as new ideas for design of algorithms for engineered or
computational networks.
BDA 2016 will include presentations on distributed algorithms related to a
variety of biological systems, with special attention to communication and
coordination in insect colonies (e.g. foraging, navigation, task allocation,
construction) and networks in the brain (e.g. learning, decision-making,
attention).
This is a one-day workshop.
===========
SUBMISSIONS
===========
We solicit submissions of extended abstracts describing recent results
relevant to biological distributed computing. We especially welcome extended
abstracts describing new insights and / or case studies regarding the
relationship between distributed computing and biological systems even if
these are not fully formed. Since a major goal of the workshop is to explore
new directions and approaches, we especially encourage the submission of
ongoing work. Selected contributors would be asked to present, discuss and
defend their work at the workshop. By default, the submissions will be
evaluated for either oral or poster presentation, though authors may indicate
in their submission if it should be only considered for one of the
presentation types. Submissions should be in PDF and include title, author
information, and a 4-page extended abstract. Shorter submissions are also
welcome, particularly for poster presentation.
Please use the following EasyChair submission link:
https://easychair.org/conferences/?conf=bda20160
Note: The workshop will not include published proceedings. In particular, we
welcome submissions of extended abstracts describing work that has appeared or
is expected to appear in other venues.
=================================
Support for students and postdocs
=================================
To encourage the participation of researchers at the early stages of their
career, the NSF has generously granted us with the means to provide financial
support for student and postdoc participants. Specifically, for each accepted
(oral or poster) presentation, we will reimburse the registration fee and
~$350 of additional travel expanses (the exact amount will be determined later
on but it is expected to be even slightly higher than that) of one
student/postdoc author.
===============
IMPORTANT DATES
===============
April 25, 2016 – Extended abstract submission deadline
May 25, 2016 – Decision notifications
July 25, 2016 – Workshop
================
INVITED SPEAKERS
================
Bernard Chazelle - Princeton
Melanie Moses - UNM
Konrad Kording - Northwestern
=================
PROGRAM COMMITTEE
=================
Ziv Bar-Joseph - CMU
Anna Dornhaus - University of Arizona
Yuval Emek - Technion (co-chair)
Amos Korman - CNRS and University of Paris Diderot
Nancy Lynch - MIT
Saket Navlakha - Salk Institute (co-chair)
--
Yuval Emek, Ph.D.
Assistant Professor
Industrial Engineering and Management
Technion - Israel Institute of Technology
http://ie.technion.ac.il/~yemek/
------------------------------
Message: 3
Date: Tue, 15 Mar 2016 21:07:33 -0300
From: Yoshiharu Kohayakawa <yoshi@ime.usp.br>
To: DMANET <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Sao Paulo School on Algorithms, Combinatorics and
Optimization (2nd call)
Message-ID: <22248.41925.697163.570070@renyi.ime.usp.br>
Content-Type: text/plain; charset=iso-8859-1
SECOND CALL: São Paulo School of Advanced Science on Algorithms,
Combinatorics and Optimization, July 2016, Brazil
The São Paulo School of Advanced Science on Algorithms, Combinatorics
and Optimization (SPSAS ACO) will be held from 18 to 29 July 2016, at
the University of São Paulo, Brazil.
The school is aimed at Master's students, PhD students, and young
researchers. Exceptional undergraduate students may also qualify.
COURSES:
- Robert Kleinberg (Cornell), Combinatorial stochastic search and
selection
- Yoshiharu Kohayakawa (USP), The regularity method and blow-up lemmas
for sparse graphs
- Alexandr Kostochka (UIUC), Coloring sparse graphs with few colors
- Daniel Král' (Warwick), Graph limits and their applications in
extremal combinatorics
- Cláudio L. Lucchesi (UFMS), The perfect matching polytope, solid
bricks and the perfect matching lattice
- Flávio K. Miyazawa (UNICAMP) and Fernando Mário de Oliveira Filho
(USP), Geometric packing
- Rob Morris (IMPA), The method of hypergraph containers
- Sinai Robins (USP), Harmonic analysis on polytopes and cones
- Levent Tunçel (Waterloo), Semidefinite programming techniques in
combinatorial optimization
- Eli Upfal (Brown), Sample complexity and uniform convergence
- David Williamson (Cornell), Recent progress in approximation
algorithms for the traveling salesman problem
Additionally, there will be a series of talks on advanced research
topics and participants will be invited to present their work in
poster sessions. The school will provide a congenial environment for
participant interaction.
Participants may choose the courses they will attend, but are expected
to stay for the whole duration of the school (arrival date: 17 July;
departure date: 30 July). We expect to have around 85 students and
young researchers.
COSTS AND FELLOWSHIPS:
The school expects to provide funding to most participants.
Participants that are successful in their funding application will
have their local expenses (including the early registration fee) fully
covered. Help towards travelling expenses will also be provided to
most participants.
APPLICATION:
An online application form is available at
http://sp-school2016.ime.usp.br
Please use the form above to apply for funding. Funding applications
sent by 28 March 2016 will receive full consideration. Applicants
will be contacted in mid-April with information concerning their
acceptance. Information on the registration procedure and fee payment
will be available soon.
FURTHER INFORMATION:
Please visit the pages of the school regularly:
http://sp-school2016.ime.usp.br
https://www.facebook.com/spschool2016/
SPONSOR
The school is financed by the São Paulo Research Foundation (FAPESP),
under the SPSAS program: http://espca.fapesp.br/home
------------------------------
Message: 4
Date: Wed, 16 Mar 2016 08:49:41 +0530
From: Sidda Chandrappa <subscription@dirf.org>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] INTECH 2016
Message-ID: <87abb049cc87611d0fa9d412a49f7758@dirf.org>
Content-Type: text/plain; charset=UTF-8; format=flowed
CALL FOR PAPERS
Sixth International Conference on Innovating Computing Technology
(INTECH 2016)
August 24-26, Dublin, Ireland
www.dirf.org/intech
(Technically co-sponsored by UK & Ireland IEEE)
(Xplore publishing)
The First international conference on Innovative Computing Technology
(INTECH 2011) was held at Sao Carlos in Brazil followed by the Second
International Conference on Innovative Computing Technology (INTECH
2012) at Casablanca in Morocco. The INTECH 2013, INTECH 2014 and INTECH
2015 were organized at London and Luton, UK respectively. The INTECH
2016 is organized at Dublin, Ireland. The INTECH 2016 offers the opening
for institutes, research centers, engineers, scientists and industrial
companies to share their latest investigations, researches, developments
and ideas in area of Innovative Computing Technology, which covers huge
topics.
The INTECH intends to address various innovative computing techniques
involving various applications. This forum will address a large number
of themes and issues. The conference will feature original research and
industrial papers on the theory, design and implementation of computing
technologies, as well as demonstrations, tutorials, workshops and
industrial presentations. This conference (INTECH 2016) will include
presentations of contributed papers by invited keynote speakers.
Conference papers will include innovative computing paradigms in the
following topics:
Network and Information Security Innovative Computing Systems and
Applications in S & T domains such as –
Algorithms Applied Information Systems
Artificial Intelligence and Decision Support Systems
Broadcasting Technology
Cloud Computing
Computational Intelligence
Data and Network mining
Data Stream Processing in Mobile/Sensor Networks
Database Systems
Digital Image/Video Processing
E-Learning, e-Commerce, e-Business and e-Government
Electronics Environmental modeling and precision agriculture
Fault Classification and Pattern Recognition
Green Computing
Grid computing
Human-Computer Interaction
Intelligent Condition
Monitoring Mobile network and systems
Multimedia and Interactive Multimedia Payment Systems
Peer-to-peer networks
Precision Farming
Web Farming
Signal Processing Soft Computing Fuzzy and Neural Network Systems,
Optimization algorithms Software Engineering Intelligent Farming
Web farming,
Web irrigation Ubiquitous Computing User Interfaces,
Visualization and Modeling
Virtual Reality Visualization
Web services
WWW Applications and Technologies
XML and other Extensible Languages
The INTECH proceedings will also be indexed by dblp. All the papers will
be reviewed and the accepted papers in the conference will be submitted
to IEEE Xplore for indexing and will be indexed in many global
databases.In addition, all the accepted papers (for Journals) will be
published in the following issues journals after substantial revision
and modification.
Journal of Digital Information Management (JDIM) (Scopus and EI Indexed)
International Journal of Enterprise Information Systems (Scopus and EI
Indexed)
International Journal of Grid and High Performance Computing (IJGHPC)
(Scopus and EI Indexed)
International Journal of Computational Science and Engineering (Scopus
and EI Indexed)
International Journal of Big Data Intelligence
International Journal of Applied Decision Sciences (Scopus/EI)
International Journal of Management and Decision Making (Scopus/EI)
International Journal of Strategic Decision Sciences
International Journal of Enterprise Information Systems (Scopus/EI)
Recent Advances in Electrical & Electronic Engineering (Scopus)
IMPORTANT DATES
Submission of papers: June 01, 2016
Notification of Acceptance/Rejection: July 10, 2016
Camera Ready: August 10, 2016
Registration August 10, 2016
Conference: August 24-26, 2016
Submissions at: http://www.dirf.org/intech/paper-submission/
Contact: intech@dirf.org OR intech@socio.org.uk
------------------------------
Message: 5
Date: Wed, 16 Mar 2016 10:56:14 +0000
From: Kasper Green Larsen <larsen@cs.au.dk>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Ph.D. Student and Post Doc Positions
Message-ID: <D30EFA5C.D27A%larsen@cs.au.dk>
Content-Type: text/plain; charset="us-ascii"
Ph.D. student and Post Doc positions
Fine-grained complexity of algorithm and data structures is a new area with flourishing activity. Analogous to NP-completeness, fine-grained complexity relies on a few carefully chosen conjectures to prove conditional lower bounds for fundamental algorithmic and data structural problems. Some of the most important results in the area include quadratic lower bounds for classic problems such as edit distance, longest common subsequence and various polynomial lower bounds for dynamic data structures and the like. Of course, the long term goal is to replace these conditional lower bounds with unconditional ones, but this is far out of reach with current techniques.
Starting August 1, 2016 or later, a Ph.D. student and a Post Doc position is available under the supervision of Assistant Professor Kasper Green Larsen (www.cs.au.dk/~larsen).
The positions are within (but not limited to) the area of computational complexity of algorithms and data structures. The selected candidates will work mainly on fine-grained complexity in the form of proving conditional lower bounds and understanding the connections between different hardness conjectures. Secondly, the chosen candidates will also work on improving the current techniques for proving unconditional lower bounds - in particular for data structures, which is an area where we can in fact prove interesting and non-trivial unconditional lower bounds. The candidates are also free to pursue other interesting research questions in related areas.
The research will be carried out at the Department of Computer Science at Aarhus University, Denmark under the supervision of Assistant Professor Kasper Green Larsen. The positions will also be associated with the
Center for Massive Data Algorithmics (MADALGO). MADALGO is a basic research
center funded by the Danish National Research Foundation. The center is
located in the Department of Computer Science, Aarhus University,
Denmark, but also includes researchers at CSAIL, Massachusetts Institute
of Technology, at the Max Planck Institute for Informatics and at
Frankfurt University. The center covers all areas of the design,
analysis and implementation of algorithms and data structures for
processing massive data (interpreted broadly to cover computations where
data is large compared to the computational resources), with focus on
I/O-efficient, cache-oblivious and streaming algorithms.
See www.madalgo.au.dk for more information.
The Ph.D. positions are
administered through Graduate School of Science and Technology at Aarhus
University (talent.au.dk/phd/scienceandtechnology) and include full
tuition waiver and a very competitive scholarship. Applications are
welcomed from students with at least three years of full-time study by
August 2016. Students with a strong background in complexity theory and/or algorithms will be preferred.
One Post Doc position at the level of Research Assistant
Professor of Computer Science is also available. Postdoc positions are
initially for one year, but can be extended with an additional year by
mutual consent. We welcome postdoctoral researchers with clearly
demonstrated experience and skills in the areas of computational complexity, algorithms and/or data structures. The responsibilities of Post Docs may include modest teaching responsibilities.
The application deadline for both Ph.D. student and Post Doc positions is May
1, 2016. Applicants for Ph.D. student positions should apply using the
Aarhus Graduate School of Science and Technology application system also
accessible from www.madalgo.au.dk. Applicants for Post Doc positions
should apply by uploading a letter of interest and a CV, as well as
indicate at least two names of references for recommendations, using the
application form available at www.madalgo.au.dk.
For further information, contact Assistant Professor Kasper Green Larsen
at larsen@cs.au.dk.
Best regards/Mvh
Kasper Green Larsen
Assistant Professor, Ph.D.
Department of Computer Science
Aarhus University
------------------------------
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 97, Issue 18
**************************************
No comments:
Post a Comment