Amanote Research

Amanote Research

    RegisterSign In

Highly Non-Concurrent Longest Paths in Lattices

Turkish Journal of Mathematics - Turkey
doi 10.3906/mat-1502-32
Full Text
Open PDF
Abstract

Available in full text

Categories
Mathematics
Date

January 1, 2016

Authors
Yasir BASHIRFaisal NADEEMAyesha SHABBIR
Publisher

The Scientific and Technological Research Council of Turkey


Related search

Telomere-Independent Ageing in the Longest-Lived Non-Colonial Animal, Arctica Islandica

Experimental Gerontology
AgingGeneticsCell BiologyMolecular BiologyBiochemistryEndocrinology
2014English

Proving Correctness of Highly-Concurrent Linearisable Objects

2006English

Non-Universality for Longest Increasing Subsequence of a Random Walk

Alea
StatisticsProbability
2017English

Concurrent Security and Non-Malleability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Methodology for Implementing Highly Concurrent Data Objects

Operating Systems Review (ACM)
HardwareComputer NetworksInformation SystemsArchitectureCommunications
1992English

Convexity Conditions for Non-Locally Convex Lattices

Glasgow Mathematical Journal
Mathematics
1984English

Large-Scale Distributed Storage for Highly Concurrent Mapreduce Applications

2010English

Emulating Non-Abelian Topological Matter in Cold-Atom Optical Lattices

Physical Review A
2008English

Integration of Paths―a Faithful Representation of Paths by Non-Commutative Formal Power Series

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1958English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy