Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

59

Voted

ERSHOV
2001
Springer

favoriteEmaildiscussreport

70views Theoretical Computer Science» more ERSHOV 2001»

Abstract Computability of Non-deterministic Programs over Various Data Structures

15 years 3 months ago

Abstract Computability of Non-deterministic Programs over Various Data Structures

Download www.nbuv.gov.ua

Nikolaj S. Nikitchenko

Real-time Traffic

ERSHOV 2001 | Theoretical Computer Science |

claim paper

Related Content

» Deciding inclusion of set constants over infinite nonstrict data structures

» Static Analysis of CLP Programs over Numeric Domains

» An extensible global address space framework with decoupled task and data abstractions

» Dynamic Task and Data Placement over NUMA Architectures An OpenMP Runtime Perspective

» Finding lowutility data structures

» Rewriting Systems with Data

» Networked Computing in Wireless Sensor Networks for Structural Health Monitoring

» On the Concept of Software Obfuscation in Computer Security

» XML Query Routing in Structured P2P Systems

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	ERSHOV
Authors	Nikolaj S. Nikitchenko

Comments (0)