Listado de articulos aceptadosAyuda

Track B
#86 10-7-2002
11:40 - 12:30
Jiri Srba
 		Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
#381 10-7-2002
10:0 - 11:15
Freddy Mang
Thomas A. Henzinger
Orna Kupferman
Sriram Krishnan
 		Synthesis of Uninitialized Systems
#395 10-7-2002
12:40 - 13:30
Dietrich Kuske
Markus Lohrey
 		On the theory of one-step rewriting in trace monoids
#407 9-7-2002
12:40 - 13:30
Jose Meseguer
Rosu Grigore
 		A Total Approach to Partial Algebraic Specification
#420 11-7-2002
10:30 - 11:45
Bharat Adsul
Milind Sohoni
 		Complete and Tractable Local Linear Time Temporal Logics over Traces
#431 9-7-2002
10:0 - 11:15
James Worrell
Keye Martin
Mike Mislove
Michael Mislove
 		Measuring the Probabilistic Powerdomain
#458 9-7-2002
10:0 - 11:15
Andrej Bauer
Martin Escardo
Alex Simpson
 		Comparing functional paradigms for exact real-number computation
#470 10-7-2002
12:40 - 13:30
Michal Bielecki
Jan Hidders
Jan Paredaens
Jerzy Tyszkiewicz
Jan Van den Bussche
 		Navigating with a Browser
#506 9-7-2002
12:40 - 13:30
Lohrey Markus
Pedro R. D'Argenio
Hermanns Holger
 		Axiomatising Divergence
#525 10-7-2002
11:40 - 12:30
Thierry Cachat
 		Symbolic Strategy Synthesis for Games on Pushdown Graphs
#550 10-7-2002
10:0 - 11:15
Zeitoun Marc
Muscholl Anca
Genest Blaise
Helmut Seidl
 		Infinite-state High-Level MSCs: Model-Checking and Realizability
#557 9-7-2002
11:40 - 12:30
Franck van Breugel
Steven Shalit
James Worrell
 		Testing Labelled Markov Processes
#577 9-7-2002
10:0 - 11:15
Luke Ong
 		Games Characterizing Levy-Longo Trees
#580 9-7-2002
15:30 - 16:20
Colcombet Thomas
 		On Families of Graphs Having a Decidable First Order Theory with Reachability
#587 11-7-2002
10:30 - 11:45
Paul Gastin
Madhavan Mukund
 		An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
#616

Philippa Gardner
 		A Spatial Logic for Querying Graphs
#619 11-7-2002
10:30 - 11:45
J. B. Wells
 		The Essence of Principal Typings
#623 9-7-2002
11:40 - 12:30
Marco Kick
 		Bialgebraic Modelling of Timed Processes
#641 10-7-2002
10:0 - 11:15
Klaus Wich
 		Universal Inherence of cycle-free context-free Ambiguity Functions

Track A
#30 9-7-2002
12:40 - 13:30
John Hitchcock
 		Correspondence Principles for Effective Dimensions
#46 10-7-2002
17:10 - 18:25
Noam Nisan
 		The communication complexity of approximate set packing and covering
#49 11-7-2002
14:30 - 15:55
Ryuhei Uehara
 		Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
#87 11-7-2002
12:10 - 13:0
Vasco Brattka
 		Random numbers and an incomplete immune recursive set
#105 10-7-2002
10:0 - 11:15
Marek Karpinski
Piotr Berman
 		Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
#121 8-7-2002
12:50 - 13:40
Dima Grigoriev
Edward A. Hirsch
Dmitrii V. Pasechnik
 		Exponential Lower Bound for Static Semi-Algebraic Proofs
#126 8-7-2002
16:0 - 17:15
Peter Damaschke
 		Scheduling search procedures
#156 11-7-2002
17:10 - 18:25
Xiaodong Wu
Danny Chen
 		Optimal Net Surface Problems with Applications
#221 10-7-2002
15:30 - 16:45
Juhani Karhum?ki
Leonid P. Lisovik
 		The equivalence problem for finite substitutions on $ab^*c$, with applications
#244 10-7-2002
17:10 - 18:25
Piotr Berman
Marek Karpinski
Yakov Nekrich
 		Approximating Huffman Codes in Parallel
#254 8-7-2002
16:0 - 17:15
Chris Pollett
Farid Ablayev
Cris Moore
 		Quantum and Stochastic Branching Programs of Bounded Width
