On the public citation graph
Parallel depth first search. Part I. Implementation
0 signed · 166 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_3openalex-snapshot
A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_7openalex-snapshot
Optimal Path-Finding Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01379323openalex-snapshot
Performance of an OR-parallel logic programming system
inferredcites →https://doi.org/10.1007/bf01389001openalex-snapshot
Parallel depth first search. Part II. Analysis
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0020-0190(83)90092-3openalex-snapshot
Derivation of a termination detection algorithm for distributed computations
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/s0004-3702(83)80009-5openalex-snapshot
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1109/tc.1980.1675681openalex-snapshot
Distributed Enumeration on Between Computers
inferredcites →https://doi.org/10.1109/tc.1984.1676453openalex-snapshot
MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1109/tpami.1984.4767600openalex-snapshot
Parallel Branch-and-Bound Formulations for AND/OR Tree Search
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.5860/choice.26-2172openalex-snapshot
Search in artificial intelligence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330060802openalex-snapshot
Dynamo ‐ a portable tool for dynamic load balancing on distributed memory multicomputers
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1070openalex-snapshot
Scalable Load Balancing Techniques for Parallel Computers
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1409openalex-snapshot
Automated Parallelization of Discrete State-Space Generation
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1539openalex-snapshot
The PMESC Programming Library for Distributed-Memory MIMD Computers
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_95openalex-snapshot
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
inferred← citeshttps://doi.org/10.1007/3-540-44942-6_24openalex-snapshot
Parallel Branch-and-Bound for Chemical Engineering Applications: Load Balancing and Scheduling Issues
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_6openalex-snapshot
Branch, Cut, and Price: Sequential and Parallel
inferred← citeshttps://doi.org/10.1007/3-540-45945-6openalex-snapshot
Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
inferred← citeshttps://doi.org/10.1007/3-540-46043-8_60openalex-snapshot
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_5openalex-snapshot
Asynchronous Random Polling Dynamic Load Balancing
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_79openalex-snapshot
Superlinear speedup in parallel state-space search
inferred← citeshttps://doi.org/10.1007/3-540-54535-2_27openalex-snapshot
Wave-shaping in multiprocessor bidirectional heuristic state space search
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_67openalex-snapshot
Efficient parallel divide-and-conquer for a class of interconnection topologies
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_32openalex-snapshot
Improved branch and bound in constraint logic programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_6openalex-snapshot
Sequential and Parallel Branch-and-Bound Search under Limited-Memory Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4612-3390-9_1openalex-snapshot
Scalable Parallel Formulations of Depth-First Search
inferred← citeshttps://doi.org/10.1007/978-1-4612-3390-9_2openalex-snapshot
Parallel Heuristic Search: Two Approaches
inferred← citeshttps://doi.org/10.1007/978-1-4612-3390-9_4openalex-snapshot
Multiprocessing of Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-3390-9_6openalex-snapshot
Prism: a Testbed for Parallel Control
inferred← citeshttps://doi.org/10.1007/978-1-4613-9177-7_6openalex-snapshot
Analytical and heuristic modeling of distributed algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_5openalex-snapshot
Scalable Parallel Algorithms for Unstructured Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_11openalex-snapshot
Parallel A* for State-Space Search
inferred← citeshttps://doi.org/10.1007/978-3-540-89894-8_16openalex-snapshot
Parsing XML Using Parallel Traversal of Streaming Trees
inferred← citeshttps://doi.org/10.1007/978-3-7908-1816-1_9openalex-snapshot
Parallel Subgraph Matching on a Hierarchical Interconnection Network
inferred← citeshttps://doi.org/10.1007/978-981-97-3556-3_27openalex-snapshot
Solving the Crossword Generation Problem Using Parallel Programming in Moderns Browsers: A Case Study
inferred← citeshttps://doi.org/10.1007/bf00116898openalex-snapshot
Scaling Up Inductive Learning with Massive Parallelism
inferred← citeshttps://doi.org/10.1007/bf01379360openalex-snapshot
Parallel state-space search for a first solution with consistent linear speedups
inferred← citeshttps://doi.org/10.1007/bf01389001openalex-snapshot
Parallel depth first search. Part II. Analysis
inferred← citeshttps://doi.org/10.1007/bf01547894openalex-snapshot
Scheduling in or-parallel Prolog systems: Survey and open problems
inferred← citeshttps://doi.org/10.1007/bfb0018367openalex-snapshot
Automatic test pattern generation on multiprocessors: a summary of results
inferred← citeshttps://doi.org/10.1007/bfb0018645openalex-snapshot
Prioritization in parallel symbolic computing
inferred← citeshttps://doi.org/10.1007/bfb0035459openalex-snapshot
Parallel search algorithms for discrete optimization problems
inferred← citeshttps://doi.org/10.1007/bfb0053041openalex-snapshot
An object-oriented class library for scalable parallel heuristic search
inferred← citeshttps://doi.org/10.1007/s10458-007-9020-yopenalex-snapshot
Using quantitative models to search for appropriate organizational designs
inferred← citeshttps://doi.org/10.1007/s10898-011-9771-5openalex-snapshot
On estimating workload in interval branch-and-bound global optimization algorithms
inferred← citeshttps://doi.org/10.1007/s10951-022-00757-3openalex-snapshot
Graph representation of the fixed route dial-a-ride problem
inferred← citeshttps://doi.org/10.1007/s11227-005-0165-7openalex-snapshot
Distributed Unidirectional and Bidirectional Heuristic Search: Algorithm Design and Empirical Assessment
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90002-sopenalex-snapshot
Depth-first heuristic search on a SIMD machine
inferred← citeshttps://doi.org/10.1016/j.artint.2012.10.007openalex-snapshot
Evaluation of a simple, scalable, parallel best-first search strategy
inferred← citeshttps://doi.org/10.1016/j.carbon.2026.121945openalex-snapshot
Shock response of carbon fiber microstructure using molecular dynamics simulations
inferred← citeshttps://doi.org/10.1016/j.cor.2019.04.021openalex-snapshot
A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations
inferred← citeshttps://doi.org/10.1016/j.cpc.2015.07.014openalex-snapshot
A parallel algorithm for random searches
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.10.043openalex-snapshot
A parallel graph edit distance algorithm
inferred← citeshttps://doi.org/10.1016/j.gmod.2010.01.001openalex-snapshot
MCCD: Multi-core collision detection between deformable models using front-based decomposition
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.002openalex-snapshot
Stack splitting: A technique for efficient exploitation of search parallelism on share-nothing platforms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.04.008openalex-snapshot
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
inferred← citeshttps://doi.org/10.1016/j.peva.2004.10.009openalex-snapshot
Performance evaluation of parallel iterative deepening A* on clusters of workstations
inferred← citeshttps://doi.org/10.1016/j.trc.2013.09.017openalex-snapshot
Separation-compliant, optimal routing and control of scheduled arrivals in a terminal airspace
inferred← citeshttps://doi.org/10.1016/s0098-1354(02)00006-6openalex-snapshot
Dynamic load balancing for parallel interval-Newton using message passing
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80001-8openalex-snapshot
Automatic test pattern generation on parallel processors
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00049-0openalex-snapshot
Data-parallel load balancing strategies
inferred← citeshttps://doi.org/10.1016/s0360-8352(00)00042-5openalex-snapshot
Statistically assessing distributed computing approaches
inferred← citeshttps://doi.org/10.1017/s0956796800000484openalex-snapshot
A run-time algorithm for managing the granularity of parallel functional programs
inferred← citeshttps://doi.org/10.1017/s1471068406002985openalex-snapshot
PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
inferred← citeshttps://doi.org/10.1023/a:1009876119989openalex-snapshot
A Survey of Methods for Scaling Up Inductive Algorithms
inferred← citeshttps://doi.org/10.1023/b:supe.0000020179.55383.adopenalex-snapshot
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
inferred← citeshttps://doi.org/10.1038/s41563-018-0205-3openalex-snapshot
Solving mazes with single-molecule DNA navigators
inferred← citeshttps://doi.org/10.1039/c9cp03585kopenalex-snapshot
A ReaxFF molecular dynamics study of molecular-level interactions during binder jetting 3D-printing
inferred← citeshttps://doi.org/10.1080/17445761003604521openalex-snapshot
Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation
inferred← citeshttps://doi.org/10.1109/24.257827openalex-snapshot
Parallel processing of fault trees on a locally distributed multiple-processor network
inferred← citeshttps://doi.org/10.1109/34.134045openalex-snapshot
Single-agent parallel window search
inferred← citeshttps://doi.org/10.1109/43.46806openalex-snapshot
A parallel branch and bound algorithm for test generation
inferred← citeshttps://doi.org/10.1109/71.219757openalex-snapshot
On the efficiency of parallel backtracking
inferred← citeshttps://doi.org/10.1109/71.238626openalex-snapshot
The scalability of FFT on parallel computers
inferred← citeshttps://doi.org/10.1109/71.243526openalex-snapshot
Strategies for dynamic load balancing on highly parallel computers
inferred← citeshttps://doi.org/10.1109/71.262590openalex-snapshot
Evaluation of a parallel branch-and-bound algorithm on a class of multiprocessors
inferred← citeshttps://doi.org/10.1109/71.313122openalex-snapshot
Unstructured tree search on SIMD parallel computers
inferred← citeshttps://doi.org/10.1109/71.506702openalex-snapshot
Runtime incremental parallel scheduling (RIPS) on distributed memory computers
inferred← citeshttps://doi.org/10.1109/71.598276openalex-snapshot
A parallel algorithm for graph matching and its MasPar implementation
inferred← citeshttps://doi.org/10.1109/88.242438openalex-snapshot
Isoefficiency: measuring the scalability of parallel algorithms and architectures
inferred← citeshttps://doi.org/10.1109/aiccsa.2011.6126581openalex-snapshot
A comparson of receiver initiated DLB schemes via Parallel DFS
inferred← citeshttps://doi.org/10.1109/apsipaasc47483.2019.9023211openalex-snapshot
Optimising Search Operations with Swarm Intelligence
inferred← citeshttps://doi.org/10.1109/bibe.2004.1317356openalex-snapshot
The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.14openalex-snapshot
A Static Load-Balancing Scheme for Parallel XML Parsing on Multicore CPUs
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633162openalex-snapshot
Efficient Parallel Execution of IDA on Shared and Distributed Memory Multiprocessors
inferred← citeshttps://doi.org/10.1109/escience.2014.15openalex-snapshot
Web-Scale Distributed eScience AI Search across Disconnected and Heterogeneous Infrastructures
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89455openalex-snapshot
Efficient parallel algorithms for search problems: applications in VLSI CAD
inferred← citeshttps://doi.org/10.1109/hicss.1993.284115openalex-snapshot
Analyzing performance of large scale parallel systems
inferred← citeshttps://doi.org/10.1109/hicss.1994.323365openalex-snapshot
A distributed architecture for an instructable problem solver
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173550openalex-snapshot
Performance of dynamic load balancing algorithm on cluster of workstations and PCs
inferred← citeshttps://doi.org/10.1109/iccd.1989.63338openalex-snapshot
Floorplan optimization on multiprocessors
inferred← citeshttps://doi.org/10.1109/iccd.1995.528944openalex-snapshot
Distributed automatic test pattern generation with a parallel FAN algorithm
inferred← citeshttps://doi.org/10.1109/icde.2019.00029openalex-snapshot
Efficient Parallel Subgraph Enumeration on a Single Machine
inferred← citeshttps://doi.org/10.1109/icgrid.2006.311019openalex-snapshot
A Parallel Approach to XML Parsing
inferred← citeshttps://doi.org/10.1109/icis.2009.152openalex-snapshot
A Hybrid Branch-and-Bound Strategy for Hardware/Software Partitioning
inferred← citeshttps://doi.org/10.1109/icpads.1997.652576openalex-snapshot
Load balancing strategies for parallel forward search algorithm with conflict based backjumping
inferred← citeshttps://doi.org/10.1109/icpp.1999.797395openalex-snapshot
A parallel optimal branch-and-bound algorithm for MIN-based multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.18openalex-snapshot
Parallelization of Recursive Preorder Traversal Based on Building and Winding Call Stacks
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00107openalex-snapshot
Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00157openalex-snapshot
Parallel Maximum Cardinality Matching for General Graphs on GPUs
inferred← citeshttps://doi.org/10.1109/ipps.1992.223037openalex-snapshot
Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors
inferred← citeshttps://doi.org/10.1109/ipps.1996.508195openalex-snapshot
Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
inferred← citeshttps://doi.org/10.1109/ispan.1994.367176openalex-snapshot
A detailed analysis of random polling dynamic load balancing
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644869openalex-snapshot
Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine
inferred← citeshttps://doi.org/10.1109/robot.1993.292122openalex-snapshot
Parallel search algorithms for robot motion planning
inferred← citeshttps://doi.org/10.1109/sc.2012.82openalex-snapshot
On distributed file tree walk of parallel file systems
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185364openalex-snapshot
Communication complexity for parallel divide-and-conquer
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296719openalex-snapshot
Work-load balancing in highly parallel depth-first search
inferred← citeshttps://doi.org/10.1109/spdp.1991.218272openalex-snapshot
Parallel tree search on a SIMD machine
inferred← citeshttps://doi.org/10.1109/spdp.1995.530710openalex-snapshot
A generalized utility for parallel branch and bound algorithms
inferred← citeshttps://doi.org/10.1109/superc.1992.236658openalex-snapshot
Unstructured tree search on SIMD parallel computers: a summary of results
inferred← citeshttps://doi.org/10.1109/superc.1992.236707openalex-snapshot
Scalability analysis of partitioning strategies for finite element graphs: a summary of results
inferred← citeshttps://doi.org/10.1109/superc.1994.344324openalex-snapshot
Parallel performance prediction using lost cycles analysis
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01611.xopenalex-snapshot
gProximity: Hierarchical GPU‐based Operations for Collision and Distance Queries
inferred← citeshttps://doi.org/10.1137/0804046openalex-snapshot
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
inferred← citeshttps://doi.org/10.1142/s0129054100000144openalex-snapshot
RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING
inferred← citeshttps://doi.org/10.1145/1287624.1287679openalex-snapshot
A framework for characterization and analysis of software system scalability
inferred← citeshttps://doi.org/10.1145/1629255.1629303openalex-snapshot
Multi-core collision detection between deformable models
inferred← citeshttps://doi.org/10.1145/1655925.1656170openalex-snapshot
Multi-channel video-based parallel fire detection acceleration method using multi-cores
inferred← citeshttps://doi.org/10.1145/258492.258515openalex-snapshot
Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers
inferred← citeshttps://doi.org/10.1145/2807591.2807651openalex-snapshot
A work-efficient algorithm for parallel unordered depth-first search
inferred← citeshttps://doi.org/10.1145/3774934.3786457openalex-snapshot
DiggerBees: Depth First Search Leveraging Hierarchical Block-Level Stealing on GPUs
inferred← citeshttps://doi.org/10.1145/582034.582057openalex-snapshot
Parallel interval-Newton using message passing
inferred← citeshttps://doi.org/10.1145/74382.74439openalex-snapshot
A parallel branch and bound algorithm for test generation
inferred← citeshttps://doi.org/10.1145/99163.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
inferred← citeshttps://doi.org/10.1145/99164.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
inferred← citeshttps://doi.org/10.1147/rd.482.0153openalex-snapshot
A new load-balancing strategy for the solution of dynamical large-tree-search problems using a hierarchical approach
inferred← citeshttps://doi.org/10.11606/d.45.2018.tde-07012018-212020openalex-snapshot
Melhorando o ataque de reação contra o QC-MDPC McEliece
inferred← citeshttps://doi.org/10.1177/0165551513519212openalex-snapshot
Performance evaluation of parallel multithreaded A* heuristic search algorithm
inferred← citeshttps://doi.org/10.1186/1755-8794-8-s2-s15openalex-snapshot
Parallelization of enumerating tree-like chemical compounds by breadth-first search order
inferred← citeshttps://doi.org/10.12733/jics20101591openalex-snapshot
Parallel and Complete Model Checking with Linear Complexity
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1193openalex-snapshot
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
inferred← citeshttps://doi.org/10.14311/cej.2018.01.0009openalex-snapshot
SEARCHING UNGROUND FAN INDUCED RECIRCULATION IN A COMPLICATED MINE VENTILATION NETWORK
inferred← citeshttps://doi.org/10.1504/ijcat.2005.006799openalex-snapshot
The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database
inferred← citeshttps://doi.org/10.1504/ijcse.2005.009703openalex-snapshot
Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.1798openalex-snapshot
High-Speed Computation of the Kleene Star in Max-Plus Algebraic System Using a Cell Broadband Engine
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8139openalex-snapshot
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13350openalex-snapshot
Scalable, Parallel Best-First Search for Optimal Sequential Planning
inferred← citeshttps://doi.org/10.18038/btd-a.04907openalex-snapshot
A PARALLEL DEPTH-FIRST SEARCH ALGORITHM USING LIST OF QUEUES ON PEG SOLITAIRE GAME
inferred← citeshttps://doi.org/10.3390/en13113019openalex-snapshot
Investigation of Fast, Secure and Reliable Network Restoration after Blackouts
inferred← citeshttps://doi.org/10.3934/mbe.2023686openalex-snapshot
Artificial intelligence for video game visualization, advancements, benefits and challenges
inferred← citeshttps://doi.org/10.4236/jsea.2012.58071openalex-snapshot
Parallelization of a Branch and Bound Algorithm on Multicore Systems
inferred← citeshttps://doi.org/10.5555/147877.147912openalex-snapshot
Scalability analysis of partitioning strategies for finite element graphs: a summary of results
inferred← citeshttps://doi.org/10.5555/147877.148046openalex-snapshot
Unstructured tree search on SIMD parallel computers: a summary of results
inferred← citeshttps://doi.org/10.5555/1791889.1791908openalex-snapshot
Parsing XML using parallel traversal of streaming trees
inferred← citeshttps://doi.org/10.5555/2388996.2389114openalex-snapshot
On distributed file tree walk of parallel file systems
inferred← citeshttps://doi.org/10.5555/602770.602870openalex-snapshot
Parallel performance prediction using lost cycles analysis
inferred← citeshttps://doi.org/10.5555/777092.777203openalex-snapshot
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
inferred← citeshttps://doi.org/10.5753/eradsp.2022.221984openalex-snapshot
Paralelizando um algoritmo de backtracking no navegador com Web Workers e WebAssembly
inferred← citeshttps://doi.org/10.70675/652e5f60z5df2z451dz87d6z1734c2bd6d86openalex-snapshot
Intégration des problèmes de satisfaction de contraintes distribués et sécurisés dans les systèmes d'aide à la décision à base de connaissances
inferred← citeshttps://doi.org/10.70675/dc93c1caz03e1z43aaz85e0z6726c8e850ceopenalex-snapshot
Anytime and distributed approaches for graph matching
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.