The following pages link to Jon M. Kleinberg (Q1199885):
Displaying 50 items.
- (Q222775) (redirect page) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Query strategies for priced information (Q696973) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Trading networks with price-setting agents (Q834853) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Voronoi diagrams of rigidly moving sets of points (Q1199886) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A lower bound for two-server balancing algorithms (Q1336749) (← links)
- Auditing Boolean attributes (Q1394802) (← links)
- On discrete preferences and coordination (Q1686225) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Information-sharing in social networks (Q2437849) (← links)
- How bad is forming your own opinion? (Q2516243) (← links)
- Optimal stopping with behaviorally biased agents: the role of loss aversion and changing reference points (Q2673227) (← links)
- Wavelength Conversion in Optical Networks (Q2709790) (← links)
- (Q2723955) (← links)
- (Q2896064) (← links)
- (Q2921680) (← links)
- (Q2934689) (← links)
- (Q2941641) (← links)
- Adversarial queuing theory (Q2947002) (← links)
- Analysis of large-scale social and information networks (Q2955492) (← links)
- Education of a model student (Q2962161) (← links)
- Dynamic Models of Reputation and Competition in Job-Market Matching (Q2989014) (← links)
- Reconstructing a three-dimensional model with arbitrary errors (Q3158536) (← links)
- Authoritative sources in a hyperlinked environment (Q3158552) (← links)
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem (Q3167033) (← links)
- The small-world phenomenon (Q3191982) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
- Query strategies for priced information (extended abstract) (Q3192028) (← links)
- Network Failure Detection and Graph Connectivity (Q3395033) (← links)
- The Price of Stability for Network Design with Fair Cost Allocation (Q3395046) (← links)
- Fairness Measures for Resource Allocation (Q3446812) (← links)
- Triangulation and embedding using small sets of beacons (Q3452228) (← links)
- Approximation algorithms for classification problems with pairwise relationships (Q3455544) (← links)
- (Q3524733) (← links)
- Stability of Load Balancing Algorithms in Dynamic Adversarial Systems (Q3532581) (← links)
- (Q3549713) (← links)
- Line-of-Sight Networks (Q3557508) (← links)
- Stability of load balancing algorithms in dynamic adversarial systems (Q3579237) (← links)
- Metric Embeddings with Relaxed Guarantees (Q3654378) (← links)
- (Q4228491) (← links)
- (Q4228500) (← links)
- (Q4228514) (← links)