#342 11-7-2002
16:0 - 16:50
Jonas Holmerin
 		Improved Inapproximability Results for Vertex Cover on k-uniform Hypergraphs
#365 8-7-2002
12:0 - 12:50
Amr Elmasry
 		Priority queues, pairing and adaptive sorting
#367 10-7-2002
15:30 - 16:45
Marek Chrobak
Leah Epstein
John Noga
Jiri Sgall
Rob van Stee
Tomas Tichy
Nodari Vakhania
 		Preemptive Scheduling in Overloaded Systems
#373 10-7-2002
10:0 - 11:15
Camil Demetrescu
Giuseppe F. Italiano
 		Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
#377 10-7-2002
15:30 - 16:45
Colin Stirling
 		Deciding DPDA equivalence is primitive recursive
#378 8-7-2002
16:0 - 17:15
Steve Seiden
Leah Epstein
Rob van Stee
 		New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
#394 9-7-2002
15:30 - 16:20
Lars Engebretsen
Jonas Holmerin
Alexander Russell
 		Inapproximability Results for Equations over Finite Groups
#399 8-7-2002
17:40 - 18:55
Malin Christersson
Leszek Gasieniec
Andrzej Lingas
 		Gossiping with bounded size messages in unknown ad-hoc radio networks
#400 10-7-2002
15:30 - 16:45
Mikolaj Bojanczyk
 		Two-Way Alternating Automata and Finite Models
#402 9-7-2002
11:40 - 12:30
Conrado Martinez
Amalia Duch
 		On the average performance of orthogonal range search in multidimensional data structures
#406 9-7-2002
15:30 - 16:20
Seth Pettie
 		A Faster All-pairs Shortest Path Algorithm for Real-weighted Sparse Graphs (Best Student Paper)
#417 11-7-2002
17:10 - 18:25
Vincenzo Liberatore
 		Circular Arrangements
#430 10-7-2002
12:40 - 13:30
Xiaotie Deng
Guojun Li
Zimao Li
Bin Ma
Lusheng Wang
 		A PTAS for Distinguishing (Sub)string Selection
#441 9-7-2002
10:0 - 11:15
Moses Charikar
Piotr Indyk
Rina Panigrahy
 		New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching and Related Problems
#448 8-7-2002
17:40 - 18:55
Rene Beier
Peter Sanders
Naveen Sivadasan
 		Energy Optimal Routing in Radio Networks Using Geometric Data Structures
#450 9-7-2002
11:40 - 12:30
Philippe Duchon
Philippe Flajolet
Guy Louchard
Gilles Schaeffer
 		Random Sampling from Boltzmann Principles
#457 10-7-2002
15:30 - 16:45
Udo Adamy
Christoph Ambuehl
R. Sai Anand
Thomas Erlebach
 		Call Control in Rings
#462 10-7-2002
12:40 - 13:30
Gerth St?lting Brodal
Rune B. Lyngsoe
Anna ?stlin
Christian N. S. Pedersen
 		Solving the String Statistics Problem in Time $O(n\log n)$
#463 11-7-2002
14:30 - 15:55
Andreas Bj?rklund
Thore Husfeldt
 		Finding a Path of Superlogarithmic Length
#465 8-7-2002
16:0 - 17:15
Kazuo Iwama
Shiro Taketomi
 		Removable On-Line Knapsack Problems
#468 8-7-2002
16:0 - 17:15
Christophe Papazian
Eric Remila
 		Hyperbolic Recognition by Graph Automata
#472 8-7-2002
16:0 - 17:15
Nicolas Ollinger
 		The Quest for Small Universal Cellular Automata
#477 8-7-2002
10:0 - 11:15
Sylvain Lombardy
 		On the construction of reversible automata for reversible languages
#479 9-7-2002
10:0 - 11:15
Rasmus Pagh
Anna ?stlin
 		One-Probe Search
#492 10-7-2002
17:10 - 18:25
Micah Adler
Harald R?cke
Naveen Sivadasan
Christian Sohler
Berthold V?cking
 		Randomized Pursuit-Evasion in Graphs
#497 8-7-2002
10:0 - 11:15
Joseph (Seffi) Naor
 		Control Message Aggregation in Group Communication Protocols
#503 8-7-2002
17:40 - 18:55
Wolfgang Merkle
 		The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
#511 8-7-2002
17:40 - 18:55
Robert A. Hearn
Erik D. Demaine
 		The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
