Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
Information Processing Letters
Связанные издания:
A Bold New Look for Word Processing
Achive optimal CRCW PRAM fault-tolerance
A competitive 2-server algorithm
A Distributed Self-Stabilizing Solution to the Dining philosophers Problem
A Fuzzy Petri Net for knowledge representation and reasoning
A graph transformation algorithms for concurrency control in a partitioned database
A Hierarchy of Tractable Satisfiability Problems
A LISP programming exercise
Analysis of Hierarchical Bus-Based Multicomputer Architectures
Analysis of parallel uniform hashing
An Axiom System for Database Transactions
An Execution Mechanism for Nondeterministic, State-Oriented Programs Based on a Chart Parser
An optimal parallel adaptive sorting algorithm
A note on the subtree isomorphism for order and relate problems
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
A Simple fixed point characterization of three-valued stable model semantics
A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming
A space efficient distributive sort
A Still Better Performance Guarantee for Approximate Graph Coloring
A Systematic Analysis of Splaying
Batch checking with applications to linear functions
Binary Search with Errors and Variable Cost Queries
Bloking versus Nonbloking Interprocess Communication: A Note on the Effect on concurrency
Colored Cause-Effect Structures
Compositionality and bisimulation: A negative resalt
Cyclic Reference Counting with Lazy Mark-scan
Derivation of logic programs by functional methods
Finitary Logics for some CCS Observational Bisimulations
From algebra to operational semantics
Hypotetical Reasoning in Logic Programming: A Semantic Approach
Inductive inference from all positive and some negative data
Integrity aspects of quasi serializability
Loop cleaning
Multidisk Partial Match File Design with Known Access Pattern
Normal Forms Have Partial Types
NP-completeness of k-connected hyperedge-replacement languages of order k
On a graph partition problem with application to VLSI layout
On a hierarchy of classes for nested databases
On binary search trees
On Constructing Multiple Spanning Trees in a Hypercube
On "inherently context-sensitive" languages - An application of complexity cores
On the minimum requirements for independent recovery in distributed systems
Optimal Block Size for Set-Valued Attributes
Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
Overlap Closures do not suffice for termination of general term rewriting systems
Parallel Boolean operations for information retrieval
Performance Analysis of a Main Memory Multi-Directory Hashing Technique
Performance Analysis of File Organizations that Use Multi-Bucket
Phase synchroization
Prefix-free languages as omega-generators
1
2
следующая ›
последняя »