SPAA Archives

ACM SPAA Participants List


Options: Use Classic View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Message-ID: <[log in to unmask]>
Sender: ACM SPAA Participants List <[log in to unmask]>
From: Nodari Sitchinava <[log in to unmask]>
Date: Sun, 29 Jun 2014 22:55:52 -1000
Content-Type: multipart/alternative; boundary=001a11c2f9428c7f7804fd09d38d
MIME-Version: 1.0
Reply-To: Nodari Sitchinava <[log in to unmask]>
Parts/Attachments: text/plain (5 kB) , text/html (7 kB)
MASSIVE 2014 Call for Papers

Sixth Workshop on Massive Data Algorithmics (MASSIVE 2014) will take place
on September 11, 2014 in Wrocław, Poland as part of ALGO 2014
<> immediately following the European
Symposium on Algorithms (ESA).

The workshop has no formal proceedings, so work presented at the workshop
can also be (or have been) presented at other conferences.


Important Dates:

Submission deadlines:
 - Paper submission:     July 14, 2014 11:59pm HAST
 - Author Notification:  July 28, 2014
 - Camera-ready version: August 11, 2014


Aim and scope:

Tremendous advances in our ability to acquire, store and process data, as
well as the pervasive use of computers in general, have resulted in a
spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both science
and industry. In general, society is becoming increasingly data driven, and
this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means that in
general focus on algorithm efficiency is increasing. However, the large
size of the data, and/or the small size of many modern computing devices,
also means that issues such as memory hierarchy architecture often play a
crucial role in algorithm efficiency. Thus the availability of massive data
also means many new challenges for algorithm designers.

The aim of the workshop is to provide a forum for researchers from both
academia and industry interested in algorithms for massive dataset
problems. The scope of the workshop includes both fundamental algorithmic
problems involving massive data, as well as algorithms for more specialized
problems in, e.g., graphics, databases, statistics and bioinformatics.
Topics of interest include, but are not limited to:

  - I/O-efficient algorithms
  - Cache-oblivious algorithms
  - Memory hierarchy efficient algorithms
  - Streaming algorithms
  - Sublinear algorithms
  - Parallel and distributed algorithms for massive data problems
  - Engineering massive data algorithms


Paper submission:

We invite submissions of extended abstracts of original research. The
submission should begin with the title of the paper, each author's name,
affiliation, and e-mail address, followed by a succinct statement of the
problems considered, the main results, an explanation of their
significance, and a comparison to past research, all of which should be
easily understood by non-specialists. More technical developments follow as
appropriate. Use 11-point or larger font in single column format, with
one-inch or wider margins all around. You may include a clearly marked
appendix, which will be read at the discretion of the committee. The
submission, excluding title page, bibliography and appendix, must not
exceed 10 pages (authors should feel free to send submissions that are
significantly shorter than 10 pages).

Extended abstract should be submitted through the EasyChair website
<> by July 14th.
Authors will be notified about acceptance by July 28th. There will be no
formal proceedings, so work presented at the workshop can also be (or have
been) presented at other conferences. An informal collection of the
extended abstracts will be provided to the workshop participants. An author
of each accepted abstract is expected to give a presentation of the
abstract at the workshop.


Program Committee:

Peyman Afshani (MADALGO, Aarhus University)
Deepak Ajwani (Bell Labs)
Lars Arge (MADALGO, Aarhus University)
Michael A. Bender (Stony Brook University)
Gerth Brodal (MADALGO, Aarhus University)
Jeff Erickson (University of Illinois at Urbana-Champaign)
Jeremy T. Fineman (Georgetown University)
Johannes Fischer (TU Dortmund)
Sudipto Guha (University of Pennsylvania)
John Iacono (New York University)
Riko Jacob (ETH Zurich)
Ulrich Meyer (Goethe University Frankfurt am Main)
Ian Munro (University of Waterloo)
Jeff M. Phillips (University of Utah)
Alejandro Salinger (University of Saarland)
Francesco Silvestri (University of Padova)
Sergei Vassilvitski (Google and Columbia University)
Ke Yi (Hong Kong University of Science and Technology)
Norbert Zeh (Dalhousie University)
Qin Zhang (Indiana University, Bloomington)

Chair: Nodari Sitchinava (University of Hawaii, Manoa)

Organizing committee:

Lars Arge (Aarhus and MADALGO)
Gerth Stølting Brodal (Aarhus and MADALGO)
Peyman Afshani (Aarhus and MADALGO)
Trine Ji Holmgaard (Aarhus and MADALGO)



The workshop will take place on September 11, 2014 in Wroclaw, Poland, as
part of ALGO 2014 immediately following the European Symposium on
Algorithms (ESA). Participants for MASSIVE should register through the
on-line registration on the ALGO-webpage <>.
Early registration before July 31st. All researchers and industry people
interested in massive data algorithmics are encouraged to attend the
Nodari Sitchinava
Assistant Professor
Department of Information and Computer Sciences
University of Hawaii, Manoa


To unsubscribe from the SPAA list:
write to: mailto:[log in to unmask]
or click the following link: