Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification

doi 10.3115/1075218.1075263
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Memory Efficient Anonymous Graph Exploration

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Thread-Safe Reactive Programming

Proceedings of the ACM on Programming Languages
2018English

Concurrent Call Level Interfaces Based on an Embedded Thread Safe Local Memory Structure

2017English

MUC (Memory, Unification, Control) and Beyond

Frontiers in Psychology
Psychology
2013English

Effective, Safe and Efficient

European Journal of Hospital Pharmacy: Science and Practice
Pharmacy
2012English

Effective and Efficient Dynamic Graph Coloring

Proceedings of the VLDB Endowment
Computer Science
2017English

Safe Sets in Graphs: Graph Classes and Structural Parameters

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2017English

Constant Memory Routing in Quasi-Planar and Quasi-Polyhedral Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Leveraging Hardware Message Passing for Efficient Thread Synchronization

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy