Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic ScholarTheoretical Computer Science, Volume 299
Number 299, Volume 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 - 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 - Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
Presburger liveness verification of discrete timed automata. 413-438 - Michaël Rusinowitch, Mathieu Turuani:
Protocol insecurity with a finite number of sessions, composed keys is NP-complete. 451-475 - 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 - 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 - Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery 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 - Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks. 751-761 - Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil:
PC grammar systems with five context-free components generate all recursively enumerable languages. 785-794
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-27 00:08 CEST by the dblp team