#517 8-7-2002
17:40 - 18:55
Ugo Vaccaro
Pavol Hell
Ladislav Stacho
Luisa Gargano
 		Spanning trees with bounded number of branch vertices
#533 10-7-2002
17:10 - 18:25
Carlo Fantozzi
Andrea Pietracaprina
Geppino Pucci
 		Seamless Integration of Parallelism and Memory Hierarchy
#534 10-7-2002
15:30 - 16:45
V.S. Anil Kumar Kumar
 		Improved Results for Stackelberg Scheduling Strategies
#536 8-7-2002
17:40 - 18:55
Victor Dalmau
 		Constraint Satisfaction Problems in Non-Deterministic Logarithmic Space
#537 8-7-2002
12:0 - 12:50
Nicola Galesi
Juan Luis Esteban
Jochen Messner
 		On the Complexity of Resolution with Bounded Conjunctions
#538 8-7-2002
12:50 - 13:40
Andreas Jakoby
Maciej Liskiewicz
 		Paths Problems in Symmetric Logarithmic Space
#539 9-7-2002
12:40 - 13:30
John Hitchcock
Jack Lutz
 		Why Computational Complexity Requires Stricter Martingales
#549 8-7-2002
12:50 - 13:40
Yuval Ishai
Eyal Kushilevitz
 		Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
#551 8-7-2002
12:0 - 12:50
Nathan Segerlind
 		Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
#552 8-7-2002
10:0 - 11:15
Alex Fabrikant
Elias Koutsoupias
Christos Papadimitriou
 		Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet
#555 10-7-2002
11:40 - 12:30
Moses Charikar
Kevin Chen
Martin Farach-Colton
 		Finding Frequent Items in Data Streams
#556 8-7-2002
10:0 - 11:15
Sebastian Bala
 		Intersection of Regular Languages and Star Hierarchy
#560 10-7-2002
17:10 - 18:25
Karhan Akcoglu
Petros Drineas
Ming-Yang Kao
 		Fast Universalization of Investment Strategies with Provably Good Relative Returns
#566 8-7-2002
10:0 - 11:15
Dimitrios Fotakis
Spyros Kontogiannis
Elias Koutsoupias
Marios Mavronicolas
Paul Spirakis
 		The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
#582 8-7-2002
12:0 - 12:50
Michael Bender
Richard Cole
Rajeev Raman
 		Exponential structures for cache-oblivious algorithms
#588 11-7-2002
14:30 - 15:55
Andrzej Lingas
Artur Czumaj
Hairong Zhao
 		Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
#594 11-7-2002
12:10 - 13:0
Peter Hertling
 		A Banach-Mazur Computable but not Markov Computable Function on the Computable Real Numbers
#599 8-7-2002
10:0 - 11:15
Jurdzinski Tomasz
Lorys Krzysztof
 		Church-Rosser Languages vs UCFL
#600 11-7-2002
16:0 - 16:50
Yoshiharu Kohayakawa
Brendan Nagle
Vojtech Rodl
 		Efficient testing of hypergraphs (extended abstract)
#601 10-7-2002
10:0 - 11:15
Tomasz Radzik
 		Improving time bounds on maximum generalised flow computations by contracting the network
#602 10-7-2002
17:10 - 18:25
Doerr Benjamin
 		Antirandomizing the Wrong Game
#606 10-7-2002
11:40 - 12:30
Sudipto Guha
Piotr Indyk
Muthu Muthukrishnan
Martin Strauss
 		Histogramming Data Streams with Fast Per-Item Processing
#610 8-7-2002
12:50 - 13:40
Aggelos Kiayias
Moti Yung
 		Cryptographic Hardness based on the Decoding of Reed-Solomon Codes
#622 9-7-2002
10:0 - 11:15
Rolf Fagerberg
Gerth St?lting Brodal
 		Cache Oblivious Distribution Sweeping
#631 11-7-2002
17:10 - 18:25
Mohamed Mosbah
Nicolas Bonichon
Bertrand Le Saec
 		Wagner's theorem on Realizers

Mostrar la lista ordenada por temas de la conferencia

[Principal] [Programa] [Articulos aceptados] [Enviar Articulos] [Noticias] [Fechas Importantes] [Informacion] [Conferenciantes Invitados] [Enlaces] [Contacte con Nosotros] [Patrocinadores] [Peticion de Articulos] [Organizacion] [Comite de Programa] [Talleres y tutoriales] [Ayuda]