pith. sign in

arxiv: 2605.16813 · v1 · pith:HPHYBWR7new · submitted 2026-05-16 · 💻 cs.GR · cs.CV

QuadLink: Autoregressive Quad-Dominant Mesh Generation via Point-Relation Learning

Yiheng Zhang , Zhe Zhu , Tingrui Shen , Zhuojiang Cai , Tianxiao Li , Zixing Zhao , Qiujie Dong , Zhiyang Dou
show 6 more authors
Jiepeng Wang Le Wan Yuwang Wang Wenping Wang Yuan Liu Cheng Lin
This is my paper

Pith reviewed 2026-05-19 19:44 UTC · model grok-4.3

classification 💻 cs.GR cs.CV
keywords quad dominant meshpoint cloudmesh generationautoregressivepoint relation learningtri to quadhybrid topology
0
0 comments X

The pith

QuadLink generates production-ready quad-dominant meshes from point clouds by learning to link points into structured faces.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces QuadLink, a three-stage framework that generates quad-dominant meshes from point clouds. It first predicts a unified set of anchors including vertices and face centroids. Then it learns links conditioned on these centroids to associate vertices with faces. Finally, it assembles the faces using a quad-first strategy with geometric verification. This allows for efficient creation of sparse, anisotropic meshes with coherent edge flow and support for various polygon types. The training uses a Tri-to-Quad Operator to prepare data from triangle meshes. Sympathetic readers would value this because it bridges the gap in producing meshes suitable for production in 3D graphics and design.

Core claim

QuadLink formulates polygonal mesh generation as a hybrid centroid-conditioned vertex linking model: it first predicts a unified set of anchors (vertices and face centroids), then learns centroid-conditioned links that associate vertices with face centroids, and finally assembles polygonal faces with a quad-first strategy guided by robust geometric verification strategies. This link-based formulation enables efficient generation of sparse and anisotropic quad-dominant meshes with coherent edge flow and meanwhile supporting hybrid polygonal topology.

What carries the argument

The hybrid centroid-conditioned vertex linking model for associating vertices with face centroids to assemble polygonal faces.

If this is right

  • It produces meshes with improved geometric fidelity and topological quality from point clouds.
  • The method supports sparse and anisotropic quad-dominant meshes with coherent edge flow.
  • Hybrid polygonal topology is natively supported without any changes to the architecture.
  • The Tri-to-Quad Operator provides a way to generate suitable training data from existing triangle meshes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This could reduce manual effort in retopologizing 3D models for animation and simulation.
  • The autoregressive aspect might enable generating meshes incrementally for large scenes.
  • Similar point-relation learning could be adapted for other input types like depth maps or images.
  • It may lead to more automated pipelines in industries requiring high-quality quad meshes.

Load-bearing premise

The Tri-to-Quad Operator converts artistic triangle meshes into quad-dominant training data in a way that does not introduce biases or artifacts that would degrade the learned linking model's performance on real point cloud inputs.

What would settle it

A direct comparison on diverse point cloud test sets where QuadLink shows no gains in standard geometric and topological metrics over existing methods would falsify the improved performance claim.

Figures

Figures reproduced from arXiv: 2605.16813 by Cheng Lin, Jiepeng Wang, Le Wan, Qiujie Dong, Tianxiao Li, Tingrui Shen, Wenping Wang, Yiheng Zhang, Yuan Liu, Yuwang Wang, Zhe Zhu, Zhiyang Dou, Zhuojiang Cai, Zixing Zhao.

