The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter C. Fishburn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
    Sequence Based Methods for Data Transmission and Source Compression. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:1-12 [Conf]
  2. Peter C. Fishburn, J. C. Lagarias
    Pinwheel Scheduling: Achievable Densities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:14-38 [Journal]
  3. Paul Erdös, Peter C. Fishburn
    Minimum Planar Sets with Maximum Equidistance Counts. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:207-218 [Journal]
  4. Peter C. Fishburn
    Convex Polygons with Few Intervertex Distances. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:65-93 [Journal]
  5. Peter C. Fishburn, James A. Reeds
    Unit Distances Between Vertices of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:81-91 [Journal]
  6. Kenneth P. Bogart, Peter C. Fishburn, Garth Isaak, Larry J. Langley
    Proper and Unit Tolerance Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:99-117 [Journal]
  7. Paul Erdös, Peter C. Fishburn
    Multiplicities of Interpoint Distances in Finite Planar Sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:141-147 [Journal]
  8. Paul Erdös, Peter C. Fishburn
    Intervertex Distances in Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:149-158 [Journal]
  9. Samuel Fiorini, Peter C. Fishburn
    Facets of linear signed order polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:3, pp:597-610 [Journal]
  10. Peter C. Fishburn
    Correlation in Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:2, pp:173-191 [Journal]
  11. Peter C. Fishburn
    Decision Theory and Discrete Mathematics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:3, pp:209-221 [Journal]
  12. Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao
    On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:75-87 [Journal]
  13. Peter C. Fishburn, Fred S. Roberts
    No-hole L(2, 1)-colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:513-519 [Journal]
  14. Peter C. Fishburn, Fred S. Roberts
    Elemantary Sequences, Sub-Fibonacci Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:261-281 [Journal]
  15. Peter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei
    The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:1, pp:39-61 [Journal]
  16. Peter C. Fishburn, Paul E. Wright
    Interference patterns in bijective colorings of 2-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:189-204 [Journal]
  17. A. Robert Calderbank, Peter C. Fishburn
    Maximal Three-Independent Subsets of {0, 1, 2}. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:3, pp:203-211 [Journal]
  18. Paul Erdös, Peter C. Fishburn
    A Postscript on Distances in Convex n-Gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:111-117 [Journal]
  19. Peter C. Fishburn
    Isosceles Planar Subsets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:390-398 [Journal]
  20. Samuel Fiorini, Peter C. Fishburn
    Weak order polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:111-127 [Journal]
  21. Peter C. Fishburn
    A remarkable eight-point planar configuration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:103-122 [Journal]
  22. Peter C. Fishburn, William T. Trotter
    Containment orders for similar ellipses with a common center. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:129-136 [Journal]
  23. Peter C. Fishburn, Prasad Tetali, Peter Winkler
    Optimal linear arrangement of a rectangular grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:123-139 [Journal]
  24. Peter C. Fishburn, Bernard Monjardet
    Concordance Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:4, pp:461-471 [Journal]
  25. Peter C. Fishburn, Andrew M. Odlyzko, Ryan C. Siders
    Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars. [Citation Graph (0, 0)][DBLP]
    First Monday, 1997, v:2, n:7, pp:- [Journal]
  26. Peter C. Fishburn
    Balanced Integer Arrays: A Matrix Packing Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:1, pp:98-101 [Journal]
  27. Peter C. Fishburn
    On the sphericity and cubicity of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:309-318 [Journal]
  28. Peter C. Fishburn
    Proportional transitivity in linear extensions of ordered sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:48-60 [Journal]
  29. Peter C. Fishburn
    A note on linear extensions and incomparable pairs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:56, n:2, pp:290-296 [Journal]
  30. Peter C. Fishburn, Ronald L. Graham
    Lexicographic Ramsey Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:280-298 [Journal]
  31. Peter C. Fishburn, William T. Trotter
    Dimensions of hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:278-295 [Journal]
  32. Peter C. Fishburn
    On linear extension majority graphs of partial orders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:65-70 [Journal]
  33. Peter C. Fishburn, Aleksandar Pekec, James A. Reeds
    Subset Comparisons for Additive Linear Orders. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:1, pp:227-243 [Journal]
  34. Peter C. Fishburn
    Three-Valued Representative Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:9, n:3, pp:265-280 [Journal]
  35. Christopher Doble, Jean-Paul Doignon, Jean-Claude Falmagne, Peter C. Fishburn
    Almost Connected Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:4, pp:295-311 [Journal]
  36. Samuel Fiorini, Peter C. Fishburn
    Extendability of Cyclic Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:2, pp:151-171 [Journal]
  37. Peter C. Fishburn, James A. Reeds
    Counting Split Semiorders. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:2, pp:119-128 [Journal]
  38. Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk
    Linear Discrepancy and Bandwidth. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:3, pp:237-245 [Journal]
  39. James A. Reeds, Peter C. Fishburn
    Counting Split Interval Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:2, pp:129-135 [Journal]
  40. Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn
    Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:3, pp:201-225 [Journal]
  41. Paul Erdös, Peter C. Fishburn, Zoltán Füredi
    Midpoints of Diagonals of Convex n-GONS. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:3, pp:329-341 [Journal]
  42. Peter C. Fishburn
    Binary Probabilities Induced by Rankings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:478-488 [Journal]
  43. Peter C. Fishburn
    Thicknesses of Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:489-501 [Journal]
  44. Peter C. Fishburn, Jerry S. Kelly
    Super Arrovian Domains with Strict Preferences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:83-95 [Journal]
  45. Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright
    Interference-Minimizing Colorings of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:15-40 [Journal]
  46. Peter C. Fishburn, Helen M. Marcus-Roberts, Fred S. Roberts
    Unique Finite Difference Measurement. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:334-354 [Journal]
  47. Peter C. Fishburn, James A. Reeds
    Bell Inequalities, Grothendieck's Constant, and Root Two. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:48-56 [Journal]
  48. Peter C. Fishburn, Paul E. Wright
    Interference Patterns in Regular Graphs with Bijective Colorings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:382-402 [Journal]
  49. Peter C. Fishburn
    Preference Structures and Their Numerical Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:217, n:2, pp:359-383 [Journal]
  50. M. R. Best, Marat V. Burnashev, Y. Levy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.
    On a technique to calculate the exact performance of a convolutional code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:441-447 [Journal]
  51. A. Robert Calderbank, Alexandra Duel-Hallen, Peter C. Fishburn, Asya Rabinovich
    Interpolation by Convolutional Codes, Overload Distortion, and the Erasure Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:94-105 [Journal]
  52. A. Robert Calderbank, Peter C. Fishburn
    The normalized second moment of the binary lattice determined by a convolutional code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:166-0 [Journal]
  53. A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
    Covering properties of convolutional codes and associated lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:732-746 [Journal]
  54. Peter C. Fishburn
    Aspects of semiorders within interval orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:2-3, pp:181-191 [Journal]
  55. Peter C. Fishburn
    Paradoxes of two-length interval orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:165-175 [Journal]
  56. Peter C. Fishburn
    Interval graphs and interval orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:135-149 [Journal]
  57. Peter C. Fishburn, Frank K. Hwang, Hikyu Lee
    Do local majorities force a global majority? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:165-179 [Journal]
  58. Peter C. Fishburn
    Interval lengths for interval orders: A minimization problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:63-82 [Journal]
  59. Peter C. Fishburn, N. J. A. Sloane
    The solution to Berlekamp's switching game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:3, pp:263-290 [Journal]
  60. Peter C. Fishburn, W. V. Gehrlein
    The three-permutations problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:3, pp:259-264 [Journal]
  61. Stefan Felsner, Peter C. Fishburn, William T. Trotter
    Finite three dimensional partial orders which are not sphere orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:101-132 [Journal]
  62. Peter C. Fishburn, William T. Trotter
    Split semiorders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:111-126 [Journal]
  63. Paul Erdös, Peter C. Fishburn
    Distinct distances in finite planar sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:97-132 [Journal]
  64. Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp
    Sets uniquely determined by projections on axes II Discrete case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:149-159 [Journal]
  65. Peter C. Fishburn, Larry A. Shepp
    On the FKB conjecture for disjoint intersections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:105-122 [Journal]
  66. Peter C. Fishburn, William T. Trotter
    Linear extensions of semiorders: a maximization problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:25-40 [Journal]
  67. Paul Erdös, Peter C. Fishburn
    Maximum planar sets that determine k distances. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:115-125 [Journal]
  68. Peter C. Fishburn, Peter L. Hammer
    Bipartite dimensions and bipartite degrees of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:127-148 [Journal]
  69. Peter C. Fishburn, Andrew M. Odlyzko
    Dynamic behavior of differential pricing and quality of service options for the internet. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2000, v:28, n:1-2, pp:123-136 [Journal]

  70. Pick-and-choose heuristics for partial set covering. [Citation Graph (, )][DBLP]


  71. Van Lier sequences. [Citation Graph (, )][DBLP]


Search in 0.072secs, Finished in 0.077secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002