DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: dmanet Digest, Vol 97, Issue 11

Send dmanet mailing list submissions to
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. Research Associate in Randomized Algorithms (King's College
London) (Colin Cooper)
2. TAMC 2016 - Deadline extended to Mar. 20 (Sun,Xiaoming)
3. Call for Nominations for SIGACT Distinguished Service Prize:
Deadline April 1, 2016 (Lane A. Hemaspaandra)
4. Post-doc position opening at INRIA Sophia-Antipolis
(Frederic Havet)

----------------------------------------------------------------------

Message: 1
Date: Tue, 8 Mar 2016 16:37:41 +0000
From: Colin Cooper <colin.cooper@kcl.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Research Associate in Randomized Algorithms (King's
College London)
Message-ID:
<CACRLEZnpQoG50-ix3aeHykmHp+3qw8-kvN1YsPPLm=9b1DoAnQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

This is an eighteen-month research post at postdoctoral level, funded by an
EPSRC project entitled "Randomized algorithms for computer networks." The
intended starting date is 1st June 2016, but a later start may be possible.
The project seeks to develop and generalise work on random discrete
processes both theoretically, and in application to large online networks.

Research in the project is based around, but not restricted to, the
following three thematic areas: analysis and algorithmic applications of
random walks on graphs and digraphs, random processes on distributed
networks, self modifying random networks.

We encourage applications from candidates with a theoretical research
background, and from those with both theoretical and programming abilities.
The post is suitable to applicants from Computer Science or Mathematics
with a particular interest in random structures and algorithms.

The appointed candidate will work with Professors Colin Cooper and Tomasz
Radzik at King's College London, and collaborate with Professor Martin Dyer
at the University of Leeds, who is a research partner on this project.

Please apply via:

https://www.hirewire.co.uk/HE/1061247/MS_JobDetails.aspx?JobID=67877

--
Colin Cooper
Algorithm and BioInformatics Group
Department of Informatics (formerly Computer Science)
King's College London
WC2R 2LS

email: colin.cooper@kcl.ac.uk

website: www.inf.kcl.ac.uk/staff/ccooper
<http://www.dcs.kcl.ac.uk/staff/ccooper>

------------------------------

Message: 2
Date: Wed, 9 Mar 2016 09:13:20 +0800
From: "Sun,Xiaoming" <sunxiaoming@ict.ac.cn>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] TAMC 2016 - Deadline extended to Mar. 20
Message-ID: <002501d179a0$de8a0310$9b9e0930$@ac.cn>
Content-Type: text/plain; charset="us-ascii"

The 13th Annual Conference on Theory and Applications of Models of
Computation

http://cs.xidian.edu.cn/tamc2016/

Xi'an, China July 20-22, 2016

Welcome to The 13th annual conference on Theory and Applications of Models
of Computation (TAMC), which will take place at Xi'an, China from 20th to
22nd, July, 2016. The event is supported by School of Computer Science and
Technology and School of Cyber Engineering, Xidian University.

Venue

Tangcheng Hotel

South Hanguang Road #229

Xi'an, China

All major events take place in this building. There is a fully equipped
lecture hall with a capacity for 200 attendees as well as a series of
lecture rooms, each of which can support 50 attendees. Of course, all
participants of TAMC-16 will have free internet access during the
conference.

Contact

Email:tamc@xidian.edu.cn

Important Dates

Submission deadline: 11:59 pm EST March 20, 2016

Notification of authors: May 6, 2016

Final versions deadline: May 22, 2016

Post Conference Publications

Special issues of the journals Theoretical Computer Science and Mathematical
Structures in Computer Science devoted to a selected set of accepted papers
of the conference are planned.

Submission of Papers

Authors should submit an extended abstract (not a full paper).

The submission should contain a scholarly exposition of ideas, techniques,
and results, including motivation and a clear comparison with related work.

The length of the extended abstract should not exceed ten (10) letter-sized
pages (not including bibliography and appendices.) Submitted papers must
describe work not previously published. They must not be submitted
simultaneously to another conference with refereed proceedings. Each PC
member is allowed to submit at most one paper. Research that is already
submitted to a journal may be submitted to TAMC16, provided that (a) the PC
chair is notified in advance that this is the case, and (b) it is not
scheduled for journal publication before the conference.

The submission server is now available at
https://www.easychair.org/conferences/?conf=tamc16.

Conference Chair

Jianfeng Ma (Xidian University)

Zhiyong Liu (Institute of Computing Technology, Chinese Academy of Sciences)

Programme Committee Chair

Jin-Yi Cai (University of Wisconsin)

Programme Committee Co-Chairs

Jiangtao Cui (Xidian University)

Xiaoming Sun (Institute of Computing Technology, Chinese Academy of
Sciences)

Steering Committee

Manindra Agrawal

Jin-Yi Cai

Barry Cooper

John Hopcroft

Angsheng Li

Zhiyong Liu

Local Organising Committee

Jianfeng Ma http://web.xidian.edu.cn/jfma/

Jiangtao Cui http://web.xidian.edu.cn/cuijt/

Hui Li http://web.xidian.edu.cn/hli/

Aims and Scope

TAMC 2016 aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of the
conference are computability, complexity, algorithms, models of computation
and systems theory. Typical but not exclusive topics of interest include:

Algebraic computation

Algorithmic coding theory

Algorithmic number theory

Approximation algorithms

Automata theory

Circuit complexity

Combinatorial algorithms computability

Computational biology, and biological computing

Computational complexity [including circuits, communication,
derandomization, PCPs, proof complexity, structural complexity]

Computational game theory

Computational logic

Computational geometry

Continuous and real computation

Cryptography

Data structures

Design and analysis of algorithms

Distributed algorithms

Domain models [Assets, Price of Abstraction, frameworks]

Fixed parameter tractability

Geometric algorithms

Graph algorithms

Information and communication complexity

Learning theory

Memory hierarchy tradeoffs

Model theory for computing [modal and temporal logics, specification,
verification, synthesis or automated software construction, aesthetics,
software behavior, transformation of models]

Natural computation

Nature inspired computing

Networks in nature and society

Network algorithms optimization

Online algorithms

Parallel algorithms

Philosophy of computing [emerging paradigms, morality, intentionality]

Privacy and security

Property testing

Proof complexity

Process models [for software construction, validating software under
construction, supply-chain]

Quantum computing

Randomness pseudorandomness

Randomized algorithms

Space - time tradeoffs

Streaming algorithms

Systems theory [Concurrent, Timed, Hybrid and Secure systems]

VLSI Models of Computation [Models for Hardware - Software Co-design]

------------------------------

Message: 3
Date: Tue, 8 Mar 2016 20:46:04 -0500
From: "Lane A. Hemaspaandra" <lane@cs.rochester.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Nominations for SIGACT Distinguished
Service Prize: Deadline April 1, 2016
Message-ID: <76046B84-9DA1-44AB-9F3F-80C7279155B0@cs.rochester.edu>
Content-Type: text/plain; charset=us-ascii

Call for Nominations: 2016 SIGACT Distinguished Service Prize

The theory community benefits in many ways from the dedicated service, above and beyond the call of duty, of many of its members. Among other contributions, the field's members underpin the operation of conferences, journals, prizes, funding agencies, and other community activities, help ensure funding for the field, and promote the recognition of the field by external communities. The SIGACT Distinguished Service Prize is intended to recognize and promote their contributions, as well as to raise awareness of the need for and importance of such service, for the health of our community.

This prize is given annually to an individual who has made substantial service contributions to the Theoretical Computer Science community. (From 2002 to 2012, the award was given biennially.) It is presented at the ACM Symposium on Theory of Computing <http://acm-stoc.org/>, and comes with a $1,000 prize, a travel grant of up to $700 to attend the conference, and complimentary conference registration.
Eligibility

The prize can be awarded to an individual for a single contribution or for a series of contributions over a career. All living individuals are eligible with the exception of previous awardees, the sitting SIGACT Chair, an individual who nominated a majority of the current selection committee members, or a member of the current selection committee.
Selection Committee

The winner is selected by a three-member committee. The SIGACT chair appoints the selection committee to serve staggered terms over three award cycles. The 2016 selection committee members are Lance Fortnow, Lane A. Hemaspaandra (chair), and Avi Wigderson.
Nominations

Nominations can be made by any member of the Theory of Computing community and should contain a statement of no more than 500 words explaining why the candidate deserves the award. The nomination can also include an additional separate listing of service activities, additional support letters, and other supplemental material such as a pointer to the candidate's CV. The nomination must include the name, postal address, phone number, and e-mail address of the nominator. Nominations are to be submitted electronically in PDF format by April 1, 2016, to the chair of the selection committee, Lane A. Hemaspaandra, at lane@cs.rochester.edu <mailto:lane@cs.rochester.edu>. Please put "SIGACT Distinguished Service Award Nomination" in the subject line.
Past Winners

------------------------------

Message: 4
Date: Wed, 9 Mar 2016 16:35:35 +0100 (CET)
From: Frederic Havet <frederic.havet@cnrs.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Post-doc position opening at INRIA Sophia-Antipolis
Message-ID:
<1324815050.12971923.1457537735973.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=ISO-8859-1

We are inviting applications to a post-doc position entitled
``Improving inference algorithms for macromolecular structure determination'' starting Fall 2016.
It will take place at INRIA Sophia Antipolis in the teams ABS ( https://team.inria.fr/abs/ ) and COATI ( https://team.inria.fr/coati/) .

The proposed work is to design efficient algorithms for solving some graph problems arising from macromolecular structure determination.
Therefore we are looking for candidates having strong knowledge in graph algorithms, combinatorial optimisation and/or structural biology.

More details on the page

http://www.inria.fr/institut/recrutement-metiers/offres/post-doctorat/sejours-post-doctoraux/(view)/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4508&LG=FR&Resultsperpage=20&nPostingID=10254&nPostingTargetID=16500&option=29&sort=ASC&nDepartmentID=19

Do not hesitate to circulate this e-mail.

Frédéric Havet

------------------------------

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 11
**************************************

DMANET: DISCRETE MATHEMATICS AND ALGORITHMS

Thursday, March 10, 2016

dmanet Digest, Vol 97, Issue 11

No comments:

Post a Comment

About Me