default search action
Theoretical Computer Science, Volume 387
Volume 387, Number 1, November 2007
- Hans Ulrich Simon
, Etsuji Tomita:
Guest editors' foreword. 1-3 - Kazuho Watanabe
Stochastic complexity for mixture of exponential families in generalized variational Bayes. 4-17 - Nick Palmer, Paul W. Goldberg
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. 18-31 - Rotem Bennet, Nader H. Bshouty:
Learning attribute-efficiently with corrupt oracles. 32-50 - Sanjay Jain, Steffen Lange, Sandra Zilles:
A general comparison of language learning from examples and from queries. 51-66 - Sanjay Jain, Efim B. Kinber:
Learning multiple languages in groups. 67-76 - Vladimir Vovk
Non-asymptotic calibration and resolution. 77-89
Volume 387, Number 2, November 2007
- Hing Leung, Giovanni Pighizzini
Preface. 91-92 - Marco Almeida, Nelma Moreira
Enumeration and generation with a string automata representation. 93-102 - Franziska Biegler, Michael J. Burrell, Mark Daley:
Regulated RNA rewriting: Modelling RNA editing with guided insertion. 103-112 - Franziska Biegler, Ian McQuillan, Kai Salomaa:
An infinite hierarchy induced by depth synchronization. 113-124 - Brendan J. Cordy, Kai Salomaa:
On the existence of regular approximations. 125-135 - Jürgen Dassow, Bianca Truthe
On the number of components for some parallel communicating grammar systems. 136-146 - Michael Domaratzki
Transition complexity of language operations. 147-154 - Hermann Gruber
On the average state and transition complexity of finite languages. 155-166 - Hermann Gruber
The size of Higman-Haines sets. 167-176 - Carlo Mereghetti
Quantum automata for some multiperiodic languages. 177-186 - Frank Nießner, Ulrich Ultes-Nitsche
A complete characterization of deterministic regular liveness properties. 187-195
Volume 387, Number 3, November 2007
- Paolo Ferragina
Foreword. 197-199 - Peter M. Fenwick:
Burrows-Wheeler compression: Principles and reflections. 200-219 - Haim Kaplan, Shir Landau, Elad Verbin:
A simpler analysis of Burrows-Wheeler-based compression. 220-235 - Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino:
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. 236-248 - Juha Kärkkäinen:
Fast BWT in small space by blockwise suffix sorting. 249-257 - N. Jesper Larsson, Kunihiko Sadakane
Faster suffix sorting. 258-272 - Binh Dao Vo, Kiem-Phong Vo:
Compressing table data with column dependency. 273-283 - Jérémy Barbay
Adaptive searching in succinctly encoded binary relations and tree-structured documents. 284-297 - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
An extension of the Burrows-Wheeler Transform. 298-312 - Ankur Gupta, Wing-Kai Hon
Compressed data structures: Dictionaries and data-aware measures. 313-331 - Veli Mäkinen
Rank and select revisited and extended. 332-347 - Alexander Golynski:
Optimal lower bounds for rank and select indexes. 348-359
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: