default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 299
Volume 299, Number 1-3, 18 April 2003
- Bruno Courcelle:
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. 1-36 - Letizia Magnoni, Massimo Mirolli, Franco Montagna, Giulia Simi:
PAC learning of probability distributions over a discrete domain. 37-63 - Julio Aracena, Eric Goles Ch.:
Complexity of perceptron recognition for a class of geometric patterns. 65-79 - Marcos A. Kiwi
:
Algebraic testing and weight distributions of codes. 81-106 - Frank K. Hwang:
A survey on multi-loop networks. 107-121 - Chiara Epifanio, Michel Koskas, Filippo Mignosi:
On a conjecture on bidimensional words. 123-150 - David R. Wood:
Optimal three-dimensional orthogonal graph drawing in the general position model. 151-178 - Miklós Bartha, Miklós Krész:
Structuring the elementary components of graphs having a perfect internal matching. 179-210 - Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu:
Approximation algorithms for NMR spectral peak assignment. 211-229 - Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer:
Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees. 231-271 - Subhas C. Nandy, Sandip Das, Partha P. Goswami:
An efficient k nearest neighbors searching algorithm for a query line. 273-288 - Dahlia Malkhi, Yishay Mansour, Michael K. Reiter:
Diffusion without false rumors: on propagating updates in a Byzantine environment. 289-306 - Markus Holzer, Pierre McKenzie:
Alternating and empty alternating auxiliary stack automata. 307-326 - Olivier Finkel:
On omega context free languages which are Borel sets of infinite rank. 327-346 - Dietrich Kuske:
Towards a language theory for infinite N-free pomsets. 347-386 - Kjell Lemström, Lauri Hella:
Approximate pattern matching and transitive closure logics. 387-412 - Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
Presburger liveness verification of discrete timed automata. 413-438 - Leah Epstein, Rob van Stee:
Lower bounds for on-line single-machine scheduling. 439-450 - Michaël Rusinowitch, Mathieu Turuani:
Protocol insecurity with a finite number of sessions, composed keys is NP-complete. 451-475 - Francesca Fiorenzi:
Cellular automata and strongly irreducible shifts of finite type. 477-493 - Shankara Narayanan Krishna, Raghavan Rama:
Breaking DES using P systems. 495-508 - Bruce W. Watson:
A new regular grammar pattern matching algorithm. 509-521 - Bruno Durand, Enrico Formenti, Zsuzsanna Róka:
Number-conserving cellular automata I: decidability. 523-535 - Lars Engebretsen, Jonas Holmerin:
Towards optimal lower bounds for clique and chromatic number. 537-584 - Alain Giorgetti:
An asymptotic study for path reversal. 585-602 - Marcel Wild:
Idempotent and co-idempotent stack filters and min-max operators. 603-631 - Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. 633-662 - Alexander Okhotin:
On the closure properties of linear conjunctive languages. 663-685 - Oscar H. Ibarra, Zhe Dang:
Eliminating the storage tape in reachability constructions. 687-706 - Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On finding common neighborhoods in massive graphs. 707-718 - Michael U. Gerber, Daniel Kobler:
Algorithms for vertex-partitioning problems on graphs with fixed clique-width. 719-734 - Pierre-Cyrille Héam:
Some complexity results for polynomial rational expressions. 735-741 - Y. J. Liu:
Regular component decomposition of regular languages. 743-749 - Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks. 751-761 - Wojciech Rytter:
On maximal suffixes, constant-space linear-time versions of KMP algorithm. 763-774 - Pedro García, José Ruiz, Manuel Vazquez de Parga:
Bilateral locally testable languages. 775-783 - Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil:
PC grammar systems with five context-free components generate all recursively enumerable languages. 785-794
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 2025-02-21 19:35 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:
