The following pages link to Cosmin Bonchiş (Q952193):
Displayed 18 items.
- Compositional asynchronous membrane systems (Q952195) (← links)
- The language (and series) of Hammersley-type processes (Q1647315) (← links)
- Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms (Q2283109) (← links)
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem (Q2446594) (← links)
- A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
- The Minimum Entropy Submodular Set Cover Problem (Q2798728) (← links)
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems (Q2829966) (← links)
- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process (Q2942262) (← links)
- (Q2969102) (← links)
- On the heapability of finite partial orders (Q3386613) (← links)
- Unconventional Computation (Q5479201) (← links)
- Theory and Applications of Models of Computation (Q5898915) (← links)
- Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games) (Q6249128) (← links)
- Parallel simulations for Fractional-Order Systems (Q6280158) (← links)
- The language (and series) of Hammersley-type processes (Q6297547) (← links)
- Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm (Q6326073) (← links)
- Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games (Q6354627) (← links)
- Kernelization, Proof Complexity and Social Choice (Q6366346) (← links)