Sciweavers

1209 search results - page 160 / 242
» Universal Algebra and Computer Science
Sort
View
JGAA
2006
108views more  JGAA 2006»
15 years 3 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
99
Voted
JSS
2007
123views more  JSS 2007»
15 years 3 months ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller
TOIT
2002
66views more  TOIT 2002»
15 years 3 months ago
xlinkit: a consistency checking and smart link generation service
xlinkit is a lightweight application service that provides rule-based link generation and checks the consistency of distributed web content. It leverages standard Internet technol...
Christian Nentwich, Licia Capra, Wolfgang Emmerich...
110
Voted
STACS
2009
Springer
15 years 10 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
145
Voted
LICS
2009
IEEE
15 years 10 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi