The following pages link to Recommended article (P1643):
Displaying 50 items.
- Phenomenological approach to simulating hydraulic fracturing of a stratum (Q290144) (← links)
- Chemically reactive hydromagnetic flow of a second-grade fluid in a semi-porous channel (Q290145) (← links)
- Model of a thermo-elastic-inelastic process with large deformations and structural changes in material (Q290147) (← links)
- Program of experiments to determine the type of initial elastic anisotropy of material (Q290150) (← links)
- The value of information in risk-sharing environments with unawareness (Q290152) (← links)
- Quantal response methods for equilibrium selection in \(2\times 2\) coordination games (Q290153) (← links)
- Second-order beliefs in reputation systems with endogenous evaluations -- an experimental study (Q290156) (← links)
- Sanctions in networks: ``The most unkindest cut of all'' (Q290159) (← links)
- Fair implementation of diversity in school choice (Q290161) (← links)
- Gathering imperfect information before signing a contract (Q290164) (← links)
- Cooperation and distributive conflict (Q290166) (← links)
- Testing guilt aversion with an exogenous shift in beliefs (Q290168) (← links)
- Peer effects and incentives (Q290169) (← links)
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics (Q290170) (← links)
- Information revelation in auctions with common and private values (Q290172) (← links)
- Efficient dynamic mechanisms with interdependent valuations (Q290174) (← links)
- Doing it now, later, or never (Q290176) (← links)
- An externality-robust auction: theory and experimental evidence (Q290178) (← links)
- The curse of uninformed voting: an experimental study (Q290181) (← links)
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Optimal parallel randomized renaming (Q290183) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- The average height of a node in the BANG abstract directory tree (Q290196) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202) (← links)
- Resolving data conflicts with multiple versions and precedence relationships in real-time databases (Q290204) (← links)
- The diameter of the cube-connected cycles (Q290207) (← links)
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- Finding pattern matchings for permutations (Q290212) (← links)
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- A note on approximating graph genus (Q290221) (← links)
- An exact analysis on expected seeks in shadowed disks (Q290223) (← links)
- Minimal sense of direction in regular networks (Q290224) (← links)
- Using OBDDs to handle dynamic constraints (Q290226) (← links)
- Dynamic connectivity in digital images (Q290227) (← links)
- A regeneration scheme for generating extensions (Q290228) (← links)
- An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
- A note on error-correcting codes for authentication and subliminal channels (Q290234) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Decimal adjustment of long numbers in constant time (Q290242) (← links)
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity (Q290244) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- An approximation algorithm for least median of squares regression (Q290249) (← links)