Figure 1
Figure 1. Figure 1: QuadLink generates high-quality quad-dominant meshes with production-ready topology. The generation of production-ready quad-dominant meshes is a corner￾stone of modern 3D content creation. Generating anisotropic quad-dominant meshes from point clouds is challenging, as existing methods are typically limited to producing either pure triangular meshes or pure quadrilateral meshes with isotropic densities. I… view at source ↗
Figure 2
Figure 2. Figure 2: Artist-designed meshes differ fundamentally from those pro￾duced by geometry processing pipelines. We organize representative meshes along two axes: quadrilateral vs. triangular (horizontal) and artist vs. geometry-driven (vertical) within a single case for clear comparison. polygon budgets non-uniformly, using large stretched faces on se￾mantically simple regions while concentrating dense and directional … view at source ↗
Figure 3
Figure 3. Figure 3: Overview of QuadLink. The pipeline consists of three stages: Stage I: Anchor Prediction, where the input point cloud is processed by a Point Cloud Encoder followed by Hourglass Transformers to generate vertex and centroid tokens. Stage II: Link Modeling, which uses contrastive learning to model the relationships between centroids and vertices. Stage III: Face Assembly, where candidate faces are progressive… view at source ↗
Figure 4
Figure 4. Figure 4: Qualitative comparison with merge-edge methods. We compare Blossom-Quad in Gmsh [Geuzaine and Remacle 2009] with both greedy and global variants of our Tri-to-Quad Operator. Our global formulation yields higher-quality quad-dominant meshes for data curation. where 𝐴 is the face–edge incidence matrix ensuring that each trian￾gle participates in at most one merge. More details and parameters are provided in … view at source ↗
Figure 5
Figure 5. Figure 5: Applications of Quad-Dominant Meshes. Quad-dominant meshes enable cleaner semantic UV coloring and auto-unwrapping, supports common modeling operations such as beveling and subdivision, and provides coherent edge flow for controllable edge-loop editing instead of edge-by-edge editing. fragility of triangle-first generation followed by postprocessing. More qualitative results are provided in Supplementary C… view at source ↗
Figure 6
Figure 6. Figure 6: Qualitative ablation on Face Assembly (Stage III) under differ￾ent Geometric Verifications and Retrieval Spaces. Metric w/o Geometry Prefiltering w/ Geometry Prefiltering 𝑤_𝑄angle 𝑤_𝑄align w_both 𝑤_𝑄angle 𝑤_𝑄align w_both OEP ↑ 0.9322 0.8248 0.9317 0.9543 0.9439 0.9546 EFC ↑ 0.8641 0.7015 0.8642 0.9005 0.8763 0.9014 [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 8
Figure 8. Figure 8: Qualitative results on polygon generation with our method. 7 Conclusion We presented QuadLink, a unified framework consisting of three stages for natively generating production-ready quad-dominant [PITH_FULL_IMAGE:figures/full_fig_p008_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Qualitative comparison with field-guided remeshing methods. It is obvious that field-guided methods tend to produce near-isotropic layouts and are brittle on fine-grained details or complex topology [PITH_FULL_IMAGE:figures/full_fig_p009_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Qualitative comparison with triangle-based generation methods postprocessed by our Tri-to-Quad Operator [PITH_FULL_IMAGE:figures/full_fig_p010_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Qualitative visualizations of normal consistency enforcement during triangle merging. w/o enforcement leads to faces with inconsistent normal directions, highlighted in red (inward-facing faces). w enforcement shows results with consistent gray (outward-facing faces). B Architecture Details B.1 Hourglass Transformer for Stage I Anchor Prediction Rather than treating mesh token generation as a generic sequ… view at source ↗
Figure 12
Figure 12. Figure 12: Qualitative visualizations of feature line extraction for Edge Flow Ratio (EFR) calculation. Edge Chain Matching. For each ground-truth feature line p = (𝑝1, . . . , 𝑝𝐾 ), we search for the best-matching edge chain on the output mesh Mout. We first resample p into dense points {𝑝ˆ𝑖 } 𝑀 𝑖=1 and estimate local unit tangents {𝑡ˆ 𝑖 } 𝑀 𝑖=1 . Output vertices close to the feature line are collected as Vnear = n… view at source ↗
Figure 16
Figure 16. Figure 16: Our method natively learns sematically anisotropy layout [PITH_FULL_IMAGE:figures/full_fig_p016_16.png] view at source ↗
Figure 13
Figure 13. Figure 13: Qualitative visualizations of traditional quad-remeshing methods. The results show that these methods often generate unnecessarily dense face [PITH_FULL_IMAGE:figures/full_fig_p017_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Comparisons for convergence rate of each tokenization method w [PITH_FULL_IMAGE:figures/full_fig_p018_14.png] view at source ↗
Figure 16
Figure 16. Figure 16: More qualitative comparison with triangle-based generation methods postprocessed by our Tri-to-Quad Operator. Other baselines (shown in blue) are [PITH_FULL_IMAGE:figures/full_fig_p019_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Qualitative comparison with Software-based quad remeshing methods. We compare our global [PITH_FULL_IMAGE:figures/full_fig_p020_17.png] view at source ↗
read the original abstract

The generation of production-ready quad-dominant meshes is a cornerstone of modern 3D content creation. Generating anisotropic quad-dominant meshes from point clouds is challenging, as existing methods are typically limited to producing either pure triangular meshes or pure quadrilateral meshes with isotropic densities. In this paper, we present QuadLink, a unified framework consisting of three stages for quad-dominant mesh generation by linking points into structured faces. QuadLink formulates polygonal mesh generation as a hybrid centroid-conditioned vertex linking model: it first predicts a unified set of anchors (vertices and face centroids), then learns centroid-conditioned links that associate vertices with face centroids, and finally assembles polygonal faces with a quad-first strategy guided by robust geometric verification strategies. This link-based formulation enables efficient generation of sparse and anisotropic quad-dominant meshes with coherent edge flow and meanwhile supporting hybrid polygonal topology. To construct training data for this model, we further introduce a Tri-to-Quad Operator that converts artistic triangle meshes into quad-dominant training data via global merge selection. Extensive experiments show that QuadLink produces production-ready quad-dominant meshes from point clouds and achieves improved geometric fidelity and topological quality compared to prior baselines. Our method natively supports hybrid polygonal topology, generalizing to arbitrary n-gon meshes without architectural changes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript presents QuadLink, a three-stage framework for autoregressive quad-dominant mesh generation from point clouds. It predicts a unified set of anchors consisting of vertices and face centroids, learns centroid-conditioned links to associate vertices with those centroids, and assembles polygonal faces via a quad-first strategy with geometric verification. Training data is prepared by a Tri-to-Quad Operator that converts artistic triangle meshes into quad-dominant examples through global merge selection. The central claim is that this link-based formulation produces production-ready sparse and anisotropic quad-dominant meshes with coherent edge flow, supports hybrid polygonal (n-gon) topology without architectural changes, and achieves improved geometric fidelity and topological quality over prior baselines.

Significance. If the performance claims and generalization hold, the work would be a meaningful advance in computer graphics for 3D content creation, where anisotropic quad-dominant meshes are preferred for production pipelines. The hybrid topology support and point-relation learning approach offer a unified alternative to methods limited to pure triangles or isotropic quads. The Tri-to-Quad Operator provides a practical data-generation step, though its fidelity to real point-cloud distributions is central to the results.

major comments (2)
  1. [§3.2 (Tri-to-Quad Operator)] §3.2 (Tri-to-Quad Operator): The global merge selection heuristic is presented without quantitative validation that the resulting quad-dominant meshes preserve original edge-flow, anisotropy, and local curvature statistics. This is load-bearing for the generalization claim, because any systematic bias in the training distribution relative to raw point-cloud inputs could cause the learned linking model to produce incoherent faces on real data, undermining both the fidelity and hybrid-topology assertions.
  2. [Experiments section] Experiments section / Table 1 (or equivalent results table): The abstract asserts 'improved geometric fidelity and topological quality' with 'extensive experiments,' yet the manuscript must supply concrete metrics (e.g., Hausdorff distance, quad quality scores, edge-flow coherence), dataset details, error bars, and ablations against baselines. Without these, the central performance claim lacks visible empirical grounding.
minor comments (2)
  1. [§3.3 (Assembly)] Clarify the exact geometric verification criteria used in the final assembly stage and how they interact with the quad-first ordering; a short pseudocode or decision tree would improve reproducibility.
  2. [Figures] Ensure all figures showing generated meshes include side-by-side comparisons with ground-truth or baseline outputs at consistent viewpoints and include scale bars or point-cloud density information.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful and constructive comments. We address each major comment below and outline the revisions we will make to strengthen the manuscript.

read point-by-point responses

  1. Referee: [§3.2 (Tri-to-Quad Operator)] §3.2 (Tri-to-Quad Operator): The global merge selection heuristic is presented without quantitative validation that the resulting quad-dominant meshes preserve original edge-flow, anisotropy, and local curvature statistics. This is load-bearing for the generalization claim, because any systematic bias in the training distribution relative to raw point-cloud inputs could cause the learned linking model to produce incoherent faces on real data, undermining both the fidelity and hybrid-topology assertions.

    Authors: We agree that additional quantitative validation of the Tri-to-Quad Operator would strengthen the generalization argument. In the revised manuscript we will add a dedicated analysis (new table or appendix) reporting edge-flow preservation (e.g., average deviation in edge directions and lengths), anisotropy statistics (aspect-ratio and density distributions), and local curvature fidelity (mean and Gaussian curvature errors) between the source triangle meshes and the converted quad-dominant meshes. These metrics will be computed on the same artistic meshes used for training. revision: yes

  2. Referee: [Experiments section] Experiments section / Table 1 (or equivalent results table): The abstract asserts 'improved geometric fidelity and topological quality' with 'extensive experiments,' yet the manuscript must supply concrete metrics (e.g., Hausdorff distance, quad quality scores, edge-flow coherence), dataset details, error bars, and ablations against baselines. Without these, the central performance claim lacks visible empirical grounding.

    Authors: We acknowledge that the current results presentation would benefit from greater explicitness. The manuscript already contains comparative results and visualizations, but we will expand the Experiments section and Table 1 to report concrete quantitative metrics including Hausdorff distance, quad quality scores (aspect ratio, skewness, minimum angle), edge-flow coherence (e.g., average deviation from principal curvature directions), full dataset specifications, error bars or standard deviations across runs, and additional ablation studies against the listed baselines. These additions will make the performance claims directly verifiable. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The paper presents a data-driven ML pipeline: a centroid-conditioned linking model trained on meshes produced by the introduced Tri-to-Quad Operator, followed by geometric assembly. No equations, uniqueness theorems, or self-citations are shown that reduce any claimed prediction or result to a quantity defined by the inputs or by the model's own fitted outputs. The central claims rest on empirical comparison to baselines rather than any self-referential derivation, satisfying the criteria for an independent, non-circular formulation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Review is limited to the abstract; no explicit free parameters, axioms, or invented physical entities are stated. The framework itself and the Tri-to-Quad Operator are new procedural components introduced to support the central claim.

invented entities (1)
  • Tri-to-Quad Operator no independent evidence
    purpose: Convert artistic triangle meshes into quad-dominant training data
    New data preparation step introduced to enable training of the linking model.

pith-pipeline@v0.9.0 · 5800 in / 1156 out tokens · 35749 ms · 2026-05-19T19:44:01.456795+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

228 extracted references · 228 canonical work pages · 5 internal anchors

  1. [1]

    The Computational Geometry Algorithms Library , author =

    work page

  2. [2]

    Menelaos Karavelas , subtitle =

    work page

  3. [3]

    The Computational Geometry Algorithms Library , subtitle =

    Menelaos Karavelas , editor =. The Computational Geometry Algorithms Library , subtitle =

    work page

  4. [4]

    The Parmap library , author =

    work page

  5. [5]

    Christopher Anderson and Sophia Drossopoulou , title =

    work page

  6. [6]

    Abril and Robert Plant

    Patricia S. Abril and Robert Plant. The patent holder's dilemma: Buy, sell, or troll?. Communications of the ACM. doi:10.1145/1188913.1188915

    work page doi:10.1145/1188913.1188915

  7. [7]

    Deciding equivalances among conjunctive aggregate queries

    Sarah Cohen and Werner Nutt and Yehoshua Sagic. Deciding equivalances among conjunctive aggregate queries. doi:10.1145/1219092.1219093

    work page doi:10.1145/1219092.1219093

  8. [8]

    Special issue: Digital Libraries. 1996

    work page 1996

  9. [9]

    Understanding Policy-Based Networking

    David Kosiur. Understanding Policy-Based Networking

    work page

  10. [12]

    doi:10.1007/3-540-09237-4

    The title of book two. doi:10.1007/3-540-09237-4

    work page doi:10.1007/3-540-09237-4

  11. [13]

    Asad Z. Spector. Achieving application requirements. Distributed Systems. doi:10.1145/90417.90738

    work page doi:10.1145/90417.90738

  12. [14]

    Douglass and David Harel and Mark B

    Bruce P. Douglass and David Harel and Mark B. Trakhtenbrot. Statecarts in use: structured analysis and object-orientation. Lectures on Embedded Systems. doi:10.1007/3-540-65193-4_29

    work page doi:10.1007/3-540-65193-4_29

  13. [15]

    Donald E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms (3rd. ed.)

    work page

  14. [16]

    Donald E. Knuth. The Art of Computer Programming

    work page

  15. [17]

    Structured Variational Inference Procedures and their Realizations (as incol)

    Dan Geiger and Christopher Meek. Structured Variational Inference Procedures and their Realizations (as incol). Proceedings of Tenth International Workshop on Artificial Intelligence and Statistics, The Barbados

    work page

  16. [18]

    Stan W. Smith. An experiment in bibliographic mark-up: Parsing metadata for XML export. Proceedings of the 3rd. annual workshop on Librarians and Computers

    work page

  17. [19]

    Catch me, if you can: Evading network signatures with web-based polymorphic worms

    Matthew Van Gundy and Davide Balzarotti and Giovanni Vigna. Catch me, if you can: Evading network signatures with web-based polymorphic worms. Proceedings of the first USENIX workshop on Offensive Technologies

    work page

  18. [20]

    Predicate Path expressions

    Sten Andler. Predicate Path expressions. Proceedings of the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages. doi:10.1145/567752.567774

    work page doi:10.1145/567752.567774

  19. [21]

    LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

    David Harel. LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

    work page

  20. [22]

    Anisi , title =

    David A. Anisi , title =

    work page

  21. [23]

    Clarkson

    Kenneth L. Clarkson. Algorithms for Closest-Point Problems (Computational Geometry)

    work page

  22. [24]

    Introduction to Bayesian Statistics

    Harry Thornburg. Introduction to Bayesian Statistics. 2001

    work page 2001

  23. [25]

    CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11

    Rafal Ablamowicz and Bertfried Fauser. CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11. 2007

    work page 2007

  24. [26]

    Stats and Analysis

    Poker-Edge.Com. Stats and Analysis. 2006

    work page 2006

  25. [27]

    A more perfect union

    Barack Obama. A more perfect union

    work page

  26. [28]

    The fountain of youth

    Joseph Scientist. The fountain of youth

    work page

  27. [29]

    Solder man

    Dave Novak. Solder man. ACM SIGGRAPH 2003 Video Review on Animation theater Program: Part I - Vol. 145 (July 27--27, 2003). doi:10.945/woot07-S422

    work page 2003

  28. [30]

    Interview with Bill Kinder: January 13, 2005

    Newton Lee. Interview with Bill Kinder: January 13, 2005. Comput. Entertain. doi:10.1145/1057270.1057278

    work page doi:10.1145/1057270.1057278 2005

  29. [31]

    The Enabling of Digital Libraries

    Bernard Rous. The Enabling of Digital Libraries. Digital Libraries

    work page

  30. [33]

    (new) Finding minimum congestion spanning trees , journal =

    Werneck, Renato and Setubal, Jo\. (new) Finding minimum congestion spanning trees , journal =. doi:10.1145/351827.384253 , acmid = 384253, publisher =

    work page doi:10.1145/351827.384253

  31. [35]

    and Mei, Alessandro , title =

    Conti, Mauro and Di Pietro, Roberto and Mancini, Luigi V. and Mei, Alessandro , title =. Inf. Fusion , volume =. 2009 , issn =. doi:10.1016/j.inffus.2009.01.002 , acmid =

    work page doi:10.1016/j.inffus.2009.01.002 2009

  32. [36]

    and Hutchful, David K

    Li, Cheng-Lun and Buyuktur, Ayse G. and Hutchful, David K. and Sant, Natasha B. and Nainwal, Satyendra K. , title =. CHI '08 extended abstracts on Human factors in computing systems , year =. doi:10.1145/1358628.1358946 , acmid =

    work page doi:10.1145/1358628.1358946

  33. [37]

    , title =

    Hollis, Billy S. , title =. 1999 , isbn =

    work page 1999

  34. [38]

    Goossens, Michel and Rahtz, S. P. and Moore, Ross and Sutor, Robert S. , title =. 1999 , isbn =

    work page 1999

  35. [39]

    and Rosenberg, Arnold L

    Buss, Jonathan F. and Rosenberg, Arnold L. and Knott, Judson D. , title =. 1987 , source =

    work page 1987

  36. [40]

    CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =

    , note =. CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =

    work page

  37. [41]

    Advances in neural information processing systems , volume=

    Michelangelo: Conditional 3d shape generation based on shape-image-text aligned latent representation , author=. Advances in neural information processing systems , volume=

    work page

  38. [42]

    Algorithms for Closest-Point Problems (Computational Geometry) , year =

    Clarkson, Kenneth Lee , advisor =. Algorithms for Closest-Point Problems (Computational Geometry) , year =

    work page

  39. [43]

    SIGCOMM Comput. Commun. Rev. , year =

    work page

  40. [44]

    2004 , isbn =

    IEEE TCSC Executive Committee , booktitle =. 2004 , isbn =. doi:http://dx.doi.org/10.1109/ICWS.2004.64 , acmid =

    work page doi:10.1109/icws.2004.64 2004

  41. [45]

    Distributed systems (2nd Ed.) , year =

    work page

  42. [46]

    , title =

    Petrie, Charles J. , title =. 1986 , source =

    work page 1986

  43. [47]

    Donald E. Knuth. Seminumerical Algorithms. 1981

    work page 1981

  44. [48]

    E-commerce and cultural values , year =

    Kong, Wei-Chang , Title =. E-commerce and cultural values , year =

    work page

  45. [49]

    E-commerce and cultural values , year =

    Kong, Wei-Chang , type =. E-commerce and cultural values , year =

    work page

  46. [50]

    Chapter 9 , booktitle =

    Kong, Wei-Chang , editor =. Chapter 9 , booktitle =

    work page

  47. [51]

    E-commerce and cultural values , editor =

    Kong, Wei-Chang , title =. E-commerce and cultural values , editor =. 2003 , isbn =

    work page 2003

  48. [52]

    E-commerce and cultural values - (InBook-num-in-chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values - (InBook-num-in-chap) , chapter =. 2004 , address =

    work page 2004

  49. [53]

    E-commerce and cultural values (Inbook-text-in-chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-text-in-chap) , chapter =. 2005 , address =

    work page 2005

  50. [54]

    E-commerce and cultural values (Inbook-num chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-num chap) , chapter =. 2006 , address =

    work page 2006

  51. [55]

    Microelectron

    Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi , title =. Microelectron. J. , volume =. 2010 , pages =

    work page 2010

  52. [56]

    Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi and Zahra Sasanian , title =. J. Emerg. Technol. Comput. Syst. , volume =

    work page

  53. [57]

    Kirschmer, Markus and Voight, John , title =. SIAM J. Comput. , issue_date =. 2010 , issn =. doi:https://doi.org/10.1137/080734467 , acmid =

    work page doi:10.1137/080734467 2010

  54. [58]

    Hoare, C. A. R. , title =. Structured programming (incoll) , editor =. 1972 , isbn =

    work page 1972

  55. [59]

    History of programming languages I (incoll) , editor =

    Lee, Jan , title =. History of programming languages I (incoll) , editor =. 1981 , isbn =. doi:http://doi.acm.org/10.1145/800025.1198348 , acmid =

    work page doi:10.1145/800025.1198348 1981

  56. [60]

    , title =

    Dijkstra, E. , title =. Classics in software engineering (incoll) , year =

    work page

  57. [61]

    , title =

    Wenzel, Elizabeth M. , title =. Multimedia interface design (incoll) , year =. doi:10.1145/146022.146089 , acmid =

    work page doi:10.1145/146022.146089

  58. [62]

    , title =

    Mumford, E. , title =. Critical issues in information systems research (incoll) , year =

    work page

  59. [63]

    and Golden, Donald G

    McCracken, Daniel D. and Golden, Donald G. , title =. 1990 , isbn =

    work page 1990

  60. [64]

    The analysis of linear partial differential operators

    H. The analysis of linear partial differential operators. 1985 , PAGES =

    work page 1985

  61. [65]

    IEEE", address =

    A. Adya and P. Bahl and J. Padhye and A.Wolman and L. Zhou , title =. Proceedings of the IEEE 1st International Conference on Broadnets Networks (BroadNets'04) , publisher = "IEEE", address = "Los Alamitos, CA", year =

    work page

  62. [66]

    I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci , title =. Comm. ACM , volume = 38, number = "4", year =

    work page

  63. [67]

    I. F. Akyildiz and T. Melodia and K. R. Chowdhury , title =. Computer Netw. , volume = 51, number = "4", year =

    work page

  64. [68]

    ACM", address =

    P. Bahl and R. Chancre and J. Dungeon , title =. Proceeding of the 10th International Conference on Mobile Computing and Networking (MobiCom'04) , publisher = "ACM", address = "New York, NY", year =

    work page

  65. [69]

    8 (Special Issue on Sensor Networks)

    D. Culler and D. Estrin and M. Srivastava , title =. IEEE Comput. , volume = 37, number = "8 (Special Issue on Sensor Networks)", publisher = "IEEE", address = "Los Alamitos, CA", year =

    work page

  66. [70]

    Natarajan and M

    A. Natarajan and M. Motani and B. de Silva and K. Yap and K. C. Chua , title =. Network Architectures , editor =. 960935712

    work page

  67. [71]

    Tzamaloukas and J

    A. Tzamaloukas and J. J. Garcia-Luna-Aceves , title =

    work page

  68. [72]

    Zhou and J

    G. Zhou and J. Lu and C.-Y. Wan and M. D. Yarvis and J. A. Stankovic , title =

    work page

  69. [73]

    Mapping Powerlists onto Hypercubes

    Jacob Kornerup. Mapping Powerlists onto Hypercubes. 1994

    work page 1994

  70. [74]

    Automatic Parallelization for Distributed-Memory Multiprocessing Systems

    Michael Gerndt. Automatic Parallelization for Distributed-Memory Multiprocessing Systems

    work page

  71. [75]

    J. E. Archer, Jr. and R. Conway and F. B. Schneider. User recovery and reversal in interactive systems. ACM Trans. Program. Lang. Syst

    work page

  72. [76]

    D. D. Dunlop and V. R. Basili. Generalizing specifications for uniformly implemented loops. ACM Trans. Program. Lang. Syst

    work page

  73. [77]

    Heering and P

    J. Heering and P. Klint. Towards monolingual programming environments. ACM Trans. Program. Lang. Syst

    work page

  74. [78]

    Donald E. Knuth. The book

    work page

  75. [79]

    Korach and D

    E. Korach and D. Rotem and N. Santoro. Distributed algorithms for finding centers and medians in networks. ACM Trans. Program. Lang. Syst

    work page

  76. [80]

    : A Document Preparation System

    Leslie Lamport. : A Document Preparation System

    work page

  77. [81]

    F. Nielson. Program transformations in a denotational setting. ACM Trans. Program. Lang. Syst

    work page

  78. [82]

    Brian K. Reid. A high-level approach to computer document formatting. Proceedings of the 7th Annual Symposium on Principles of Programming Languages

    work page

  79. [83]

    and Abdelzaher, Tarek F

    Zhou, Gang and Wu, Yafeng and Yan, Ting and He, Tian and Huang, Chengdu and Stankovic, John A. and Abdelzaher, Tarek F. , title =. ACM Trans. Embed. Comput. Syst. , issue_date =. doi:10.1145/1721695.1721705 , acmid = 1721705, publisher =

    work page doi:10.1145/1721695.1721705

  80. [84]

    Institutional members of the Users Group

    work page

Showing first 80 references.