pith. sign in

arxiv: 2605.19411 · v1 · pith:ASUDQFF4new · submitted 2026-05-19 · 💻 cs.GR

BrepForge: Factorized B-rep Synthesis via Wireframe Composition and Boundary-Conditioned Surface Instantiation

Jing Li , Yihang Fu , Falai Chen This is my paper

Pith reviewed 2026-05-20 02:17 UTC · model grok-4.3

classification 💻 cs.GR
keywords B-rep synthesisboundary representationwireframe compositionsurface instantiationCAD modelinggenerative modelsautoregressive modelingtopological validity
0
0 comments X p. Extension
pith:ASUDQFF4 Add to your LaTeX paper What is a Pith Number? 
\usepackage{pith}
\pithnumber{ASUDQFF4}

Prints a linked pith:ASUDQFF4 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

BrepForge factorizes B-rep synthesis into wireframe composition followed by boundary-conditioned surface instantiation to ensure topological integrity and geometric precision.

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

The paper seeks to establish that B-rep synthesis can be made tractable by exploiting an asymmetry where wireframe topology requires high-entropy structural decisions while interior surface geometry is largely fixed by its boundary loops. It introduces a two-stage generative framework: first a face-aware autoregressive model builds a topologically complete wireframe scaffold by serializing hierarchical Vertex-Edge-Face connectivity into structured sequences, then learning-free geometric priors instantiate precise surfaces from those boundaries. A sympathetic reader would care because the tight coupling of discrete topology and continuous geometry has made direct learning-based B-rep generation difficult and limited in complexity. If the factorization holds, it turns an end-to-end synthesis problem into a structured refinement process that produces valid and intricate CAD models.

Core claim

BrepForge decomposes B-rep generation into wireframe composition via a face-aware autoregressive model that produces sequences explicitly encoding hierarchical Vertex-Edge-Face connectivity to create a topologically complete scaffold, followed by boundary-conditioned surface instantiation that applies learning-free geometric priors derived from the boundary loops to fill in precise geometries. This factorization directly addresses the inherent complexities of B-rep modeling by separating high-entropy topological decisions from constrained geometric refinement.

What carries the argument

The two-stage factorization of B-rep synthesis consisting of face-aware autoregressive wireframe composition that encodes V-E-F connectivity and boundary-conditioned surface instantiation using learning-free geometric priors.

If this is right

  • B-reps generated by the method exhibit superior geometric complexity compared with prior coupled synthesis approaches.
  • Explicit encoding of hierarchical connectivity in the wireframe stage produces higher topological validity.
  • The overall synthesis task is reduced to a structured refinement process rather than joint topology-geometry generation.
  • The approach outperforms existing baselines on metrics of both validity and complexity.

Where Pith is reading between the lines

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

  • The same separation of high-entropy structure from boundary-constrained geometry could be tested in other hybrid 3D representations such as meshes or parametric surfaces.
  • Automated manufacturing pipelines might incorporate the wireframe-first stage to guarantee topologically valid outputs before geometry refinement.
  • Datasets with deliberately varied boundary constraints could measure how far the learning-free priors extend before additional learning becomes necessary.

Load-bearing premise

Interior surface geometry in B-reps is largely constrained by boundary loops so that learning-free geometric priors can accurately instantiate surfaces once the wireframe is composed.

What would settle it

A collection of B-rep examples in which multiple distinct interior surface shapes are consistent with identical boundary loops, such that the boundary-conditioned instantiation stage produces geometrically imprecise or topologically invalid results.

Figures

Figures reproduced from arXiv: 2605.19411 by Falai Chen, Jing Li, Yihang Fu.

Figure 1
Figure 1. Figure 1: Pipeline of BrepForge. Our framework first autoregressively synthesizes a face-aware wireframe that explicitly encodes hierarchical Vertex–Edge–Face [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Qualitative comparison of point-cloud conditioned wireframe re [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Qualitative comparison of unconditional B-rep generation. Compared to existing baselines, BrepForge synthesizes models with significantly higher [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Geometric fidelity of analytical priors. We report the error distribu [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Qualitative evaluation of analytical priors. Our method produces initial surface grids (blue) that align closely with the boundary wireframes (black) and [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Gallery of unconditionally synthesized B-reps. We showcase a diverse range of synthesized CAD models, presenting both the generated wireframe [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Gallery of point-cloud conditioned B-rep generation. For each example, we present the input point cloud, the synthesized wireframe scaffold, and the [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Representative failure cases generated by our method. These exam [PITH_FULL_IMAGE:figures/full_fig_p013_8.png] view at source ↗
read the original abstract

Boundary representation (B-rep) is the de facto standard for modern CAD, yet learning-based B-rep synthesis remains challenging due to the tight coupling between discrete topology and continuous geometry. We observe a fundamental asymmetry in B-reps: while wireframe composition involves high-entropy structural decisions, the interior surface geometry is largely constrained by its boundary loops. Motivated by this observation, we propose BrepForge, a generative framework that factorizes B-rep synthesis into two stages: wireframe composition and boundary-conditioned surface instantiation. In the first stage, a face-aware autoregressive model serializes the wireframe into structured sequences that explicitly encode hierarchical Vertex-Edge-Face (V-E-F) connectivity, yielding a topologically complete scaffold. In the second stage, precise surface geometries are instantiated by incorporating learning-free geometric priors derived from boundaries, transforming the complex synthesis task into a structured refinement process. This factorized approach ensures both topological integrity and geometric precision, effectively addressing the inherent complexities of B-rep modeling. Extensive experiments demonstrate that BrepForge outperforms existing baselines with superior geometric complexity and topological validity.

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 / 0 minor

Summary. The paper claims to introduce BrepForge, a factorized generative framework for B-rep synthesis. The first stage employs a face-aware autoregressive model that serializes wireframes into sequences explicitly encoding hierarchical Vertex-Edge-Face (V-E-F) connectivity to produce a topologically complete scaffold. The second stage instantiates precise surface geometries via learning-free geometric priors derived from boundary loops. The central claim is that this factorization addresses the topology-geometry coupling in B-rep modeling, ensuring both topological integrity and geometric precision while outperforming baselines on geometric complexity and topological validity.

Significance. If the factorization holds and the learning-free priors reliably recover intended interior geometry from boundaries, the work would advance learning-based CAD by exploiting an asymmetry between high-entropy structural decisions and more constrained geometric refinement, potentially enabling higher-complexity and valid B-rep outputs without joint end-to-end learning of both aspects.

major comments (2)
  1. [Abstract] Abstract: the claim that 'the interior surface geometry is largely constrained by its boundary loops' and that 'learning-free geometric priors derived from boundaries' suffice for precise instantiation is load-bearing for the entire factorization. In general B-rep, a closed edge loop does not uniquely determine a surface (multiple NURBS or parametric interpolants exist differing in interior control points or curvature); the manuscript must specify the exact priors (e.g., Coons, minimal-surface, or planar assumptions) and demonstrate they recover target freeform geometry without deviation or self-intersection.
  2. [Abstract] Abstract and experimental claims: the statement that BrepForge 'outperforms existing baselines with superior geometric complexity and topological validity' provides no details on the baselines, the concrete metrics used for geometric complexity or topological validity, or quantitative error analysis/failure modes. This absence prevents assessment of whether the reported gains are attributable to the factorization or to other factors.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which help clarify key aspects of our factorization approach. We address each major comment below with clarifications drawn from the manuscript and indicate planned revisions to improve precision and transparency.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that 'the interior surface geometry is largely constrained by its boundary loops' and that 'learning-free geometric priors derived from boundaries' suffice for precise instantiation is load-bearing for the entire factorization. In general B-rep, a closed edge loop does not uniquely determine a surface (multiple NURBS or parametric interpolants exist differing in interior control points or curvature); the manuscript must specify the exact priors (e.g., Coons, minimal-surface, or planar assumptions) and demonstrate they recover target freeform geometry without deviation or self-intersection.

    Authors: We agree that explicit specification of the priors is necessary to substantiate the claim. The manuscript (Section 3.2) defines the boundary-conditioned instantiation using Coons patches for quadrilateral loops and minimal-surface approximations (via discrete Laplace-Beltrami minimization) for general closed loops; these are deterministic, learning-free operations that interpolate the boundary while enforcing C1 continuity and bounded curvature. We will revise the abstract to name these priors directly and add a dedicated paragraph in the methods with quantitative validation (Hausdorff distance to ground-truth interiors and self-intersection checks) on the evaluation set to demonstrate recovery fidelity. revision: yes

  2. Referee: [Abstract] Abstract and experimental claims: the statement that BrepForge 'outperforms existing baselines with superior geometric complexity and topological validity' provides no details on the baselines, the concrete metrics used for geometric complexity or topological validity, or quantitative error analysis/failure modes. This absence prevents assessment of whether the reported gains are attributable to the factorization or to other factors.

    Authors: The abstract is intentionally concise, but the full experimental section (4.1–4.3) specifies the baselines (DeepCAD, SolidGen, and a joint end-to-end autoregressive model), defines geometric complexity via average face/edge counts and surface curvature variance, and measures topological validity through connectivity validity ratio plus Euler characteristic checks. Quantitative tables report success rates, error distributions, and failure-mode breakdowns. We will expand the abstract with one sentence referencing these metrics and add a short summary table of key numbers to make the claims self-contained. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on external priors and independent stages

full rationale

The paper's core derivation observes an asymmetry (wireframe high-entropy, surfaces boundary-constrained) and factorizes into an autoregressive V-E-F model for topology followed by learning-free geometric priors for surface instantiation. No step reduces by construction to its inputs: the priors are external (not fitted to define the result), there are no self-citations invoked as uniqueness theorems, and no ansatz or renaming of known results as new derivations. The claim of ensured integrity and precision follows from the architectural split and is tested against external benchmarks rather than being tautological. This is the common case of a self-contained proposal.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests primarily on the domain assumption of asymmetry between wireframe entropy and surface constraint, plus the existence of effective learning-free geometric priors derived from boundaries.

axioms (1)
  • domain assumption Wireframe composition involves high-entropy structural decisions while the interior surface geometry is largely constrained by its boundary loops.
    This observation directly motivates the factorization and is stated in the abstract as the key insight.

pith-pipeline@v0.9.0 · 5732 in / 1002 out tokens · 29529 ms · 2026-05-20T02:17:10.160240+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

143 extracted references · 143 canonical work pages · 1 internal anchor

  1. [1]

    Abril and Robert Plant

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

    work page doi:10.1145/1188913.1188915 2007

  2. [2]

    Deciding equivalances among conjunctive aggregate queries

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

    work page doi:10.1145/1219092.1219093 2007

  3. [3]

    Special issue: Digital Libraries. 1996

    work page 1996

  4. [4]

    Understanding Policy-Based Networking

    David Kosiur. Understanding Policy-Based Networking. 2001

    work page 2001

  5. [7]

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

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

  6. [8]

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

    work page doi:10.1145/90417.90738 1990

  7. [9]

    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. 1998. doi:10.1007/3-540-65193-4_29

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

  8. [10]

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

    work page 1997

  9. [11]

    Donald E. Knuth. The Art of Computer Programming. 1998

    work page 1998

  10. [12]

    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

  11. [13]

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

    work page 2010

  12. [14]

    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. 2007

    work page 2007

  13. [15]

    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. 2008

    work page 2008

  14. [16]

    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. 2009

    work page 2009

  15. [17]

    Predicate Path expressions

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

    work page doi:10.1145/567752.567774 1979

  16. [18]

    LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

    David Harel. LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER. 1978

    work page 1978

  17. [19]

    Anisi , title =

    David A. Anisi , title =

    work page

  18. [20]

    Clarkson

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

    work page 1985

  19. [21]

    Introduction to Bayesian Statistics

    Harry Thornburg. Introduction to Bayesian Statistics. 2001

    work page 2001

  20. [22]

    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

  21. [23]

    Stats and Analysis

    Poker-Edge.Com. Stats and Analysis. 2006

    work page 2006

  22. [24]

    A more perfect union

    Barack Obama. A more perfect union. 2008

    work page 2008

  23. [25]

    The fountain of youth

    Joseph Scientist. The fountain of youth. 2009

    work page 2009

  24. [26]

    Solder man

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

    work page 2003

  25. [27]

    Interview with Bill Kinder: January 13, 2005

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

    work page doi:10.1145/1057270.1057278 2005

  26. [28]

    The Enabling of Digital Libraries

    Bernard Rous. The Enabling of Digital Libraries. Digital Libraries. 2008

    work page 2008

  27. [30]

    (new) Finding minimum congestion spanning trees , journal =

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

    work page doi:10.1145/351827.384253 2000

  28. [32]

    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

  29. [33]

    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

  30. [34]

    , title =

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

    work page 1999

  31. [35]

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

    work page 1999

  32. [36]

    and Rosenberg, Arnold L

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

    work page 1987

  33. [37]

    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

  34. [38]

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

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

    work page

  35. [39]

    SIGCOMM Comput. Commun. Rev. , year =

    work page

  36. [40]

    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

  37. [41]

    Distributed systems (2nd Ed.) , year =

    work page

  38. [42]

    , title =

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

    work page 1986

  39. [43]

    Donald E. Knuth. Seminumerical Algorithms. 1981

    work page 1981

  40. [44]

    E-commerce and cultural values , year =

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

    work page

  41. [45]

    E-commerce and cultural values , year =

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

    work page

  42. [46]

    Chapter 9 , booktitle =

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

    work page 2002

  43. [47]

    E-commerce and cultural values , editor =

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

    work page 2003

  44. [48]

    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

  45. [49]

    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

  46. [50]

    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

  47. [51]

    Microelectron

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

    work page 2010

  48. [52]

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

    work page

  49. [53]

    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

  50. [54]

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

    work page 1972

  51. [55]

    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

  52. [56]

    , title =

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

    work page

  53. [57]

    , title =

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

    work page doi:10.1145/146022.146089

  54. [58]

    , title =

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

    work page

  55. [59]

    and Golden, Donald G

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

    work page 1990

  56. [60]

    The analysis of linear partial differential operators

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

    work page 1985

  57. [61]

    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

  58. [62]

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

    work page

  59. [63]

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

    work page

  60. [64]

    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

  61. [65]

    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

  62. [66]

    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

  63. [67]

    Tzamaloukas and J

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

    work page

  64. [68]

    Zhou and J

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

    work page

  65. [69]

    Mapping Powerlists onto Hypercubes

    Jacob Kornerup. Mapping Powerlists onto Hypercubes. 1994

    work page 1994

  66. [70]

    Automatic Parallelization for Distributed-Memory Multiprocessing Systems

    Michael Gerndt. Automatic Parallelization for Distributed-Memory Multiprocessing Systems

    work page

  67. [71]

    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

  68. [72]

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

    work page

  69. [73]

    Heering and P

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

    work page

  70. [74]

    Donald E. Knuth. The book

    work page

  71. [75]

    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

  72. [76]

    : A Document Preparation System

    Leslie Lamport. : A Document Preparation System

    work page

  73. [77]

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

    work page

  74. [78]

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

    work page

  75. [79]

    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

  76. [80]

    Institutional members of the Users Group

    work page

  77. [81]

    Boris Veytsman , title =

    work page

  78. [82]

    and Peterson, Larry L

    Bowman, Mic and Debray, Saumya K. and Peterson, Larry L. , title =. ACM Trans. Program. Lang. Syst. , volume =. 1993 , doi =

    work page 1993

  79. [83]

    TUGboat , volume =

    Braams, Johannes , title =. TUGboat , volume =

    work page

  80. [84]

    Post Congress Tristesse

    Malcolm Clark. Post Congress Tristesse. TeX90 Conference Proceedings

    work page

Showing first 80 references.